现代电子技术2017，Vol.40Issue(23)：10-14,5.DOI:10.16652/j.issn.1004-373x.2017.23.003
基于圆形堆积理论的优化无线网络的覆盖时间算法
Wireless network coverage time optimization algorithm based on circle packing theory
摘要
Abstract
The air base station acted by unmanned aerial vehicles(UAVs)has become a most promising technology to en-hance the coverage rate of wireless network,so the efficient deployment of multiple UAVs is studied. The UAVs′downlink coverage probability function based on altitude and antenna gain is deduced. According to the circle packing theory,the locations of the UAVs are calculated to maximize the coverage area while guaranteeing the maximum coverage time. The required quantity of UAVs is deduced to guarantee the target coverage probability. The experimental results show that,according to the beam width and coverage requirements of the omnidirectional antenna,the altitude adjustment of the UAVs can eliminate the mutual interference of the UAVs and maximize the coverage time.关键词
无人机/网络覆盖率/空中基站/位置计算/覆盖时间Key words
unmanned aerial vehicle/network coverage rate/air base station/location calculation/coverage time分类
信息技术与安全科学引用本文复制引用
龚丁海,谭可久..基于圆形堆积理论的优化无线网络的覆盖时间算法[J].现代电子技术,2017,40(23):10-14,5.基金项目
国家863计划项目(2013AA040302) （2013AA040302）
国家高技术研究发展计划(863计划) （863计划）
广西教育厅一般项目(KY2016YB381) （KY2016YB381）
