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

TY - CHAP

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

AU - Liao, Yuan

AU - Friderikos, Vasilis

PY - 2023/1/11

Y1 - 2023/1/11

N2 - 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.

AB - 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.

M3 - Conference paper

SP - 2963

EP - 2968

BT - 2022 - 2022 IEEE Global Communications Conference (GLOBECOM )

ER -