Research of UAV communication relay deployment problems in target reconnaissance mission

When UAVs carry out reconnaissance mission, it needs a reliable communication link as a guarantee for the purpose of transmitting the target intelligence data back to the ground control station. In most cases, is impossible to meet the demand of data transmission relying only on the Communication ability of one UAV. Through the use of multiple UAVs to build a communication relay link, is a feasible method to realize remote data transmission. In the presence of communication blind area and the limited number of available UAV, how to locate UAV reasonably, in order to get better communication relay link quality, is the focus of concern. The UAV deployment problem with single target and multi targets is modeled as AHOP problem and Steiner tree problem respectively. We propose the IBF algorithm based on Bellman-Ford algorithm, and propose the PGA algorithm based on the combination of Pareto solution and GA algorithm, to solve the problem of deploying UAV in the communication relay link with single and multi target respectively, carries out simulation test and analysis results, which shows the effectiveness of the IBF algorithm and PGA algorithm.

[1]  M.F.J. Pinkney,et al.  Unmanned aerial vehicle (UAV) communications relay , 1996, Proceedings of MILCOM '96 IEEE Military Communications Conference.

[2]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[3]  Liang Dong,et al.  Real-Time Video Relay for UAV Traffic Surveillance Systems Through Available Communication Networks , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[4]  José Coelho de Pina,et al.  Algorithms for Terminal Steiner Trees , 2005, COCOON.

[5]  Joel M. Esposito,et al.  Maintaining wireless connectivity constraints for swarms in the presence of obstacles , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[6]  Carmen Cerasoli.  An Analysis of Unmanned Airborne Vehicle Relay Coverage in Urban Environments , 2007, MILCOM 2007 - IEEE Military Communications Conference.

[7]  Kemal Altinkemer,et al.  Using a Hop-Constrained Model to Generate Alternative Communication Network Design , 2015, INFORMS J. Comput..

[8]  Omer Cetin,et al.  Continuous Airborne Communication Relay Approach Using Unmanned Aerial Vehicles , 2012, J. Intell. Robotic Syst..

[9]  H. T. Kung,et al.  Maximizing Throughput of UAV-Relaying Networks with the Load-Carry-and-Deliver Paradigm , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[10]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[11]  Marc D. Takahashi,et al.  in Urban Environments , 2008 .

[12]  Ariel Orda,et al.  Computing shortest paths for any number of hops , 2002, TNET.

[13]  Geir Dahl,et al.  On the directed hop-constrained shortest path problem , 2004, Oper. Res. Lett..

[14]  Patrick Doherty,et al.  Optimal placement of UV-based communications relay nodes , 2010, J. Glob. Optim..

[15]  G. Yilmaz,et al.  Obstacle Free Airborne Communication Relay Approach by Using Autonomous Unmanned Aerial Vehicles , 2022 .