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.
@cite_4: Unmanned Aerial Vehicle (UAV) networks have emerged as a promising technique to rapidly provide wireless coverage to a geographical area out of the reach or capacity of existing core networks, where a flying UAV can be fast deployed to serve as a base station. Existing work on UAV overlook the emergency deployment problem and only the recent research on sensor networks study the deployment problems the assumed in one-dimensional (1D) ground. However, UAVs should be deployed to the air (beyond one-dimension) by considering their different flying speeds during deployment and deployment altitudes, this paper studies this novel emergency UAV deployment to minimize the UAV deployment delay till covering the whole target area. When a number @math of diverse UAVs are dispatched from the same location (e.g., the closest UAV station) to the target area, we present an optimal deployment algorithm by balancing UAVs' diverse flying speeds and coverage radii, and this algorithm has low computation complexity @math . When UAVs are generally dispatched from different locations, we first prove that the emergency UAV deployment problem is NP-complete. By preserving UAVs' location order, we then successfully design a fully polynomial time approximation scheme (FPTAS) of computation complexity @math to arbitrarily approach the global optimum.
@cite_6: In this paper, the efficient deployment and mobility of multiple unmanned aerial vehicles (UAVs), used as aerial base stations to collect data from ground Internet of Things (IoT) devices, is investigated. In particular, to enable reliable uplink communications for IoT devices with a minimum total transmit power, a novel framework is proposed for jointly optimizing the three-dimensional (3D) placement and mobility of the UAVs, device-UAV association, and uplink power control. First, given the locations of active IoT devices at each time instant, the optimal UAVs' locations and associations are determined. Next, to dynamically serve the IoT devices in a time-varying network, the optimal mobility patterns of the UAVs are analyzed. To this end, based on the activation process of the IoT devices, the time instances at which the UAVs must update their locations are derived. Moreover, the optimal 3D trajectory of each UAV is obtained in a way that the total energy used for the mobility of the UAVs is minimized while serving the IoT devices. Simulation results show that, using the proposed approach, the total transmit power of the IoT devices is reduced by 45 compared to a case in which stationary aerial base stations are deployed. In addition, the proposed approach can yield a maximum of 28 enhanced system reliability compared to the stationary case. The results also reveal an inherent tradeoff between the number of update times, the mobility of the UAVs, and the transmit power of the IoT devices. In essence, a higher number of updates can lead to lower transmit powers for the IoT devices at the cost of an increased mobility for the UAVs.
@cite_34: 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).
@cite_5: The use of drone small cells (DSCs) which are aerial wireless base stations that can be mounted on flying devices such as unmanned aerial vehicles (UAVs), is emerging as an effective technique for providing wireless services to ground users in a variety of scenarios. The efficient deployment of such DSCs while optimizing the covered area is one of the key design challenges. In this paper, considering the low altitude platform (LAP), the downlink coverage performance of DSCs is investigated. The optimal DSC altitude which leads to a maximum ground coverage and minimum required transmit power for a single DSC is derived. Furthermore, the problem of providing a maximum coverage for a certain geographical area using two DSCs is investigated in two scenarios; interference free and full interference between DSCs. The impact of the distance between DSCs on the coverage area is studied and the optimal distance between DSCs resulting in maximum coverage is derived. Numerical results verify our analytical results on the existence of optimal DSCs altitude separation distance and provide insights on the optimal deployment of DSCs to supplement wireless network coverage.
@cite_16: Low-altitude aerial platforms (LAPs) have recently gained significant popularity as key enablers for rapid deployable relief networks where coverage is provided by onboard radio heads. These platforms are capable of delivering essential wireless communication for public safety agencies in remote areas or during the aftermath of natural disasters. In this letter, we present an analytical approach to optimizing the altitude of such platforms to provide maximum radio coverage on the ground. Our analysis shows that the optimal altitude is a function of the maximum allowed pathloss and of the statistical parameters of the urban environment, as defined by the International Telecommunication Union. Furthermore, we present a closed-form formula for predicting the probability of the geometrical line of sight between a LAP and a ground receiver.
@cite_10: Unmanned Aerial Vehicle (UAV) networks have emerged as a promising technique to rapidly provide wireless services to a group of mobile users simultaneously in the three-dimensional (3D) geographical space, where a flying UAV facility can be deployed closely based on users' 3D location reports. The paper aims to address a challenging issue that each user is selfish and prefers the UAV to be located as close to himself as possible, by misreporting his location and changing the optimal UAV location. We study the social planner's problem to determine the final deployment location of a UAV facility in a 3D space, by ensuring all selfish users' truthfulness in reporting their locations. To minimize the social service cost in this UAV placement game, we design a strategyproof mechanism with approximation ratio 2, when comparing to the social optimum. On the other hand, as the UAV to be deployed may interfere with another group of incumbent users in the same space, we also study the obnoxious UAV placement game to maximally keep their social utility, where each incumbent user may misreport his location to keep the UAV away from him. We propose a strategyproof mechanism with approximation ratio 5. Besides the worst-case analysis, we further analyze the empirical performances of the proposed mechanisms and show that they converge to the social optimum as the number of users becomes large. Finally, we extend to the dual-preference UAV placement game by considering the coexistence of the two groups of users, where users can misreport both their locations and preference types. We successfully propose a strategyproof mechanism with approximation ratio 8.
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.