北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2014, Vol. 37 ›› Issue (s1): 108-114.doi: 10.13190/j.jbupt.2014.s1.021

• 研究报告 • 上一篇    下一篇

圆和维诺图相交模拟基站覆盖算法

亓峰1, 刘昆1, 张超2, 王德原1   

  1. 1. 北京邮电大学 网络与交换技术国家重点实验室, 北京 100876;
    2. 中国联合网络通信有限公司 信息化和电子商务事业部, 北京 100032
  • 收稿日期:2013-11-08 出版日期:2014-06-28 发布日期:2014-06-28
  • 作者简介:亓 峰(1971- ),男,教授,硕士生导师,E-mail:qifeng@bupt.edu.cn.
  • 基金资助:

    国家自然科学基金项目(61271187);国家自然科学基金创新研究群体科学基金项目(61121061)

A Novel Base Station Coverage Simulation Based on Intersection of Circle and Voronoi

QI Feng1, LIU Kun1, ZHANG Chao2, WANG De-yuan1   

  1. 1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China;
    2. Information Technology and E-Commerce Division, China United Network Communications Limited, Beijing 100032, China
  • Received:2013-11-08 Online:2014-06-28 Published:2014-06-28
  • Supported by:
     

摘要:

提出了一种新的基站覆盖模拟算法,满足网络优化工程实践中体现基站覆盖半径和地理位置的需求.利用维诺图生成速度快和等半径圆相交算法可以体现基站覆盖半径的优点,将等半径圆相交问题转化成圆和维诺图相交的问题,避免了圆相交算法涉及的大量几何计算,达到了快速模拟基站覆盖的目的.数学证明和仿真结果表明,新算法既可以得到等半径圆相交基站模拟算法的效果,又可以大大降低生成基站模拟图的时间.

关键词: 等半径圆相交, 基站覆盖模拟, 维诺图, 圆和多边形相交算法

Abstract:

A new algorithm is used to simulate the coverage of base station,which shows both the coverage radius of base station and the location of the base station and fit in with the requirement of network optimization industry.New algorithm produce simulation results as fast as Voronoi and as same as circles intersection reflecting coverage radius of base station.The algorithm avoids dealing with the complex cases in which several circles intersect with each other by transform circles intersection as circle intersecting voronoi.Compared with the previous algorithms, new algorithm can greatly reduce the difficulty and computational complexity.

Key words: circles of equivalent radius intersection, base station coverage simulate, Voronoi, circle and polygon intersection algorithm

中图分类号: