Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
2018 | 10.1109/TCOMM.2019.2906622 | IEEE Transactions on Communications |
Keywords | Field | DocType |
NOMA,Bandwidth,Optimization,Resource management,Antennas,Unmanned aerial vehicles,Throughput | Dirty paper coding,Base station,Mathematical optimization,Wireless,Bandwidth allocation,Real-time computing,Bandwidth (signal processing),Throughput,Beamwidth,Optimization problem,Mathematics | Journal |
Volume | Issue | ISSN |
abs/1806.03604 | 7 | 0090-6778 |
Citations | PageRank | References |
23 | 0.66 | 17 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ali A. Nasir | 1 | 1094 | 56.86 |
Hoang D. Tuan | 2 | 1936 | 191.03 |
Trung Q. Duong | 3 | 2911 | 171.22 |
H. V. Poor | 4 | 25411 | 1951.66 |