4.7 Article

Multi-UAV Placement and User Association in Uplink MIMO Ultra-Dense Wireless Networks

期刊

IEEE TRANSACTIONS ON MOBILE COMPUTING
卷 22, 期 3, 页码 1615-1632

出版社

IEEE COMPUTER SOC
DOI: 10.1109/TMC.2021.3108960

关键词

NOMA; Three-dimensional displays; Servers; Approximation algorithms; Optimization; Mobile computing; Resource management; 3D UAV placement; mobile edge computing; MIMO; machine learning

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

This paper investigates a UAV-enabled network with smart mobile devices and multiple UAVs as aerial base stations in a MIMO architecture. It aims to maximize the number of served terrestrial users and their scheduling, and optimize the number and placement of UAV servers. The paper proposes an efficient algorithm based on machine learning to solve the optimization problem, achieving low computational complexity and fast convergence. The performance of the algorithm is evaluated through simulation results, confirming its superior performance.
This paper investigates an Unmanned Aerial Vehicle (UAV)-enabled network consisting of smart mobile devices and multiple UAVs as aerial base stations in a Multiple-Input Multiple-Output (MIMO) architecture. Mobile devices are partitioned into several clusters and offload their tasks to the UAV servers via the Non-Orthogonal Multiple Access (NOMA) protocol. The main goal of the paper is to jointly maximize the number of served terrestrial users and their scheduling. Moreover, the number of UAV servers and their 3D placement are optimized. To this end, we formulate an optimization problem subject to some Quality of Service (QoS) constraints. The resulting problem is non-convex and intractable to solve. Therefore, we break the problem into two subproblems. We propose an efficient algorithm based on machine learning to solve the first subproblem, i.e., optimizing the number of UAVs and their 3D placements, and the user association. Different from existing literature, our proposed algorithm can achieve low computational complexity and fast convergence. The second subproblem, the user scheduling, is non-convex too. We utilize the l(p)-norm concept to find a convex upper bound for the subproblem and optimize the user scheduling by applying the Successive Convex Approximation (SCA) algorithm. The aforementioned process is performed iteratively until the overall algorithm converges and a near-optimal solution is achieved for the optimization problem. Moreover, the computational complexity of the proposed scheme is analyzed. Finally, we evaluate the performance of our proposed algorithm via the simulation results. Regarding fast convergence and low computational complexity of the proposed algorithm, its superior performance is confirmed through numerical results.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据