4.7 Article

Joint Resource, Deployment, and Caching Optimization for AR Applications in Dynamic UAV NOMA Networks

期刊

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
卷 21, 期 5, 页码 3409-3422

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TWC.2021.3121584

关键词

NOMA; Unmanned aerial vehicles; Resource management; Optimization; Delays; Wireless communication; Heuristic algorithms; Deep deterministic policy gradient; edge caching; non-orthogonal multiple access; Stackelberg game; unmanned aerial vehicle

资金

  1. National Natural Science Foundation of China [61971060]

向作者/读者索取更多资源

The study investigates cache-enabling UAV NOMA networks for minimizing content delivery delay, proposing BaB-based algorithm for per-slot optimization and DRL-based algorithm for long-term minimization, achieving lower delay than benchmark algorithms and lower complexity.
The cache-enabling unmanned aerial vehicle (UAV) non-orthogonal multiple access (NOMA) networks for mixture of augmented reality (AR) and normal multimedia applications are investigated, which is assisted by UAV base stations. The user association, power allocation of NOMA, deployment of UAVs and caching placement of UAVs are jointly optimized to minimize the content delivery delay. A branch and bound (BaB) based algorithm is proposed to obtain the per-slot optimization. To cope with the dynamic content requests and mobility of users in practical scenarios, the original optimization problem is transformed to a Stackelberg game. Specifically, the game is decomposed into a leader level user association sub-problem and a number of power allocation, UAV deployment and caching placement follower level sub-problems. The long-term minimization was further solved by a deep reinforcement learning (DRL) based algorithm. Simulation result shows that the content delivery delay of the proposed BaB based algorithm is much lower than benchmark algorithms, as the optimal solution in each time slot is achieved. Meanwhile, the proposed DRL based algorithm achieves a relatively low long-term content delivery delay in the dynamic environment with lower computation complexity than BaB based algorithm.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据