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

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Lai, Chuan-Chi, Chen, Chun-Ting, Wang, Li-Chun
Natura: Preprint
Pubblicazione: 2019
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866918302554521600
author Lai, Chuan-Chi
Chen, Chun-Ting
Wang, Li-Chun
author_facet Lai, Chuan-Chi
Chen, Chun-Ting
Wang, Li-Chun
contents 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%.
format Preprint
id arxiv_https___arxiv_org_abs_1904_10881
institution arXiv
publishDate 2019
record_format arxiv
spellingShingle On-Demand Density-Aware UAV Base Station 3D Placement for Arbitrarily Distributed Users with Guaranteed Data Rates
Lai, Chuan-Chi
Chen, Chun-Ting
Wang, Li-Chun
Networking and Internet Architecture
Computer Science and Game Theory
Signal Processing
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%.
title On-Demand Density-Aware UAV Base Station 3D Placement for Arbitrarily Distributed Users with Guaranteed Data Rates
topic Networking and Internet Architecture
Computer Science and Game Theory
Signal Processing
url https://arxiv.org/abs/1904.10881