网络连通度约束下低开销的拓扑控制

doi:10.13190/j.jbupt.2018-186

北京邮电大学学报 ›› 2018, Vol. 41 ›› Issue (5): 126-130.doi: 10.13190/j.jbupt.2018-186

网络连通度约束下低开销的拓扑控制

许蒙蒙, 徐恒舟, 朱海, 王宝凤

周口师范学院网络工程学院, 河南周口 466001

收稿日期:2018-08-09 出版日期:2018-10-28 发布日期:2018-11-20
作者简介:许蒙蒙(1987-),男,讲师,E-mail:568062616@qq.com.
基金资助:
国家自然科学基金项目（61702071，61801527）；河南省科技发展计划项目（182102310867）

Low-Cost Topology Control under Network Connectivity Constraint

XU Meng-meng, XU Heng-zhou, ZHU Hai, WANG Bao-feng

School of Network Engineering, Zhoukou Normal University, Henan Zhoukou 466001, China

Received:2018-08-09 Online:2018-10-28 Published:2018-11-20

摘要/Abstract

摘要： 为实现网络开销与网络连通度的权衡设计，分别基于链路添加和链路删除提出2个启发式的拓扑构建算法.通过采用网络图的代数连通度，并定义无线链路的连通度开销比这一新的拓扑度量，计算每条链路在拓扑优化中的权值.所提的启发式算法可根据该链路权值进行无线链路的添加或删除.设计了若干网络开销函数，以满足不同的网络场景.仿真结果表明，所提的启发式算法能够生成低开销的网络拓扑，同时满足给定的连通度约束.

关键词: 拓扑控制, 连通度约束, 网络开销, 启发式算法

Abstract: In order to achieve the tradeoff between network cost and network connectivity, two heuristic algorithms for topology control, which are based on link addition and link removal, respectively, are proposed. Each link's weight in the topology optimization is calculated by employing the theory of algebraic connectivity and introducing a new topology metric for each wireless link. The proposed algorithms add or delete a link according to its weight. We conceive some cost functions for different network scenarios. Simulations show that our proposed algorithms could generate the low-cost topologies under the network connectivity constraint.

Key words: topology control, connectivity constraint, network cost, heuristic algorithm

中图分类号:

TN915.1

许蒙蒙, 徐恒舟, 朱海, 王宝凤. 网络连通度约束下低开销的拓扑控制[J]. 北京邮电大学学报, 2018, 41(5): 126-130.

XU Meng-meng, XU Heng-zhou, ZHU Hai, WANG Bao-feng. Low-Cost Topology Control under Network Connectivity Constraint[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2018, 41(5): 126-130.

参考文献

[1] Zhao X, Zhang Y, Jiang C, et al. Mobile-aware topology control potential game:equilibrium and connectivity[J]. IEEE Internet of Things Journal, 2016, 3(6):1267-1273.
[2] Xu M, Yang Q, Kwak K. Algebraic connectivity aided energy-efficient topology control in selfish ad hoc networks[J]. Wireless Networks, 2017, 23(5):1331-1341.
[3] Waqas A, Mahmood H. A game theoretical approach for topology control in wireless ad hoc networks with selfish nodes[J]. Wireless Personal Communications, 2017, 96(1):249-263.
[4] Yan Z, Jiang H, Shen Z, et al.-connectivity analysis of one-dimensional linear VANETs[J]. IEEE Transactions on Vehicular Technology, 2012, 61(1):426-433.
[5] Ma G, Yang Y, Qiu X, et al. Fault-tolerant topology control for heterogeneous wireless sensor networks using multi-routing tree[C]//2017 IFIP/IEEE Symposium on Integrated Network and Service Management. Lisbon:IEEE Press, 2017:620-623.
[6] Li X, Cai J. Topology control for guaranteed connectivity provisioning in heterogeneous sensor networks[J]. IEEE Sensors Journal, 2016, 16(12):5060-5071.
[7] Shi Y, Sun H, Sheng M, et al. Constructing a robust topology control for reliable communications in multi-channel cognitive radio ad hoc networks[J]. IEEE Communications Magazine, 2018, 56(4):172-179.
[8] 刘洲洲, 彭寒. 基于节点可靠度的无线传感器网络拓扑控制算法[J]. 吉林大学学报(工学版), 2018, 48(2):571-577. Liu Z Z, Peng H. Topology control algorithm based on node reliability in WSN[J]. Journal of Jilin University (Engineering and Technology Edition), 2018, 48(2):571-577.
[9] 王恒, 夏枢洋, 王平. 适用于工业无线WIA-PA网络的负载均衡成簇方法[J]. 北京邮电大学学报, 2017, 40(2):29-35, 42. Wang H, Xia S Y, Wang P. Load-balanced clustering scheme for WIA-PA industrial wireless networks[J]. Journal of Beijing University of Posts and Telecommunications, 2017, 40(2):29-35, 42.
[10] Cuomo F, Abbangnale A, Cianfrani A, et al. Keeping the connectivity and saving the energy in the internet[C]//INFOCOM. Shanghai:IEEE Press, 2011:319-324.
[11] Gasparri A, Sabattini L, Ulivi G. Bounded control law for global connectivity maintenance in cooperative multirobot systems[J]. IEEE Transactions on Robotics, 2017, 33(3):700-717.
[12] Lorenzo P, Barbarossa S. Distributed estimation and control of algebraic connectivity over random graphs[J]. IEEE Transactions on Signal Processing, 2014, 62(1):5615-5628.

网络连通度约束下低开销的拓扑控制

Low-Cost Topology Control under Network Connectivity Constraint

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 10

编辑推荐

Metrics

本文评价

[1]	孔紫璇李航向万陈亚文郑伟. 用户动态接入下的多播业务链部署和调整方法[J]. 北京邮电大学学报, 2022, 45(6): 55-61.
[2]	李航, 温向明, 孔紫璇, 向万, 王鲁晗. 面向多样化需求的网络切片业务链部署[J]. 北京邮电大学学报, 2022, 45(2): 9-15.
[3]	陈维兴, 苏景芳, 赵卉. 基于博弈的机坪感知网络机会传输控制方法[J]. 北京邮电大学学报, 2020, 43(5): 57-63.
[4]	王青山, 汤颖, 王琦, 王翟, 陈莉君. 校园移动社交网络中基于种子的数据分发算法[J]. 北京邮电大学学报, 2017, 40(2): 97-101.
[5]	张姿, 黄廷磊. 面向无线移动Mesh网络的路由节点移动决策机制[J]. 北京邮电大学学报, 2016, 39(4): 7-12.
[6]	朱敬华, 尹旭明, 王楠, 李金宝, 吴志强. 无线传感网移动数据收集路径规划算法[J]. 北京邮电大学学报, 2016, 39(3): 110-113.
[7]	彭海云, 候燕. 路径重链接的GRASP最优化无线自组织网络能耗[J]. 北京邮电大学学报, 2015, 38(4): 122-127.
[8]	许蒙蒙, 杨清海. 局部信息约束下的拓扑控制[J]. 北京邮电大学学报, 2014, 37(s1): 87-91.
[9]	时锐，左德承，张展，杨孝宗. 移动自组网的容错拓扑控制技术[J]. 北京邮电大学学报, 2005, 28(5): 110-113.
[10]	忻展红, 吴启程, 莫文冬. 七号信令网的A／B平面划分问题及其启发式解法[J]. 北京邮电大学学报, 2001, 24(1): 22-27.