无线多跳网络快速跨层资源优化分配算法

冯维; 徐永鑫; 刘浩; 许晓荣; 姚英彪

doi:10.11999/JEIT180581

无线多跳网络快速跨层资源优化分配算法

doi: 10.11999/JEIT180581

杭州电子科技大学通信工程学院杭州 310018

基金项目: 国家自然科学基金(61671192)，浙江省公益计划(LGG19F020014)，中国博士后基金(2017M621796)，浙江省自然科学基金(LY19F010011)，中国移动科研基金(MCM20-2017-0107)，浙江省教育厅一般科研项目(Y201533647)

详细信息

作者简介:
冯维：女，1984年生，讲师，博士，研究方向为无线多跳网络资源分配算法

徐永鑫：男，1997年生，本科生，研究方向为无线传感器网络等资源分配

刘浩：男，1996年生，硕士生，研究方向为无线多跳网络优化问题

许晓荣：男，1982年生，副教授，博士，研究方向为认知无线网络、压缩感知、无线传感器网络

姚英彪：男，1976年生，教授，博士，研究方向为无线传感器网络

通讯作者:
姚英彪　yaoyb@hdu.edu.cn

中图分类号: TP393
计量
- 文章访问数: 2185
- HTML全文浏览量: 720
- PDF下载量: 59
- 被引次数: 0
出版历程
- 收稿日期: 2018-06-12
- 修回日期: 2019-01-15
- 网络出版日期: 2019-01-22
- 刊出日期: 2019-05-01

A Fast Convergent Cross-layer Resource Optimization Allocation Algorithm in Wireless Multi-hop Networks

College of Telecommunication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China

Funds: The National Natural Sicence Foundation of China (61671192), The Public Welfare Plan Project of Zhejiang Province (LGG19F020014), The Postdoctoral Science Foundation of China (2017M621796), The Natural Sicence Foundation of Zhejiang Province (LY19F010011), The Mobile Science Foundation of China (MCM20-2017-0107), The General Science Foundation of Zhejiang Educational Committee (Y201533647)

摘要

摘要: 针对背压路由算法容易造成大量队列积压和收敛速度慢的缺陷，该文研究了无线多跳网络中节点功率受限情况下的联合拥塞控制、路由和功率分配的跨层优化问题。以最大化网络效用为目标，以流平衡条件、功率等为约束条件建模，基于牛顿法提出了一种具有超线性收敛性能的算法，并运用矩阵分裂技术使该算法能够分布式实施。仿真结果表明，该算法在实现网络效用最大化的同时，能够有效提高网络中的能量效用，且能将网络中的队列长度稳定在一个较低水平，降低包传输延时。
- 无线多跳网络 /
- 路由选择 /
- 队列稳定 /
- 拥塞控制 /
- 功率分配
Abstract: In order to improve the performance of the large queue backlogs and low convergence rate in back pressure routing algorithm, the cross-layer optimization of joint congestion control, multi-path routing and power allocation in wireless multi-hop networks is investigated. The system is modeled as a network utility maximization problem under the constraints of flow balancing condition and power. Based on the Newton’s method, the problem is solved and an algorithm with superlinear convergence speed is proposed. With matrix splitting technology, the algorithm can be implemented distributedly further. The simulation results show that the algorithm can effectively increase the energy utility while achieving the maximum network utility, and can keep the queue length at a very low level to decrease the packet transmission delay.
- Wireless multi-hop networks /
- Routing /
- Queue stability /
- Congestion control /
- Power allocation

HTML全文

图 1 网络拓扑

下载: 全尺寸图片幻灯片

图 2 网络效用

下载: 全尺寸图片幻灯片

图 3 能量效用图

下载: 全尺寸图片幻灯片

图 4 网络平均队列长度

下载: 全尺寸图片幻灯片

参考文献(15)

冯维, 冯穗力, 丁跃华, 等. 无线多跳网络下基于过时信道状态信息的跨层资源分配[J]. 电子与信息学报, 2014, 36(11): 2750–2755. doi: 10.3724/SP.J.1146.2013.00546

FENG Wei, FENG Suili, DING Yuehua, et al. Cross-layer resource allocation with outdated channel state Information in wireless multi-hop networks[J]. Journal of Electronics &Information Technology, 2014, 36(11): 2750–2755. doi: 10.3724/SP.J.1146.2013.00546

ERYILMAZ A and SRIKANT R. Joint congestion control, routing, and MAC for stability and fairness in wireless networks[J]. IEEE Journal on Selected Areas in Communications, 2006, 24(8): 1514–1524. doi: 10.1109/jsac.2006.879361

石雷, 韩江洪, 石怡, 等. 无线多跳网络下基于干扰管理的高容量跨层优化策略[J]. 通信学报, 2014, 35(12): 89–97. doi: 10.3969/j.issn.1000-436x.2014.12.011

SHI Lei, HAN Jiang hong, SHI Yi, et al. High capacity cross layer optimization strategy for multi-hop wireless network with interference management[J]. Journal on Communications, 2014, 35(12): 89–97. doi: 10.3969/j.issn.1000-436x.2014.12.011

ALHOSAINY A and KUNZ T. Joint Optimal Congestion, Multipath Routing, and Contention Control for Wireless Ad-hoc Networks[J]. EEE Communications Letters, 2017, PP(99): 1–1. doi: 10.1109/lcomm.2017.2739139

MALEKSHAN K R, ZHUANG W. Joint Scheduling and Transmission Power Control in Wireless Ad Hoc Networks[J]. IEEE Transactions on Wireless Communications, 2017, PP(99): 1–1. doi: 10.1109/wcsp.2009.5371646

WEI E, OZDAGLAR A, and JADBABAIE A. A distributed newton method for network utility maximization[C]. 49th IEEE Conference on Decision and Control, Atlanta, USA, 2010: 1816–1821.

LIU Jia and SHERALI H D. A distributed Newton’s method for joint multi-hop routing and flow control: Theory and algorithm[C]. 2012 Proceedings IEEE INFOCOM, Orlando, USA, 2012: 2489–2497.

LIU Jia, SHROFF N B, XIA C, et al. Joint congestion control and routing optimization: an efficient second-order distributed approach[J]. IEEE/ACM Transactions on Networking, 2016, 24(3): 1404–1420. doi: 10.1109/TNET.2015.2415734

YU Hao and NEELY M J. A new backpressure algorithm for joint rate control and routing with vanishing utility optimality gaps and finite queue lengths[C]. IEEE INFOCOM 2017-IEEE Conference on Computer Communications, Orlando, USA, 2017: 1–9.

HAI L, GAO Q, WANG J, et al. Delay-optimal back-pressure routing algorithm for multi-hop wireless networks[J]. IEEE Transactions on Vehicular Technology, 2017, PP(99): 1–1. doi: 10.1109/TVT.2017.2770183

JU H, LIANG B, LI J, et al. Dynamic power allocation for throughput utility maximization in interference-limited networks[J]. IEEE Wireless Communications Letters, 2013, 2(1): 22–25. doi: 10.1109/wcl.2012.100912.120512

NEELY M J. Super-fast delay tradeoffs for utility optimal fair scheduling in wireless networks[J]. IEEE Journal on Selected Areas in Communications, 2006, 24(8): 1489–1501. doi: 10.1109/jsac.2006.879357

HIRIART-URRUTY J B and LEMARÉCHAL C. Convex analysis and minimization algorithms[J]. Grundlehren Der Mathematischen Wissenschaften, 1993, 1185(1): 150–159. doi: 10.1007/978-3-662-06409-2_2

WOŹNICKI Z I. Matrix splitting principles[J]. International Journal of Mathematics and Mathematical Sciences, 2001, 28(5): 251–284. doi: 10.1155/s0161171201007062

NESTEROV I E and NEMIROVSKIĬ A S. Interior point polynomial algorithms in convex programming, SAM[J]. Studies in Applied Mathematics Philadelphia Siam, 1994, 6(4): 344–345. doi: 10.1137/1.9781611970791

施引文献

资源附件(0)

访问统计