arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2205.03709cs.NI
收藏

回程受限机器人空中6 G小基站最大最小速率部署优化

Max-min Rate Deployment Optimization for Backhaul-limited Robotic Aerial 6G Small Cells

Yuan Liao, Vasilis Friderikos

摘要:

为了克服标称机载基站(ABS)有限的机载电池问题,我们正在探索使用机器人机载基站(RABS)与能量中性抓终端执行器,能够自主栖息在高大的城市地貌。具体来说,本文研究了一个异构网络(HetNet)的辅助下,移动RABS作为一个小小区,连接到一个宏基站(MBS)通过有限容量的无线回程链路,这可以被视为另一个主要的挑战。为了充分利用RABS的移动性带来的潜在增益,通过联合优化RABS部署、用户关联和子载波分配,使所有用户之间的最小速率最大化。这个问题最初被公式化为一个二元多项式优化(BPO)问题。在将其转化为非凸二次约束二次规划(QCQP)问题后,提出了一种基于半定松弛(SDR)的探试法,在多项式时间内获得高质量的解.仿真结果表明,部署RABS作为小小区可以使最小数据率最多提高95.43%,平均提高33.97%,并且所提出的SDR启发式算法明显优于线性松弛(LR)基线方法。

英文摘要:

To overcome the limited on-board battery issue of nominal airborne base stations (ABSs), we are exploring the use of robotic airborne base station (RABS) with energy neutral grasping end-effectors that are able to autonomously perch at tall urban landforms. Specifically, this paper studies a heterogeneous network (HetNet) assisted by a movable RABS as a small cell which connects to a macro base station (MBS) through a limited-capacity wireless backhaul link, which can be deemed as another major challenge. To exploit the potential gains that the mobility of RABS can bring in the system, the minimum rate among all users is maximized by jointly optimizing the RABS deployment, user association and subcarrier allocation. This problem is initially formulated as a binary polynomial optimization (BPO) problem. After reformulating it as a nonconvex quadratically constrained quadratic programming (QCQP), we propose a semidefinite relaxation (SDR) based heuristic method to capture a high-quality solution in polynomial time. Numerical results reveal that deploying a RABS as the small cell can improve the minimum data rate by 95.43% at most and 33.97% on average, and the developed SDR heuristic algorithm significantly outperforms the linear relaxation (LR) baseline method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑