On-Demand Density-Aware UAV Base Station 3D Placement for Arbitrarily Distributed Users with Guaranteed Data Rates

Abstract

In this letter, we study the on-demand UAV-BS placement problem for arbitrarily distributed users. This UAV-BS placement problem is modeled as a knapsack-like problem, which is NP-complete. We propose a density-aware placement algorithm to maximize the number of covered users subject to the constraint of the minimum required data rates per user. Simulations are conducted to evaluate the performance of the proposed algorithm in a real environment with different user densities. Our numerical results indicate that for various user densities our proposed solution can service more users with guaranteed data rates compared to the existing method, while reducing the transmit power by 29%.

arXiv commentAccepted by IEEE Wireless Communications Letters

References in corpus (1)

• Placement Optimization of UAV-Mounted Mobile Base Stations

Cited by in corpus (9)

• Joint Power Allocation and Placement Scheme for UAV-assisted IoT with QoS Guarantee
• A Predictive On-Demand Placement of UAV Base Stations Using Echo State Network
• Adaptive and Fair Deployment Approach to Balance Offload Traffic in Multi-UAV Cellular Networks
• The Coverage Overlapping Problem of Serving Arbitrary Crowds in 3D Drone Cellular Networks
• Interference-Aware Deployment for Maximizing User Satisfaction in Multi-UAV Wireless Networks
• Traffic-Aware UAV Placement Using a Generalizable Deep Reinforcement Learning Methodology
• Fast and computationally efficient generative adversarial network algorithm for unmanned aerial vehicle-based network coverage optimization
• Communications and Networking Technologies for Intelligent Drone Cruisers
• Dataset Generation for Drone Optimal Placement Using Machine Learning