TY - GEN
T1 - UAV-Aided Wireless Communication Design with Propulsion Energy Constraint
AU - Eom, Subin
AU - Lee, Hoon
AU - Park, Junhee
AU - Lee, Inkyu
N1 - Funding Information:
This work was supported by the National Research Foundation of Korea (NRF) funded by the Korea Government (MSIP) under Grant 2017R1A2B3012316.
Publisher Copyright:
© 2018 IEEE.
PY - 2018/7/27
Y1 - 2018/7/27
N2 - This paper studies unmanned aerial vehicle (UAV) aided wireless communication systems where a UAV serves uplink communications of multiple ground nodes by flying the area of the interest. We aim to maximize the minimum average rate of the UAV by jointly optimizing the UAV trajectory and the ground nodes' uplink transmit power. However, this problem is shown to be non-convex in general, and thus existing convex optimization techniques and algorithms cannot be directly applied. By employing the successive convex approximation (SCA) techniques, we present an efficient algorithm which is guaranteed to converge to at least a local optimal point for the non-convex problems. To this end, proper convex approximations are derived for the non-convex constraints. Numerical results demonstrate the proposed algorithm performs better than baseline scheme.
AB - This paper studies unmanned aerial vehicle (UAV) aided wireless communication systems where a UAV serves uplink communications of multiple ground nodes by flying the area of the interest. We aim to maximize the minimum average rate of the UAV by jointly optimizing the UAV trajectory and the ground nodes' uplink transmit power. However, this problem is shown to be non-convex in general, and thus existing convex optimization techniques and algorithms cannot be directly applied. By employing the successive convex approximation (SCA) techniques, we present an efficient algorithm which is guaranteed to converge to at least a local optimal point for the non-convex problems. To this end, proper convex approximations are derived for the non-convex constraints. Numerical results demonstrate the proposed algorithm performs better than baseline scheme.
UR - http://www.scopus.com/inward/record.url?scp=85051414970&partnerID=8YFLogxK
U2 - 10.1109/ICC.2018.8422583
DO - 10.1109/ICC.2018.8422583
M3 - Conference contribution
AN - SCOPUS:85051414970
SN - 9781538631805
T3 - IEEE International Conference on Communications
BT - 2018 IEEE International Conference on Communications, ICC 2018 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE International Conference on Communications, ICC 2018
Y2 - 20 May 2018 through 24 May 2018
ER -