改进的贪婪算法在无人机组网中的研究与应用  

Research and Application of Improved Greedy Algorithm in UAV Network

作　　者：逯建琦 南建国[1] 李雪 LU Jianqi;NAN Jianguo;LI Xue(Aeronautics Engineering College,Air Force Engineering University,Xi'an 710038,China)

机构地区：[1]空军工程大学航空工程学院,西安710038

出　　处：《空军工程大学学报（自然科学版）》2020年第2期41-46,共6页Journal of Air Force Engineering University(Natural Science Edition)

摘　　要：针对小型军用无人机平台小、速度快、能量有限导致的集群组网中节点生存时间受限、投递率低等问题,借鉴贪婪算法,提出一种复合权值的无线自组网路由算法。为减小边缘节点和低能节点对路径的影响,在算法中添加了边界评价因子和能量均衡2个优化参数对节点进行筛选,再利用Dijkstra算法的思想寻找网络中能量-拥塞复合权值最小的转发路径进行数据传输。仿真结果表明,与AODV算法和AOMDV算法相比,该算法在投递成功率、端到端时延、网络生存周期、路由开销方面均有良好性能。Aimed at the problems that the life time of nodes is limited,and the delivery rate is low in the cluster network because the platform of miniature military drone is small in size,the drone is high at speed,and the energy is limited,this paper proposes a wireless Ad Hoc network routing algorithm(Dijkstra-Compound Weight Routing Algorithm,Dijkatra-CWRA)with compound weight by referring to the greedy algorithm.In order to reduce the influence of edge nodes and low-energy nodes on the path,two optimization parameters,boundary evaluation factor and energy balance,are added to the algorithm to screen the nodes,and the idea of Dijkstra algorithm is used to find the forwarding path with the minimum energy-congestion compound weight in the network for data transmission.The simulation results show that compared with the AODV algorithm and the AOMDV algorithm,the proposed algorithm has good performance in aspects of the delivery success rate,the end-to-end delay,the network lifetime and the routing overhead.

关 键 词：小型军用无人机 集群组网 CWRA DIJKSTRA 投递成功率 网络生存周期 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]