全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

战场宽带数据链分布式虚拟骨干网的构建

DOI: 10.3969/j.issn.1006-7043.201308060

Keywords: 宽带数据链, 高动态, 分布式算法, 单位圆图, 虚拟骨干网

Full-Text   Cite this paper   Add to My Lib

Abstract:

宽带数据链作为现代战场的神经网络和信息传输通道,必须采用分布式虚拟骨干网构建算法才能适应战场环境的大容量、多样性数据传输和时变性网络结构。针对这一问题,提出了一种分布式虚拟骨干网构建算法-DCDS算法。该算法中,每个节点只需获取其两跳范围内的邻居节点信息,无需获知全网拓扑信息。理论分析和仿真表明,相比Wu等2种经典算法,DCDS算法具有更小的消息开销和虚拟骨干网构建规模,更适合于大数据量、高动态的战场宽带数据链网络。

References

[1]  王治安.数据链的发展与集成应用[J].现代导航, 2012(2): 139-141.WANG Zhian. Development and intergration applicaition of data link[J].Modern Navigation, 2012(2): 139-141.
[2]  WU Weili, DU Hongwei, JIA Xiaohua, et al. Minimum connected dominating sets and maximal independent sets in unit disk graphs[J].Theoretical Computer Science, 2006, 352(1): 1-7.
[3]  LIU Zhou, WANG Bingwen, GUO Lejiang. A survey on connected set construction algorithm for wireless sensor networks[J]. Information Technology Journal, 2010, 9(6): 1081-1092.
[4]  THAI M T, WANG F, LIU D, et al. Connected dominating sets in wireless networks with different transmission ranges[J]. IEEE Trans Mobile Computing, 2007, 6(7): 721-730.
[5]  WU Jie, STOJMENOVIC I. On calculating power-aware connected dominating sets for efficient routing in Ad Hoc wireless networks[J]. Journal of Communications and Networks, 2002, 4(1): 1-12.
[6]  DU Hongwei, WU Weili, YE Qiang, et al. CDS-based virtual backbone construction with guaranteed routing cost in wireless sensor networks[J]. IEEE Transactions on Parallel and Distributed Systems, 2013, 24(4): 652-661.
[7]  WU J. Extended dominating-set-based routing in Ad Hoc wireless networks with unidirectional data links[J]. IEEE Transmissions on Parallel and Distributed Computing, 2002, 22(4): 327-340.
[8]  ZOU Feng, WANG Yuexuan, XU Xiaohua, et al. New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs[J]. Theoretical Computer Science, 2011, 412(3): 198-208.
[9]  WU Jie, DAI Fei. Iterative local solutions for connected dominating sets in Ad Hoc wireless networks[J]. IEEE Transactions on Computers, 2008, 57(5): 1-14.
[10]  WAN Pengjun, ALZOUBI K M, FRIEDER O. Distributed construction of connected dominating set in wireless Ad Hoc networks[C]//Proceedings of INFOCOM.: Kluwer Academic Publishers, 2004: 141-149.
[11]  CLARK B N, COLBOURN C J, JOHNSON D S. Unit disk graphs, discrete mathmatics[M].[S.l.]: Prentice Hall, 1990: 165-177.
[12]  YIN Jianhong, WU Kaiya. Graph theory and its algorithm[M]. New York: Taylor and Francis Group, 2005: 168-179.
[13]  ROSEN K H. Discrete mathematics and its applications[M]. 7th ed. New York: McGraw Hill Higher Education, 2012: 142-143.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133