[1]孙延维,周谦.基于k边连通最小生成子图的网络拓扑管理算法[J].江西师范大学学报(自然科学版),2016,40(02):149-152.
 SUN Yanwei,ZHOU Qian.The Algorithm of Network Topology Management Using k-Edge Connected Minimal Spanning Sub-Graph[J].,2016,40(02):149-152.
点击复制

基于k边连通最小生成子图的网络拓扑管理算法()
分享到:

《江西师范大学学报》(自然科学版)[ISSN:1006-6977/CN:61-1281/TN]

卷:
40
期数:
2016年02期
页码:
149-152
栏目:
出版日期:
2016-03-25

文章信息/Info

Title:
The Algorithm of Network Topology Management Using k-Edge Connected Minimal Spanning Sub-Graph
作者:
孙延维;周谦
1.湖北第二师范学院基础教育信息技术服务湖北省协同创新中心,湖北 武汉 430205; 2.江苏电力信息技术有限公司,江苏 南京 210000
Author(s):
SUN YanweiZHOU Qian
1.Collaborative Innovation Center in Hubei Province on Fundamental Education and IT Services,Hubei University of Education, Wuhan Hubei 430205,China; 2.Jiangsu Electric Power Information Technology Co.,Ltd,Nanjing Jiangsu 210000,China
关键词:
可移动社区 k边连通 最小生成子图 拓扑管理
Keywords:
mobile community k-edge connected minimum spanning sub-graph topology management
分类号:
TP 393
文献标志码:
A
摘要:
可移动社区依托于移动自组网,其特征决定了社区网络的临时性通信范围的有限性以及网络拓扑结构的高度动态性.利用图论的理论和方法,提出了一种基于k边连通最小生成子图的网络拓扑管理算法,算法以能量消耗等因素衡量链路的代价值,通过减少高代价的冗余链路来优化拓扑结构,能够较好地适应可移动社区拓扑管理的需求.实验结果表明:该拓扑管理算法有效地减少了网络整体能量损耗,延长了网络的生命周期.
Abstract:
The mobile community is based on the mobile ad hoc network,which determines the temporary,the limited communication range and the high dynamic of the network topology.Using the theory and method of graph theory,a new algorithm is proposed,which uses the k-edge connected minimum spanning sub-graph.The algorithm uses energy consumption and other factors to measure the value of the link,and can adapt to the requirements of the mobile community topology management by reducing the high cost of redundant links.Experimental results show that the topology management algorithm can effectively reduce the energy loss of the network,and prolong the life cycle of the network.

参考文献/References:

[1] 李琦琦.智能手机可移动社区组网技术研究及其应用 [D].重庆:重庆邮电大学,2013:23-42.
[2] 方旭明.移动 Ad Hoc 网络研究与发展现状 [J].数据通信,2003(4):15-18.
[3] Gerla,Mario,Jack Tzu-Chieh Tsai.Multicluster,mobile,multimedia radio network [J].Wireless Networks,2010,1(3):255-265.
[4] Ephremides,Anthony,Jeffrey E,et al.A design concept for reliable mobile radio networks with frequency hopping signaling [J].Proceedings of the IEEE,1987,75(1):56-73.
[5] An B,Papavassiliou S.A mobility-based clustering approach to support mobility management and multicast routing in mobile ad-hoc wireless networks [J].International Journal of Network Management,2001,11(6):387-395.
[6] Ning Xiangyan,Zhang Shunyi,Liang Wei.A novel way of MANET management domain partition [J].Education Technology and Computer Science,2010(3):221-232.
[7] 郭胜召.一种基于权值的 AdHoc网络分簇算法 [J].信息技术与信息化,2012(2):41-43.
[8] Bao Lichun,Jose Juaquin Garcia-Luna-Aceves.Topology management in ad hoc networks [EB/OL].
[2015-10-02].http://citeseer.ist.psu.edu/viewdoc/download; jsessionid=706DE01B22FBC80EF405FD09AB4DE7CC?doi=10.1.1.12.8421&rep=rep1&type=pdf.
[9] Chen Wenli,Jain N,Singh S.ANMP:Ad hoc network management protocol [J].Selected Areas in Communications,1999,17(8):1506-1531.
[10] Cheng C T,Lemberg H L,Philip S J,et al.SLALoM:a scalable location management scheme for large mobile ad-hoc networks [J].Wireless Communications and Networking Conference,2002(2):1123-1131.
[11] McAuley,Anthony,Raquel Morera.LNS-SID mobility management in dynamic ad hoc networks [J].Vehicular Technology Conference,2003(3):1994-1998.
[12] Wang Liang,Zhang Naitong.Locally forwarding location management in ad-hoc networks [J].Communications,Circuits and Systems and West Sino Expositions,2002(1):768-779.
[13] 胡兴雨.移动 Ad hoc 网络拓扑结构抗毁性研究 [D].长沙:国防科学技术大学,2009:34-47.
[14] Sun Ruozi,Wang Yue,Yuan Jian,et al.Topology control algorithm using fault-tolerant 1-spanner for wireless ad hoc networks [J].Tsinghua Science and Technology,2012,17(2):186-193.
[15] 王亚东.MANET 网络拓扑控制技术研究 [D].西安:西安电子科技大学,2012:45-67.
[16] 殷剑宏,吴开亚.图论及其算法 [M].合肥:中国科学技术大学出版,2003:20-22.
[17] 管梅谷.求最小树的破圈法 [J].数学的实践与认识,1975,5(4):38-41.

备注/Memo

备注/Memo:
基金项目:国家自然科学青年基金(61402155)资助项目.
更新日期/Last Update: 1900-01-01