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

Optimal Transport Theory for Cell Association in UAV-Enabled Cellular Networks

In this paper, a novel framework for delay-optimal cell association in unmanned aerial vehicle (UAV)-enabled cellular networks is proposed. In particular, to minimize the average network delay under any arbitrary spatial distribution of the ground users, the optimal cell partitions of UAVs and terrestrial base stations (BSs) are determined. To this end, using the powerful mathematical tools of optimal transport theory, the existence of the solution to the optimal cell association problem is proved and the solution space is completely characterized. The analytical and simulation results show that the proposed approach yields substantial improvements of the average network delay.Comment: Accepted in IEEE Communications Letter

An Energy Efficient Data Collection Using Multiple UAVs in Wireless Sensor Network: A Survey Study

   اليوم، مع التقدم العلمي والتكنولوجي في الروبوتات، والذكاء الاصطناعي، والسيطرة والحواسيب، المركبات البرية والجوية والبحرية قد تم الاهتمام بها. كما تم تحسين الطائرات بدون طيار (UAVs) بشكل كبير وهي مفيدة جدا للعديد من التطبيقات الهامة في الأعمال التجارية والبيئة الحضرية والعسكرية. أحد أهم استخدامات الطائرات بدون طيار في شبكات الاستشعار اللاسلكية (WSNs)  التي لديها طاقة منخفضة وقد لا تكون قادرة على الاتصال في مناطق واسعة. في هذه الحالة ، يمكن أن توفر الطائرة بدون طيار وسيلة لجمع بيانات WSN من جهاز واحد ونقلها إلى المستلم المقصود تركز هذه المقالة على مجال البحث في التطبيقات العملية للطائرات بدون طيار كجامع متنقل لشبكات الاستشعار اللاسلكية. أولا التحقيقات حول الطائرات بدون طيار المقترحة تم دراستها ومقارنة نقاط ضعفها مع بعضها البعض. وكذلك التحديات التقنية لتطبيقات الطائرات بدون طيار في شبكة الاستشعار اللاسلكية تم استكشافها.Today, with scientific and technological advances in robotics, artificial intelligence, control and computers, land, air, and sea vehicles, they have been considered. Unmanned aerial vehicles (UAVs) have also significantly improved and are very useful for many important applications in the business, urban and military environment. One of the important uses of UAVs in Wireless Sensor Networks (WSNs) is that devices with low energy and may not be able to communicate in large areas. Nevertheless, a UAV can provide a tool for collecting the data of WSN from one device and transmitting it to another device. This article focuses on the field of research on practical applications of UAVs as mobile collectors for wireless sensor networks. First, the investigations of the proposed UAV were studied and compared their weaknesses with each other. Then, the technical challenges of the applications of UAVs in the wireless sensor network were explored

Strategic Availability and Cost Effective UAV-based Flying Access Networks: S-Modular Game Analysis

Telecommunication service providers deploy UAVs to provide flying network access in remote rural areas, disaster-affected areas or massive-attended events (sport venues, festivals, etc.) where full set-up to provide temporary wireless coverage would be very expensive. Of course, a UAV is battery-powered which means limited energy budget for both mobility aspect and communication aspect. An efficient solution is to allow UAVs switching their radio modules to sleep mode in order to extend battery lifetime. This results in temporary unavailability of communication feature. Within such a situation, the ultimate deal for a UAV operator is to provide a cost effective service with acceptable availability. This would allow to meet some target Quality of Service while having a good market share granting satisfactory benefits. We construct a duopoly model to capture the adversarial behavior of service providers in terms of their pricing policies and their respective availability probabilities. Optimal periodic beaconing (small messages advertising existence of a UAV) is a vital issue that needs to be addressed, given the UAVs limited battery capacity and their recharging constraints. A full analysis of the game outcome, both in terms of equilibrium pricing and equilibrium availability, is derived. We show that the availability-pricing game exhibits some nice features as it is sub-modular with respect to the availability policy, whereas it is super-modular with respect to the service fee. Furthermore, we implement a learning scheme using best-response dynamics that allows operators to learn their joint pricing-availability strategies in a fast, accurate and distributed fashion.Comment: 10 pages, 14 figure