版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:UCL Dept Elect & Elect Engn London WC1E 7JE England
出 版 物:《IEEE TRANSACTIONS ON COMMUNICATIONS》 (IEEE通讯汇刊)
年 卷 期:2019年第67卷第4期
页 面:2981-2994页
核心收录:
学科分类:0810[工学-信息与通信工程] 0808[工学-电气工程] 08[工学]
基 金:Engineering and Physical Science Research Council, U.K. [EP/R007934/1] EPSRC [EP/R007934/1] Funding Source: UKRI
主 题:Unmanned aerial vehicles user coverage air-to-ground communication clustering algorithm
摘 要:Unmanned aerial vehicle-based aerial base stations (BSs) can provide rapid communication services to ground users and are thus promising for future communication systems. In this paper, we consider a scenario where no functional terrestrial BSs are available and the aim is deploying multiple aerial BSs to cover a maximum number of users within a certain target area. To this end, we first propose a naive successive deployment method, which converts the non-convex constraints in the involved optimization into a combination of linear constraints through geometrical relaxation. Then, we investigate a deployment method based on K-means clustering. The method divides the target area into K convex subareas, where within each subarea, a mixed integer non-linear problem is solved. An iterative power efficient technique is further proposed to improve coverage probability with reduced power. Finally, we propose a robust technique for compensating the loss of coverage probability in the existence of inaccurate user location information. Our simulation results show that the proposed techniques achieve an up to 30% higher coverage probability when users are not distributed uniformly. In addition, the proposed simultaneous deployment techniques, especially the one using iterative algorithm, improve power-efficiency by up to 15% compared with the benchmark circle packing theory.