TY - JOUR
T1 - UAV-enabled communication using NOMA
AU - Nasir, Ali Arshad
AU - Tuan, Hoang Duong
AU - Duong, Trung Q.
AU - Poor, H. Vincent
N1 - Funding Information:
Manuscript received May 31, 2018; revised August 31, 2018, November 21, 2018 and January 30, 2019; accepted March 11, 2019. Date of publication March 20, 2019; date of current version July 13, 2019. This work was supported by the KFUPM Research Project #SB171005, in part by Institute for Computational Science and Technology, Hochim-inh city, Vietnam, in part by the Australian Research Council’s Discovery Projects under Project DP190102501, in part by the U.K. Royal Academy of Engineering Research Fellowship under Grant RF1415\14\22, in part by U.S. National Science Foundation under Grants CCF-0939370 and CCF-1513915, and in part by the Newton Fund Institutional Link through the Fly-by Flood Monitoring Project under Grant ID 428328486, which is delivered by the British Council. The associate editor coordinating the review of this paper and approving it for publication was W. Chen. (Corresponding author: Trung Q. Duong.) A. A. Nasir is with the Department of Electrical Engineering, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia (e-mail: anasir@kfupm.edu.sa).
Publisher Copyright:
© 2019 IEEE.
PY - 2019/7
Y1 - 2019/7
N2 - Unmanned aerial vehicles (UAVs) can be deployed as flying base stations (BSs) to leverage the strength of line-of-sight connections and effectively support the coverage and throughput of wireless communication. This paper considers a multiuser communication system, in which a single-antenna UAV-BS serves a large number of ground users by employing non-orthogonal multiple access (NOMA). The max-min rate optimization problem is formulated under total power, total bandwidth, UAV altitude, and antenna beamwidth constraints. The objective of max-min rate optimization is non-convex in all optimization variables, i.e., UAV altitude, transmit antenna beamwidth, power allocation, and bandwidth allocation for multiple users. A path-following algorithm is proposed to solve the formulated problem. Next, orthogonal multiple access (OMA) and dirty paper coding (DPC)-based max-min rate optimization problems are formulated and respective path-following algorithms are developed to solve them. The numerical results show that NOMA outperforms OMA and achieves rates similar to those attained by DPC. In addition, a clear rate gain is observed by jointly optimizing all the parameters rather than optimizing a subset of parameters, which confirms the desirability of their joint optimization.
AB - Unmanned aerial vehicles (UAVs) can be deployed as flying base stations (BSs) to leverage the strength of line-of-sight connections and effectively support the coverage and throughput of wireless communication. This paper considers a multiuser communication system, in which a single-antenna UAV-BS serves a large number of ground users by employing non-orthogonal multiple access (NOMA). The max-min rate optimization problem is formulated under total power, total bandwidth, UAV altitude, and antenna beamwidth constraints. The objective of max-min rate optimization is non-convex in all optimization variables, i.e., UAV altitude, transmit antenna beamwidth, power allocation, and bandwidth allocation for multiple users. A path-following algorithm is proposed to solve the formulated problem. Next, orthogonal multiple access (OMA) and dirty paper coding (DPC)-based max-min rate optimization problems are formulated and respective path-following algorithms are developed to solve them. The numerical results show that NOMA outperforms OMA and achieves rates similar to those attained by DPC. In addition, a clear rate gain is observed by jointly optimizing all the parameters rather than optimizing a subset of parameters, which confirms the desirability of their joint optimization.
KW - Unmanned aerial vehicle (UAV)
KW - dirty paper coding (DPC)
KW - non-convex optimization
KW - non-orthogonal multiple access (NOMA)
KW - orthogonal multiple access (OMA)
KW - throughput
UR - http://www.scopus.com/inward/record.url?scp=85069769988&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85069769988&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2019.2906622
DO - 10.1109/TCOMM.2019.2906622
M3 - Article
AN - SCOPUS:85069769988
SN - 1558-0857
VL - 67
SP - 5126
EP - 5138
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 7
M1 - 8672190
ER -