Placement Optimization of UAV-Mounted Mobile Base Stations

In terrestrial communication networks without fixed infrastructure, unmanned aerial vehicle-mounted mobile base stations (MBSs) provide an efficient solution to achieve wireless connectivity. This letter aims to minimize the number of MBSs needed to provide wireless coverage for a group of distribut...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE communications letters Ročník 21; číslo 3; s. 604 - 607
Hlavní autoři: Lyu, Jiangbin, Zeng, Yong, Zhang, Rui, Lim, Teng Joon
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.03.2017
Témata:
Base stations
Clustering algorithms
geometric disk cover problem
Heuristic algorithms
mobile base station placement
Mobile communication
Partitioning algorithms
Spirals
Unmanned aerial vehicles
user coverage
Wireless communication
ISSN:1089-7798
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In terrestrial communication networks without fixed infrastructure, unmanned aerial vehicle-mounted mobile base stations (MBSs) provide an efficient solution to achieve wireless connectivity. This letter aims to minimize the number of MBSs needed to provide wireless coverage for a group of distributed ground terminals (GTs), ensuring that each GT is within the communication range of at least one MBS. We propose a polynomial-time algorithm with successive MBS placement, where the MBSs are placed sequentially starting on the area perimeter of the uncovered GTs along a spiral path toward the center, until all GTs are covered. Numerical results show that the proposed algorithm performs favorably compared with other schemes in terms of the number of required MBSs as well as time complexity.
ISSN:1089-7798
DOI:10.1109/LCOMM.2016.2633248