Abstract

In this paper, we study an unmanned aerial vehicle (UAV)-enabled covert communication network in which a UAV communicates to multiple ground users (GUs) without being detected by a ground detector. Considering the fairness, we aim at a joint UAV trajectory and transmit power design to maximize the minimum throughput among all GUs under constraints including mobility and covertness. By characterizing the covertness constraint, the joint design problem is transformed to a pure trajectory design which is still non-convex and with infinite number of variables. To address the problem, we adopt the optimal successive-hover-and-fly (SHF) trajectory structure to reformulate it to a new one with limited number of variables, and efficiently solve the reformulated problem via introducing a set of tight convex approximations to the problem and applying the successive convex approximation (SCA) method. Simulation results show the high performance with respect to covert communication throughput and the low complexity of proposed design in comparison to the benchmark.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call