mlsanityData to 14 Oct 2026

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

arXiv 1904.10881 ↗First posted 24 Apr 2019cs.NI cs.GT eess.SPcited by 4

Not on the map. Why?

Abstract (arXiv)

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%.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 24 Apr 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 2; 2023: 1; 2024: 0; 2025: 0; 2026: 1.

4 papers.