Fair and Energy-Efficient Coverage Optimization for UAV Placement Problem in the Cellular Network

Unmanned Aerial Vehicle (UAV) Base Station (BS) placement optimization is an essential operational task to improve the Quality of Service (QoS) in UAV-aided wireless cellular networks. The existing approaches are almost zeroth order methods, and the few first order methods mainly ignore the allocation fairness, computational efficiency, and backhaul constraints. In this paper, we formulate the UAV placement problem as a constrained optimization problem, with the objective of maximizing the fair coverage versus energy consumption while satisfying the backhaul constraints at different time nodes. To guarantee fair QoS allocation, we introduce a novel fairness index to ensure fair communication opportunity and the novel region coverage ratio to avoid excess QoS on covered spots. An accurate and efficient proximal stochastic gradient descent based alternating algorithm that iteratively executes two optimization steps is proposed to optimize the UAV locations, which enables the fast single point-based first order methods to solve the complex problems with constraints. Experiment results manifest that the proposed algorithm performs well both in synthetic data scenario and in real city scenario. Furthermore, the proposed first order algorithm is more efficient than the existing zeroth order algorithm, typically referring to the meta-heuristic method.

Automated summary

This paper investigates the optimization problem of UAV base station placement and proposes an accurate and efficient algorithm to solve the problem. The algorithm ensures fair coverage and energy efficiency while satisfying backhaul constraints. Experimental results demonstrate that the algorithm performs well in different scenarios.