Placement Optimization of UAV-Mounted Mobile Base Stations
Top Cited Papers
- 29 November 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 21 (3), 604-607
- https://doi.org/10.1109/lcomm.2016.2633248
Abstract
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.Keywords
This publication has 9 references indexed in Scilit:
- Wireless communications with unmanned aerial vehicles: opportunities and challengesIEEE Communications Magazine, 2016
- Efficient 3-D placement of an aerial base station in next generation cellular networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2016
- Deployment of UAV-mounted access points according to spatial user locations in two-tier cellular networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2016
- A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problemsComputational Optimization and Applications, 2012
- Construction and Maintenance of Wireless Mobile Backbone NetworksIEEE/ACM Transactions on Networking, 2009
- Efficient generation of simple polygons for characterizing the shape of a set of points in the planePattern Recognition, 2008
- On the Complexity of Some Common Geometric Location ProblemsSIAM Journal on Computing, 1984
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- Geometrical Solutions for Some Minimax Location ProblemsTransportation Science, 1972