TY - GEN
T1 - Joint Resource Allocation and Trajectory Design for UAV-Assisted Covert Coverage Maximization
AU - Mao, Haobin
AU - Liu, Yanming
AU - Yang, Junyi
AU - Xiao, Zhenyu
AU - Han, Zhu
AU - Xia, Xiang Gen
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - The successful and complete downlink transmission of critical data from an unmanned aerial vehicle (UAV) base station, such as control command and intelligence information, is essential for ground users to perform specific tasks in adversarial scenarios. In this paper, we propose to employ a UAV to disseminate data to ground users aiming at meeting their data demand, where a warden attempts to detect the transmission. To maximize the covert coverage, we formulate an optimization problem to maximize the number of served users through joint resource allocation and UAV trajectory design. To solve the formulated mixed-integer non-convex problem, we first relax the original problem and then propose a penalty-based two-loop iterative algorithm. Specifically, the resource allocation and the UAV trajectory are alternatively optimized by employing the block successive convex approximation (BSCA) method in the inner loop, while the Lagrangian penalty multipliers are updated in the outer loop. Simulation results have validated the fast convergence and performance superiority of our proposed method compared to the benchmarks in the literature.
AB - The successful and complete downlink transmission of critical data from an unmanned aerial vehicle (UAV) base station, such as control command and intelligence information, is essential for ground users to perform specific tasks in adversarial scenarios. In this paper, we propose to employ a UAV to disseminate data to ground users aiming at meeting their data demand, where a warden attempts to detect the transmission. To maximize the covert coverage, we formulate an optimization problem to maximize the number of served users through joint resource allocation and UAV trajectory design. To solve the formulated mixed-integer non-convex problem, we first relax the original problem and then propose a penalty-based two-loop iterative algorithm. Specifically, the resource allocation and the UAV trajectory are alternatively optimized by employing the block successive convex approximation (BSCA) method in the inner loop, while the Lagrangian penalty multipliers are updated in the outer loop. Simulation results have validated the fast convergence and performance superiority of our proposed method compared to the benchmarks in the literature.
KW - UAV covert communications
KW - convex optimization
KW - resource allocation
KW - trajectory design
UR - http://www.scopus.com/inward/record.url?scp=85190270161&partnerID=8YFLogxK
U2 - 10.1109/GCWkshps58843.2023.10464993
DO - 10.1109/GCWkshps58843.2023.10464993
M3 - Conference contribution
AN - SCOPUS:85190270161
T3 - 2023 IEEE Globecom Workshops, GC Wkshps 2023
SP - 1081
EP - 1086
BT - 2023 IEEE Globecom Workshops, GC Wkshps 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2023 IEEE Globecom Workshops, GC Wkshps 2023
Y2 - 4 December 2023 through 8 December 2023
ER -