This paper studies a multi-unmanned aerial vehicle(UAV)enabled wireless communication system,where multiple UAVs are employed to communicate with a group of ground terminals(GTs)in the presence of potential jammers.We...This paper studies a multi-unmanned aerial vehicle(UAV)enabled wireless communication system,where multiple UAVs are employed to communicate with a group of ground terminals(GTs)in the presence of potential jammers.We aim to maximize the throughput overall GTs by jointly optimizing the UAVs’trajectory,the GTs’scheduling and power allocation.Unlike most prior studies,we consider the UAVs’turning and climbing angle constraints,the UAVs’three-dimensional(3D)trajectory constraints,minimum UAV-to-UAV(U2U)distance constraint,and the GTs’transmit power requirements.However,the formulated problem is a mixed-integer non-convex problem and is intractable to work it out with conventional optimization methods.To tackle this difficulty,we propose an efficient robust iterative algorithm to decompose the original problem be three sub-problems and acquire the suboptimal solution via utilizing the block coordinate descent(BCD)method,successive convex approximation(SCA)technique,and S-procedure.Extensive simulation results show that our proposed robust iterative algorithm offers a substantial gain in the system performance compared with the benchmark algorithms.展开更多
文摘This paper studies a multi-unmanned aerial vehicle(UAV)enabled wireless communication system,where multiple UAVs are employed to communicate with a group of ground terminals(GTs)in the presence of potential jammers.We aim to maximize the throughput overall GTs by jointly optimizing the UAVs’trajectory,the GTs’scheduling and power allocation.Unlike most prior studies,we consider the UAVs’turning and climbing angle constraints,the UAVs’three-dimensional(3D)trajectory constraints,minimum UAV-to-UAV(U2U)distance constraint,and the GTs’transmit power requirements.However,the formulated problem is a mixed-integer non-convex problem and is intractable to work it out with conventional optimization methods.To tackle this difficulty,we propose an efficient robust iterative algorithm to decompose the original problem be three sub-problems and acquire the suboptimal solution via utilizing the block coordinate descent(BCD)method,successive convex approximation(SCA)technique,and S-procedure.Extensive simulation results show that our proposed robust iterative algorithm offers a substantial gain in the system performance compared with the benchmark algorithms.
