航空集群网络路由约束连通支配集路由算法  

Connected Dominating Sets Routing Algorithm Based on Guaranteed Routing Cost for Aeronautic Swarm Network

作　　者：张步硕 吕娜 陈柯帆[1] 曹芳波 刘创 ZHANG Bu-shuo;LYU Na;CHEN Ke-fan;CAO Fang-bo;LIU Chuang(School of Informational and Navigation,Air Force Engineering University,Xi’an 710077,China)

机构地区：[1]空军工程大学信息与导航学院,西安710077

出　　处：《火力与指挥控制》2018年第11期11-16,共6页Fire Control & Command Control

基　　金：国家自然科学基金资助项目(61472443)

摘　　要：航空集群作战由于具有规模大、时效性高、作战平台资源有限的特点,现有路由算法不能很好地适应于航空集群作战这种特殊环境。结合连通支配集理论,提出路由约束连通支配集路由算法。算法通过构建节点权值函数,分布式构造基于路由约束的连通支配集形成一个骨干网,在此基础上,设计路由约束连通支配集路由算法,使得数据转发可以高效进行,并基于有向图设计骨干网维护机制。仿真结果和理论分析表明,算法在时延、路由开销、死亡节点数方面的综合表现优于经典路由算法,能够较好地适应于航空集群网络。The existing routing algorithms are not suitable for the special environment of aeronautic swarm operation because of its large scale,high timeliness and limited operational platform resources of battle platform.In this regard,this paper proposes a connected dominating set routing algorithm which guarantees routing cost based on the connected dominating set theory.The algorithm constructs a node weight function and constructs a virtual backbone network to guarantee the routing cost.In this way,a routing algorithm based on dominating set is designed to make the data forwarding efficiently.Simulation results and theoretical analysis show that the proposed algorithm outperforms classical routing algorithms in terms of time delay,network overhead and number of dead nodes,and the proposed algorithm has stronger adaptability to aeronautic swarm network.

关 键 词：航空集群网络 连通支配集 路由算法 

分 类 号：TN915[电子电信—通信与信息系统] TJ8[电子电信—信息与通信工程]