Placement Optimization of UAV-Mounted Mobile Base Stations

IEEE Communications Letters

Volumn 21, Issue 3, 2017, Pages 604-607

  Lyu, Jiangbin ^a   Zeng, Yong ^a   Zhang, Rui ^a   Lim, Teng Joon ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

geometric disk cover problem; mobile base station placement; Unmanned aerial vehicles; user coverage

Indexed keywords

BASE STATIONS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; UNMANNED AERIAL VEHICLES (UAV);

COMMUNICATION RANGE; COVER PROBLEM; MOBILE BASE STATION; PLACEMENT OPTIMIZATION; POLYNOMIAL-TIME ALGORITHMS; TERRESTRIAL COMMUNICATION; USER COVERAGE; WIRELESS CONNECTIVITIES;

VEHICLE TO VEHICLE COMMUNICATIONS;

EID: 85015797570     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2016.2633248     Document Type: Article

References (10)

1. Y. Zeng, R. Zhang, and T. J. Lim, "Wireless communications with unmanned aerial vehicles: Opportunities and challenges," IEEE Commun. Mag., vol. 54, no. 5, pp. 36-42, May 2016.
2. B. Galkin, J. Kibilda, and L. A. DaSilva, "Deployment of UAV-mounted access points according to spatial user locations in two-tier cellular networks," in Proc. Wireless Days (WD), Mar. 2016, pp. 1-6.
3. R. I. Bor-Yaliniz, A. El-Keyi, and H. Yanikomeroglu, "Efficient 3-D placement of an aerial base station in next generation cellular networks," in Proc. IEEE Int. Conf. Commun. (ICC), May 2016, pp. 1-5.
4. A. Srinivas, G. Zussman, and E. Modiano, "Construction and maintenance of wireless mobile backbone networks," IEEE/ACM Trans. Netw., vol. 17, no. 1, pp. 239-252, Feb. 2009.
5. H. A. Fayed and A. F. Atiya, "A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems," Comput. Optim. Appl., vol. 54, no. 3, pp. 675-703, 2013.
6. P. K. Agarwal and C. M. Procopiuc, "Exact and approximation algorithms for clustering," in Proc. 9th Annu. ACM-SIAM Symp. Discrete Algorithms, Jan. 1998, pp. 658-667.
7. N. Megiddo and K. J. Supowit, "On the complexity of some common geometric location problems," SIAM J. Comput., vol. 13, no. 1, pp. 182-196, 1984.
8. M. Duckham, L. Kulik, M. Worboys, and A. Galton, "Efficient generation of simple polygons for characterizing the shape of a set of points in the plane," Pattern Recognit., vol. 41, no. 10, pp. 3224-3236, 2008.
9. N. Megiddo, "Linear-time algorithms for linear programming in R3 and related problems," SIAM J. Comput., vol. 12, no. 4, pp. 759-776, 1983.
10. J. Elzinga and D. W. Hearn, "Geometrical solutions for some minimax location problems," Transp. Sci., vol. 6, no. 4, pp. 379-394, 1972.