计算机科学
坐标下降
吞吐量
最优化问题
数学优化
凸优化
块(置换群论)
无线
基线(sea)
软件部署
轨迹优化
无线网络
实时计算
计算机网络
正多边形
算法
数学
电信
海洋学
几何学
最优控制
地质学
操作系统
作者
Jue Gong,Cheng Zhan,Renjie Huang,Changyuan Xu
标识
DOI:10.1109/globecom48099.2022.10000607
摘要
Due to its high mobility, flexible deployment, and low cost, unmanned aerial vehicles (UAVs) have attracted wide attention in wireless communication in recent years. However, the delay requirements (e.g., video streaming, online game, etc.) may limit the UAV's mobility. In this paper, we consider a three-dimensional (3D) UAV communication network, where a UAV is employed to fly flexibly in 3D space to serve ground users with delay requirements. To characterize the fundamental tradeoff between throughput and delay, we introduce the minimum required rate for users and aim to maximize the minimum weighted sum of throughput and required rate for each user, via joint optimization of the 3D UAV trajectory as well as communication time and rate allocation. The formulated problem is a non-convex optimization problem, which is generally intractable. By decomposing the formulated problem into two subproblems, we propose an iterative algorithm by block coordinate descent and difference of two convex (D.C.) optimization as well as successive convex approximation (SCA) techniques. Finally, extensive simulation results show that our proposed solution outperforms baseline schemes and unveils the interesting insights and tradeoff between throughput and delay over 3D UAV communication networks.
科研通智能强力驱动
Strongly Powered by AbleSci AI