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

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters Vol. 21; no. 3; pp. 604 - 607
Main Authors: Lyu, Jiangbin, Zeng, Yong, Zhang, Rui, Lim, Teng Joon
Format: Journal Article
Language:English
Published: IEEE 01.03.2017
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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