基于分区加权Voronoi图的手机基站定位  

Location of Mobile Base Station Based on Partition Weighted Voronoi Graph

作　　者：沙俊淞 尧诗恬 武文 SHA Jun-song;YAO Shi-ting;WU Wen(People’s Public Security University of China, School of Information Technology and Network Security, Beijing 100038 China;Jiangxi Normal University, College of city construction, Nanchang 330022, China)

机构地区：[1]中国人民公安大学信息技术与网络安全学院,北京100038 [2]江西师范大学城市建设学院,江西南昌330022

出　　处：《电脑与信息技术》2017年第5期43-47,共5页Computer and Information Technology

基　　金：国家高技术研究发展计划863计划(项目编号:2015AA016009)

摘　　要：为解决传统Cell-ID定位仅利用单基站进行定位且定位精确度不高的缺点。文章在传统Cell-ID定位的基础上,提出了基于分区加权Voronoi图的手机基站定位方式。同时,针对传统分区加权Voronoi图算法无法显示多扇区重叠的区域,对离散生成算法进行适当的改进,来突出多个生成元重叠的区域,即基站的重复覆盖区域。同时通过实验分析了基站数量、覆盖范围和功率对定位精确度的影响。In order to solve the problem that the traditional Cell-ID positioning is based on single base station and the positioning accuracy is not high.Based on the traditional Cell-ID location,this paper proposes a mobile phone base station based on Partitioned Weighted Voronoi graph.At the same time,for the traditional Partitioned Weighted Voronoi graph algorithm can not show multi-sector overlap area,the discrete generation algorithm to make appropriate improvements to highlight a number of generating elements overlap area,that is,the overlapping area of the base station.The influence of the number,coverage and power of the base stations on the positioning accuracy is analyzed experimentally.

关 键 词：分区加权Voronoi图 基站定位 基站重叠 Cell-ID定位 离散生成算法 

分 类 号：TN92[电子电信—通信与信息系统] O18[电子电信—信息与通信工程]