Fundamental Rate Limits of UAV-Enabled Multiple Access Channel With Trajectory Optimization
This paper studies an unmanned aerial vehicle (UAV)-enabled multiple access channel (MAC), in which multiple ground users transmit individual messages to a mobile UAV in the sky. We consider a linear topology scenario, where these users locate in a straight line and the UAV flies at a fixed altitude...
Saved in:
Published in | IEEE transactions on wireless communications Vol. 19; no. 1; pp. 458 - 474 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
New York
IEEE
01.01.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This paper studies an unmanned aerial vehicle (UAV)-enabled multiple access channel (MAC), in which multiple ground users transmit individual messages to a mobile UAV in the sky. We consider a linear topology scenario, where these users locate in a straight line and the UAV flies at a fixed altitude above the line connecting them. Under this setup, we jointly optimize the one-dimensional (1D) UAV trajectory and wireless resource allocation to reveal the fundamental rate limits of the UAV-enabled MAC, under the users' individual maximum power constraints and the UAV's maximum flight speed constraints. First, we consider the capacity-achieving non-orthogonal multiple access (NOMA) transmission with successive interference cancellation (SIC) at the UAV receiver. In this case, we characterize the capacity region by maximizing the average sum-rate of all users subject to a set of rate profile constraints. To optimally solve this highly non-convex problem with infinitely many UAV location variables over time, we show that any speed-constrained UAV trajectory is equivalent to the combination of a maximum-speed flying trajectory and a speed-free trajectory, and accordingly transform the original speed-constrained trajectory optimization problem into a speed-free problem that is optimally solvable via the Lagrange dual decomposition. It is rigorously proved that the optimal 1D trajectory solution follows the successive hover-and-fly (SHF) structure, i.e., the UAV successively hovers above a number of optimized locations, and flies unidirectionally among them at the maximum speed. Next, we consider two orthogonal multiple access (OMA) transmission schemes, i.e., frequency-division multiple access (FDMA) and time-division multiple access (TDMA). We maximize the achievable rate regions in the two cases by jointly optimizing the 1D trajectory design and wireless resource (frequency/time) allocation. It is shown that the optimal trajectory solutions still follow the SHF structure but with different hovering locations for each scheme. Finally, numerical results show that the proposed optimal trajectory designs achieve considerable rate gains over other benchmark schemes, and the capacity region achieved by NOMA significantly outperforms the rate regions by FDMA and TDMA. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ISSN: | 1536-1276 1558-2248 |
DOI: | 10.1109/TWC.2019.2946153 |