TY - JOUR
T1 - Joint User Scheduling, Power Allocation, and Trajectory Design for Joint Synthetic Aperture Radar and Communication UAV Systems
AU - Liu, Ziyi
AU - Fei, Zesong
AU - Wang, Xinyi
AU - Liu, Peng
AU - Xu, Shanfeng
AU - Zhou, Jianming
AU - Yuan, Weijie
N1 - Publisher Copyright:
© 1967-2012 IEEE.
PY - 2024
Y1 - 2024
N2 - Due to the highly controllable mobility, unmanned aerial vehicles (UAVs) are able to simultaneously provide efficient communication and synthetic aperture radar (SAR) based high-precision sensing. In this paper, we investigate joint user scheduling, power allocation, and trajectory design in a joint SAR and communication (JSARC) UAV system. Two problems, i.e. maximization of minimum user throughput and maximization of sum throughput, are investigated under transmit power, UAV mobility, and SAR-based sensing constraints. We propose two joint user scheduling, power allocation and trajectory design (JUPT) algorithms for solving the non-convex problems via alternating optimization. In particular, to execute power allocation more efficiently, two bi-section searching methods are proposed based on Karush-Kuhn-Tucker (KKT) conditions. Simulation results validate the efficiency of the proposed algorithms by illustrating the convergence behavior. The impacts of various factors on sum/minimum user throughput have been investigated, and distinct user scheduling and power allocation results for the two cases are provided.
AB - Due to the highly controllable mobility, unmanned aerial vehicles (UAVs) are able to simultaneously provide efficient communication and synthetic aperture radar (SAR) based high-precision sensing. In this paper, we investigate joint user scheduling, power allocation, and trajectory design in a joint SAR and communication (JSARC) UAV system. Two problems, i.e. maximization of minimum user throughput and maximization of sum throughput, are investigated under transmit power, UAV mobility, and SAR-based sensing constraints. We propose two joint user scheduling, power allocation and trajectory design (JUPT) algorithms for solving the non-convex problems via alternating optimization. In particular, to execute power allocation more efficiently, two bi-section searching methods are proposed based on Karush-Kuhn-Tucker (KKT) conditions. Simulation results validate the efficiency of the proposed algorithms by illustrating the convergence behavior. The impacts of various factors on sum/minimum user throughput have been investigated, and distinct user scheduling and power allocation results for the two cases are provided.
KW - Joint radar and communication
KW - synthetic aperture radar
KW - trajectory design
KW - unmanned aerial vehicle
UR - http://www.scopus.com/inward/record.url?scp=85208103074&partnerID=8YFLogxK
U2 - 10.1109/TVT.2024.3479247
DO - 10.1109/TVT.2024.3479247
M3 - Article
AN - SCOPUS:85208103074
SN - 0018-9545
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
ER -