Optimal geometric solutions to UAV-enabled covert communications in line-of-sight scenarios

Document Type

Journal Article

Publication Title

IEEE Transactions on Wireless Communications




School of Science / ECU Security Research Institute


National Natural Science Foundation of China under Grant No. U19B2014, 62001094 / Guangdong Basic and Applied Basic Research Foundation under Grant No. 2019A1515111162 / China Postdoctoral Science Foundation Grant No. 2020M683290, 2021T140095 / Fundamental Research Funds for the Central Universities under Grant No. ZYGX2020J030


Rao, H., Xiao, S., Yan, S., Wang, J., & Tang, W. (2022). Optimal geometric solutions to UAV-enabled covert communications in line-of-sight scenarios. IEEE Transactions on Wireless Communications. Advance online publication. https://doi.org/10.1109/TWC.2022.3185492


This work employs an unmanned aerial vehicle (UAV) as a jammer to aid a covert communication from a transmitter Alice to a receiver Bob, where the UAV transmits artificial noise (AN) with random power to deliberately create interference to a warden Willie. In the considered system, the UAV’s trajectory is critical to the covert communication performance, since the AN transmitted by the UAV also generates interference to Bob. To maximize the system performance, we formulate an optimization problem to jointly design the UAV’s trajectory and Alice’s transmit power. The formulated optimization problem is non-convex and is normally solved by a conventional iterative (CI) method, which requires multiple approximations based on Taylor expansions and an initialization on the UAV’s trajectory. In order to eliminate these requirements, this work, for the first time, develops a geometric (GM) method to solve the optimization problem. By analyzing the covertness constraint, the GM method decouples the joint optimization into optimizing the UAV’s trajectory and Alice’s transmit power separately. Our examination shows that the GM method can significantly outperform the CI method in terms of achieving a higher average covert rate and the complexity of the GM method is lower than that of the CI method.



Access Rights

subscription content