Planning UAV Activities for Efficient User Coverage in Disaster Areas

Climate changes brought about by global warming as well as man-made environmental changes are often the cause of sever natural disasters. ICT, which is itself responsible for global warming due to its high carbon footprint, can play a role in alleviating the consequences of such hazards by providing reliable, resilient means of communication during a disaster crisis. In this paper, we explore the provision of wireless coverage through UAVs (Unmanned Aerial Vehicles) to complement, or replace, the traditional communication infrastructure. The use of UAVs is indeed crucial in emergency scenarios, as they allow for the quick and easy deployment of micro and pico cellular base stations where needed. We characterize the movements of UAVs and define an optimization problem to determine the best UAV coverage that maximizes the user throughput, while maintaining fairness across the different parts of the geographical area that has been affected by the disaster. To evaluate our strategy, we simulate a flooding in San Francisco and the car traffic resulting from people seeking safety on higher ground

Wireless Communication using Unmanned Aerial Vehicles (UAVs): Optimal Transport Theory for Hover Time Optimization

In this paper, the effective use of flight-time constrained unmanned aerial vehicles (UAVs) as flying base stations that can provide wireless service to ground users is investigated. In particular, a novel framework for optimizing the performance of such UAV-based wireless systems in terms of the average number of bits (data service) transmitted to users as well as UAVs' hover duration (i.e. flight time) is proposed. In the considered model, UAVs hover over a given geographical area to serve ground users that are distributed within the area based on an arbitrary spatial distribution function. In this case, two practical scenarios are considered. In the first scenario, based on the maximum possible hover times of UAVs, the average data service delivered to the users under a fair resource allocation scheme is maximized by finding the optimal cell partitions associated to the UAVs. Using the mathematical framework of optimal transport theory, a gradient-based algorithm is proposed for optimally partitioning the geographical area based on the users' distribution, hover times, and locations of the UAVs. In the second scenario, given the load requirements of ground users, the minimum average hover time that the UAVs need for completely servicing their ground users is derived. To this end, first, an optimal bandwidth allocation scheme for serving the users is proposed. Then, given this optimal bandwidth allocation, the optimal cell partitions associated with the UAVs are derived by exploiting the optimal transport theory. Results show that our proposed cell partitioning approach leads to a significantly higher fairness among the users compared to the classical weighted Voronoi diagram. In addition, our results reveal an inherent tradeoff between the hover time of UAVs and bandwidth efficiency while serving the ground users

Wireless Communication using Unmanned Aerial Vehicles (UAVs): Optimal Transport Theory for Hover Time Optimization

In this paper, the effective use of flight-time constrained unmanned aerial vehicles (UAVs) as flying base stations that can provide wireless service to ground users is investigated. In particular, a novel framework for optimizing the performance of such UAV-based wireless systems in terms of the average number of bits (data service) transmitted to users as well as UAVs' hover duration (i.e. flight time) is proposed. In the considered model, UAVs hover over a given geographical area to serve ground users that are distributed within the area based on an arbitrary spatial distribution function. In this case, two practical scenarios are considered. In the first scenario, based on the maximum possible hover times of UAVs, the average data service delivered to the users under a fair resource allocation scheme is maximized by finding the optimal cell partitions associated to the UAVs. Using the mathematical framework of optimal transport theory, a gradient-based algorithm is proposed for optimally partitioning the geographical area based on the users' distribution, hover times, and locations of the UAVs. In the second scenario, given the load requirements of ground users, the minimum average hover time that the UAVs need for completely servicing their ground users is derived. To this end, first, an optimal bandwidth allocation scheme for serving the users is proposed. Then, given this optimal bandwidth allocation, the optimal cell partitions associated with the UAVs are derived by exploiting the optimal transport theory. Results show that our proposed cell partitioning approach leads to a significantly higher fairness among the users compared to the classical weighted Voronoi diagram. In addition, our results reveal an inherent tradeoff between the hover time of UAVs and bandwidth efficiency while serving the ground users