Unmanned Aerial Vehicle (UAV) networks have emerged as a promising technique to rapidly provide wireless coverage to a geographical area, where a flying UAV can be fast deployed to serve as cell site. Existing work on UAV-enabled wireless networks overlook the fast UAV deployment for wireless coverage, and such deployment problems have only been studied recently in sensor networks. Unlike sensors, UAVs should be deployed to the air and they are generally different in flying speed, operating altitude and wireless coverage radius. By considering such UAV heterogeneity to cover the whole target area, this paper studies two fast UAV deployment problems: one is to minimize the maximum deployment delay among all UAVs (min-max) for fairness consideration, and the other is to minimize the total deployment delay (min-sum) for efficiency consideration. We prove both min-max and min-sum problems are NP-complete in general. When dispatching UAVs from the same location, we present an optimal algorithm of low computational complexity @math for the min-max problem. When UAVs are dispatched from different locations, we propose to preserve their location order during deployment and successfully design a fully polynomial time approximation scheme (FPTAS) of computation complexity @math to arbitrarily approach the global optimum with relative error @math . The min-sum problem is more challenging. When UAVs are dispatched from the same initial location, we present an approximation algorithm of linear time. As for the general case, we further reformulate it as a dynamic program and propose a pseudo polynomial-time algorithm to solve it optimally.
The use of UAVs as flying base stations is attracting growing interests from researchers @cite_6 @cite_4 @cite_10 . The literature on UAV-enabled communications focus on developing the air-to-ground transmission model and explore the line of sight opportunity @cite_16 @cite_5 . Further, @cite_34 consider the co-channel interference effect and study the UAV coverage maximization problem.
@cite_4 @cite_6 @cite_34 @cite_5 @cite_16 @cite_10
1975709959 2206930994 2745317151 2963686678
This paper investigates the problem of communication relay between ground units using an unmanned aerial vehicle (UAV). The positions of the ground units are considered to be unavailable to the UAV and the objective is to drive the vehicle in real-time to the optimal placement maximizing the strength of communication signals from ground units. To this end, a novel non model-based navigation law is proposed that is solely based on signals strength and their angles of arrival. The stability of the proposed navigation law is proved in two scenarios, driving the UAV to the optimal placement and returning it back to the launch base. Simulation and experimental results are given to show the effectiveness of the proposed approach. In this paper, the deployment of an unmanned aerial vehicle (UAV) as a flying base station used to provide the fly wireless communications to a given geographical area is analyzed. In particular, the coexistence between the UAV, that is transmitting data in the downlink, and an underlaid device-to-device (D2D) communication network is considered. For this model, a tractable analytical framework for the coverage and rate analysis is derived. Two scenarios are considered: a static UAV and a mobile UAV. In the first scenario, the average coverage probability and the system sum-rate for the users in the area are derived as a function of the UAV altitude and the number of D2D users. In the second scenario, using the disk covering problem, the minimum number of stop points that the UAV needs to visit in order to completely cover the area is computed. Furthermore, considering multiple retransmissions for the UAV and D2D users, the overall outage probability of the D2D users is derived. Simulation and analytical results show that, depending on the density of D2D users, the optimal values for the UAV altitude, which lead to the maximum system sum-rate and coverage probability, exist. Moreover, our results also show that, by enabling the UAV to intelligently move over the target area, the total required transmit power of UAV while covering the entire area, can be minimized. Finally, in order to provide full coverage for the area of interest, the tradeoff between the coverage and delay, in terms of the number of stop points, is discussed. The use of drone base stations to provide wireless connectivity for ground terminals is becoming a promising part of future technologies. The design of such aerial networks is however different compared to cellular 2D networks, as antennas from the drones are looking down, and the channel model becomes height-dependent. In this paper, we study the effect of antenna patterns and height-dependent shadowing. We consider a random network topology to capture the effect of dynamic changes of the flying base stations. First we characterize the aggregate interference imposed by the co-channel neighboring drones. Then we derive the link coverage probability between a ground user and its associated drone base station. The result is used to obtain the optimum system parameters in terms of drones antenna beamwidth, density and altitude. We also derive the average LoS probability of the associated drone and show that it is a good approximation and simplification of the coverage probability in low altitudes up to 500 m according to the required signal-to-interference-plus-noise ratio (SINR). In this paper, the optimal deployment of multiple unmanned aerial vehicles (UAVs) acting as flying base stations is investigated. Considering the downlink scenario, the goal is to minimize the total required transmit power of UAVs while satisfying the users' rate requirements. To this end, the optimal locations of UAVs as well as the cell boundaries of their coverage areas are determined. To find those optimal parameters, the problem is divided into two sub-problems that are solved iteratively. In the first sub-problem, given the cell boundaries corresponding to each UAV, the optimal locations of the UAVs are derived using the facility location framework. In the second sub-problem, the locations of UAVs are assumed to be fixed, and the optimal cell boundaries are obtained using tools from optimal transport theory. The analytical results show that the total required transmit power is significantly reduced by determining the optimal coverage areas for UAVs. These results also show that, moving the UAVs based on users' distribution, and adjusting their altitudes can lead to a minimum power consumption. Finally, it is shown that the proposed deployment approach, can improve the system's power efficiency by a factor of 20 χ compared to the classical Voronoi cell association technique with fixed UAVs locations.