Robust Trajectory and Transmit Power Design for Secure UAV Communications

• Published in: IEEE transactions on vehicular technology Vol. 67; no. 9; pp. 9042 - 9046
• Main Authors: Cui, Miao, Zhang, Guangchi, Wu, Qingqing, Ng, Derrick Wing Kwan
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.09.2018; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Communications systems; Computational geometry; Computer simulation; Convexity; Cybersecurity; Eavesdropping; Iterative methods; Optimization; Physical layer; physical layer security; power control; Robust design; Robustness; Trajectories; Trajectory; trajectory optimization; UAV communications; Unmanned aerial vehicles; Wireless communication; Wireless communications
• ISSN: 0018-9545; 1939-9359
• DOI: 10.1109/TVT.2018.2849644

Unmanned aerial vehicles (UAVs) are anticipated to be widely deployed in future wireless communications, due to their advantages of high mobility and easy deployment. However, the broadcast nature of airto-ground line-of-sight wireless channels brings a new challenge to the information security of UAV-ground communication. This paper tackles such a challenge in the physical layer by exploiting the mobility of UAV via its trajectory design. We consider a UAV-ground communication system with multiple potential eavesdroppers on the ground, where the information on the locations of the eavesdroppers is imperfect. We formulate an optimization problem, which maximizes the average worst case secrecy rate of the system by jointly designing the robust trajectory and transmit power of the UAV over a given flight duration. The nonconvexity of the optimization problem and the imperfect location information of the eavesdroppers make the problem difficult to be solved optimally. We propose an iterative suboptimal algorithm to solve this problem efficiently by applying the block coordinate descent method, S-procedure, and successive convex optimization method. Simulation results show that the proposed algorithm can improve the average worst case secrecy rate significantly, as compared to two other benchmark algorithms without robust design.