无人机中继链路部署算法设计  

Design of relay link deployment algorithms for unmanned aerial vehicles

作　　者：方斌[1] 陈特放[1,2] 

机构地区：[1]中南大学交通运输工程学院,长沙410075 [2]中南大学信息科学与工程学院,长沙410075

出　　处：《计算机应用》2014年第6期1558-1562,共5页journal of Computer Applications

摘　　要：在存在通信盲区以及无人机(UAV)使用数目受限等情况下,针对如何合理地部署UAV并构建通信中继链路,以及扩展UAV的数据传输距离的问题,提出改进Bellman-Ford(IBF)算法和改进Dijkstra算法(IDA)两个UAV中继链路部署算法。将通信中继链路中UAV部署问题形式化表示为全跳最优路径(AHOP)问题,其中IBF算法用来迭代生成一组可达记录集,通过逆向访问记录集可生成一组部署方案;IDA则在每轮迭代过程中改变连接边的权值,并查找能有效减少中继链路跳数的有效方案,得到UAV中继部署问题的可行解。仿真结果表明IBF和IDA能够提供中继链路部署的有效方案,同时它们的时间性能优于Bellman-Ford算法。To get a reasonable deployment and a communication relay link model of Unmanned Aerial Vehicle （UAV）, and extend the data transmission distance, the Improved Bellman-Ford （IBF） algorithm and the Improved Dijkstra Algorithm （IDA） were proposed considering communication blind area and limited number of available UAVs. The UAV deployment problem was modeled as a All Hop Optimal Path （AHOP） problem, in which the IBF algorithm was used to generate a set of reachable records, and the solutions were got by accessing the records reversely; Then the IDA algorithm changed the connection weights of edges in each iteration process and found the path which decreased the hops of relay link, hence the feasible solution of UAV relay deployment problem was got. The simulation analysis illustrates that IBF and IDA can provide effective solutions of relay link deployment, and the time performance of the proposed algorithms are superior to Bellman-Ford （BF） algorithm.

关 键 词：无人机 通信中继 全跳最优路径 Bellman-Ford算法 DIJKSTRA算法 

分 类 号：TP273[自动化与计算机技术—检测技术与自动化装置]