共 50 条
UAV-Assisted Cooperative & Cognitive NOMA: Deployment, Clustering, and Resource Allocation
被引:29
|作者:
Arzykulov, Sultangali
[1
]
Celik, Abdulkadir
[1
]
Nauryzbayev, Galymzhan
[2
]
Eltawil, Ahmed M.
[1
]
机构:
[1] King Abdullah Univ Sci & Technol, Comp Elect & Math Sci & Engn Div, Thuwal 239556900, Saudi Arabia
[2] Nazarbayev Univ, Sch Engn & Digital Sci, Dept Elect & Comp Engn, Nur Sultan 010000, Kazakhstan
关键词:
Unmanned aerial vehicles;
cognitive radio;
cooperative communications;
non-orthogonal multiple access;
outage probability;
hardware impairments;
clustering;
deployment;
NONORTHOGONAL MULTIPLE-ACCESS;
MAX-MIN FAIRNESS;
INTERFERENCE;
OPTIMIZATION;
NETWORKS;
POWER;
COMMUNICATION;
HARDWARE;
CAPACITY;
PLACEMENT;
D O I:
10.1109/TCCN.2021.3105133
中图分类号:
TN [电子技术、通信技术];
学科分类号:
0809 ;
摘要:
Cooperative and cognitive non-orthogonal multiple access (CCR-NOMA) has been recognized as a promising technique to overcome spectrum scarcity and massive connectivity issues envisioned in next-generation wireless networks. This paper investigates the deployment of an unmanned aerial vehicle (UAV) as a relay that fairly serves many secondary users in a hot-spot region. The UAV deployment algorithm must jointly account for user clustering, channel assignment, and resource allocation sub-problems. We propose a solution methodology that obtains user clustering and channel assignment based on the optimal resource allocations for a given UAV location. This paper is the first to jointly derive closed-form optimal power and time allocations for generic cluster sizes of CCR-NOMA networks. Derivations consider many practical limitations, such as hardware impairments, imperfect channel estimates, and interference temperature constraints. Compared to numerical benchmarks, proposed solutions reach optimal max-min fair data rate by consuming and spending much less transmission power and computational time. The proposed clustering uses the optimal data rates and channel assignment approaches based on a linear bottleneck assignment (LBA) algorithm. Numerical results show that the LBA achieves 100% accuracy in more than five orders of magnitude less time than the optimal integer linear programming benchmark.
引用
收藏
页码:263 / 281
页数:19
相关论文