期刊文献+

战场宽带数据链分布式虚拟骨干网的构建 被引量:2

Construction of distributed virtual backbone network for battlefield wideband data links
下载PDF
导出
摘要 宽带数据链作为现代战场的神经网络和信息传输通道,必须采用分布式虚拟骨干网构建算法才能适应战场环境的大容量、多样性数据传输和时变性网络结构。针对这一问题,提出了一种分布式虚拟骨干网构建算法-DCDS算法。该算法中,每个节点只需获取其两跳范围内的邻居节点信息,无需获知全网拓扑信息。理论分析和仿真表明,相比Wu等2种经典算法,DCDS算法具有更小的消息开销和虚拟骨干网构建规模,更适合于大数据量、高动态的战场宽带数据链网络。 A wideband data link can be used as an information transmission channel and can act as a neural network in the modern battlefield. To adapt to the character of massive,diversified data transmission and time varying topology of battlefield network,it is necessary to construct virtual backbone networks by applying distributed algorithms.In this paper,a distributed algorithm called DCDS was proposed for constructing virtual backbone networks. In this algorithm,each node only needs to know its 2-hop neighbors rather than all nodes in network. Theoretical analysis and simulation results showed that compared with classical Wu or other algorithms,DCDS algorithm had lower message overhead and smaller virtual backbone size. and therefore it is more suitable for constructing virtual backbone network for battlefield wideband data link characterized by high capacity and dynamic character.
出处 《哈尔滨工程大学学报》 EI CAS CSCD 北大核心 2014年第10期1272-1275,1281,共5页 Journal of Harbin Engineering University
基金 船舶工业国防科技预研基金资助项目(11J3.4.2)
关键词 宽带数据链 高动态 分布式算法 单位圆图 虚拟骨干网 wideband data link high dynamical distributed algorithms unit-disk graph virtual backbone network
  • 相关文献

参考文献13

  • 1王治安.数据链的发展和集成应用[J].现代导航,2012,3(2):139-141. 被引量:8
  • 2WU 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.
  • 3LIU Zhou, WANG Bingwen, GUO Lejiang. A survey on connected set construction algorithm for wireless sensor net- works[J]. Information Technology Journal, 2010, 9 (6) : 1081-1092.
  • 4THAI 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.
  • 5WU Jie, STOJMENOVIC I. On calculating power-aware connected dominating sets for efficient routing in Ad Hoc wireless networks [ J]. Journal of Communications and Net- works, 2002, 4( 1 ) : 1-12.
  • 6DU Hongwei, WU Weili, YE Qiang, et al. CDS-based vir- tual backbone construction with guaranteed routing cost in wireless sensor networks [ J ]. IEEE Transactions on Parallel and Distributed Systems, 2013, 24(4) : 652- 661.
  • 7WU 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.
  • 8ZOU Feng, WANG Yuexuan, XU Xiaohua, et al. New ap- proximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs [ J ]. Theoretical Computer Science, 2011, 412 (3) : 198-208.
  • 9WU 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.
  • 10WAN Pengjun, ALZOUBI K M, FRIEDER O. Distributed construction of connected dominating set in wireless Ad Hoc networks [ C ]//Proceedings of INFOCOM. [ S. l.] : Kluwer Academic Publishers, 2004: 141-149.

二级参考文献5

共引文献7

同被引文献37

引证文献2

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部