3D Placement of an Unmanned Aerial Vehicle Base Station (UAV-BS) for Energy-Efficient Maximal Coverage

Unmanned Aerial Vehicle mounted base stations (UAV-BSs) can provide wireless services in a variety of scenarios. In this letter, we propose an optimal placement algorithm for UAV-BSs that maximizes the number of covered users using the minimum transmit power. We decouple the UAV-BS deployment problem in the vertical and horizontal dimensions without any loss of optimality. Furthermore, we model the UAV-BS deployment in the horizontal dimension as a circle placement problem and a smallest enclosing circle problem. Simulations are conducted to evaluate the performance of the proposed method for different spatial distributions of the users

Coverage and Rate Analysis for Unmanned Aerial Vehicle Base Stations with LoS/NLoS Propagation

The use of unmanned aerial vehicle base stations (UAV-BSs) as airborne base stations has recently gained great attention. In this paper, we model a network of UAV-BSs as a Poisson point process (PPP) operating at a certain altitude above the ground users. We adopt an air-to-ground (A2G) channel model that incorporates line-of-sight (LoS) and non-line-of-sight (NLoS) propagation. Thus, UAV-BSs can be decomposed into two independent inhomogeneous PPPs. Under the assumption that NLoS and LoS channels experience Rayleigh and Nakagami-m fading, respectively, we derive approximations for the coverage probability and average achievable rate, and show that these approximations match the simulations with negligible errors. Numerical simulations have shown that the coverage probability and average achievable rate decrease as the height of the UAV-BSs increases

Deployment Strategies of Multiple Aerial BSs for User Coverage and Power Efficiency Maximization

Unmanned aerial vehicle (UAV) based aerial base stations (BSs) can provide rapid communication services to ground users and are thus promising for future communication systems. In this paper, we consider a scenario where no functional terrestrial BSs are available and the aim is deploying multiple aerial BSs to cover a maximum number of users within a certain target area. To this end, we first propose a naive successive deployment method, which converts the non-convex constraints in the involved optimization into a combination of linear constraints through geometrical relaxation. Then we investigate a deployment method based on K-means clustering. The method divides the target area into K convex subareas, where within each subarea, a mixed integer non-linear problem (MINLP) is solved. An iterative power efficient technique is further proposed to improve coverage probability with reduced power. Finally, we propose a robust technique for compensating the loss of coverage probability in the existence of inaccurate user location information (ULI). Our simulation results show that, the proposed techniques achieve an up to 30% higher coverage probability when users are not distributed uniformly. In addition, the proposed simultaneous deployment techniques, especially the one using iterative algorithm improve power-efficiency by up to 15% compared to the benchmark circle packing theory

Energy-Efficient 3D Deployment of Aerial Access Points in a UAV Communication System

In this letter, we propose an energy-efficient 3-dimensional placement of multiple aerial access points (AAPs), in the desired area, acting as flying base stations for uplink communication from a set of ground user equipment (UE). The globally optimal energy-efficient vertical position of AAPs is derived analytically by considering the inter-cell interference and AAP energy consumption. The horizontal position of AAPs which maximize the packing density of the AAP coverage area are determined using a novel regular polygon-based AAP placement algorithm. We also determine the maximum number of non-interfering AAPs that can be placed in the desired area. The effect of the AAP energy consumption on the optimal placement and the analytic findings are verified via numerical simulations.Comment: This version of the work has been accepted for publication in the IEEE COMMUNICATIONS LETTERS. 6 pages; 5 figure