论文标题

在阻塞感知渠道模型下的多UAV基站的3-D定位和资源分配

3-D Positioning and Resource Allocation for Multi-UAV Base Stations Under Blockage-Aware Channel Model

论文作者

Yi, Pengfei, Zhu, Lipeng, Xiao, Zhenyu, Zhang, Rui, Han, Zhu, Xia, Xiang-Gen

论文摘要

在本文中,我们建议部署多个无人驾驶汽车(UAV)安装的基站,以在有障碍物的室外环境中为地面用户提供服务。特别地,采用地理信息来捕获建筑物引起的空对地面(A2G)链接的阻塞效应,并提出了一个现实的封闭A2G通道模型来表征不同位置的通道的连续变化。基于提出的渠道模型,我们通过功率分配,用户关联和子载波分配的无人机三维(3-D)定位和资源分配的关节优化问题,以最大程度地提高用户之间可实现的速率。为了解决这个非凸组组合编程问题,我们介绍了一个罚款术语,以放松它并通过基于惩罚的双环迭代优化框架开发次优的解决方案。内部循环通过使用块连续的凸近似(BSCA)技术来解决惩罚问题,其中无人机定位和资源分配在每次迭代中都交替优化。外部循环旨在获得适当的罚款乘数,以确保惩罚问题的解决方案会收敛到原始问题的解决方案。仿真结果证明了所提出的算法优于其他基准方案,就最低可实现的速率而言。

In this paper, we propose to deploy multiple unmanned aerial vehicle (UAV) mounted base stations to serve ground users in outdoor environments with obstacles. In particular, the geographic information is employed to capture the blockage effects for air-to-ground (A2G) links caused by buildings, and a realistic blockage-aware A2G channel model is proposed to characterize the continuous variation of the channels at different locations. Based on the proposed channel model, we formulate the joint optimization problem of UAV three-dimensional (3-D) positioning and resource allocation, by power allocation, user association, and subcarrier allocation, to maximize the minimum achievable rate among users. To solve this non-convex combinatorial programming problem, we introduce a penalty term to relax it and develop a suboptimal solution via a penalty-based double-loop iterative optimization framework. The inner loop solves the penalized problem by employing the block successive convex approximation (BSCA) technique, where the UAV positioning and resource allocation are alternately optimized in each iteration. The outer loop aims to obtain proper penalty multipliers to ensure the solution of the penalized problem converges to that of the original problem. Simulation results demonstrate the superiority of the proposed algorithm over other benchmark schemes in terms of the minimum achievable rate.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源