摘要
宽带数据链作为现代战场的神经网络和信息传输通道,必须采用分布式虚拟骨干网构建算法才能适应战场环境的大容量、多样性数据传输和时变性网络结构。针对这一问题,提出了一种分布式虚拟骨干网构建算法-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