Mobile base stations on board unmanned aerial vehicles (UAVs) promise to deliver connectivity to those areas where the terrestrial infrastructure is overloaded, damaged, or absent. A fundamental problem in this context involves determining a minimal set of locations in 3D space where such aerial base stations (ABSs) must be deployed to provide coverage to a set of users. While nearly all existing approaches rely on average characterizations of the propagation medium, this work develops a scheme where the actual channel information is exploited by means of a radio tomographic map. A convex optimization approach is presented to minimize the number of required ABSs while ensuring that the UAVs do not enter nofly regions. A simulation study reveals that the proposed algorithm markedly outperforms its competitors.

No abstract

The technology of base stations on board unmanned aerial vehicles, also known as aerial base stations (ABSs), promises to deliver cellular connectivity in areas where the terrestrial infrastructure is overloaded, damaged, or inexistent. A central problem in this context is to determine the locations where these ABSs must be deployed to serve a set of users on the ground given the positions of the latter. However, existing schemes assume that the channel gain depends only on the length and (possibly) the elevation of the link. To alleviate this limitation, this paper proposes a scheme that accommodates arbitrary channel gains by means of a propagation radio map of the air-to-ground channel. The algorithm finds the locations of an approximately minimal number of ABSs to serve all ground terminals with a target rate while meeting the given constraints on the capacity of the backhaul links and respecting no-fly regions. A convex-relaxation formulation ensures convergence and the alternating-direction method of multipliers is utilized to derive an implementation whose complexity is linear in the number of ground terminals. Numerical results with tomographic as well as ray-tracing channel models corroborate the strengths of the proposed scheme.

The deployment of Aerial Base Stations (ABSs) mounted on board Unmanned Aerial Vehicles (UAVs) is emerging as a promising technology to provide connectivity in areas where terrestrial infrastructure is insufficient or absent. This may occur for example in remote areas, large events, emergency situations, or areas affected by a natural disaster such as a wildfire or a tsunami. To successfully materialize this goal, it is required that ABSs are placed at locations in 3D space that ensure a high Quality of Service (QoS) to the ground terminals. This paper provides a tutorial introduction to this ABS placement problem where the fundamental challenges and trade-offs are first investigated by means of a toy application example. Next, the different approaches in the literature to address the aforementioned challenges in both 2D or 3D space will be introduced and a discussion on adaptive placement will be provided. The paper is concluded by discussing future research directions.

Mobile base stations on board unmanned aerial vehicles (UAVs) promise to deliver connectivity to those areas where the terrestrial infrastructure is overloaded, damaged, or absent. A fundamental problem in this context involves determining a minimal set of locations in 3D space where such aerial base stations (ABSs) must be deployed to provide coverage to a set of users. While nearly all existing approaches rely on average characterizations of the propagation medium, this work develops a scheme where the actual channel information is exploited by means of a radio tomographic map. A convex optimization approach is presented to minimize the number of required ABSs while ensuring that the UAVs do not enter nofly regions. A simulation study reveals that the proposed algorithm markedly outperforms its competitors.