Efficient 3D Placement of an Aerial Base Station in Cellular Communication

Faeze Moradi Kalarde, Maryam Sabbaghian

Abstract: Aerial base stations (ABS) are reliable candidates to deploy the communications network in zones where the terrestrial infrastructure is damaged in natural disasters. In this paper, we solve the placement problem of an ABS in a network while by maximizing the minimum rate in the network, we guarantee fairness among users. We propose an algorithm for ABS placement which, unlike many other algorithms in the field, guarantees reaching the global optimal. By performing a comparative study between our proposed algorithm and particle swarm optimization (PSO) and sequential convex programming (SCP) methods, we illustrate the superiority of our solution. Our algorithm guarantees obtaining the optimal point while its complexity is lower than those of PSO and SCP.