北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2017, Vol. 40 ›› Issue (6): 30-36.doi: 10.13190/j.jbupt.2016-302

• 论文 • 上一篇    下一篇

基于业务量突发性的异构蜂窝网络最优基站密度

范琮珊, 张天魁, 曾志民   

  1. 北京邮电大学先进信息网络北京实验室, 北京 100876
  • 收稿日期:2016-12-28 出版日期:2017-12-28 发布日期:2017-12-28
  • 作者简介:范琮珊(1987-),女,博士生,E-mail:fcs@bupt.edu.cn;曾志民(1956-),男,教授,博士生导师.
  • 基金资助:
    国家科技重大专项项目(2016ZX03001009-003);高等学校学科创新引智计划项目(B17007)

Optimal Base Station Density in Heterogeneous Networks Based on the Bursty Traffic

FAN Cong-shan, ZHANG Tian-kui, ZENG Zhi-min   

  1. Beijing Laboratory of Advanced Information Network, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2016-12-28 Online:2017-12-28 Published:2017-12-28
  • Supported by:
     

摘要: 针对多媒体业务普及导致网络业务量突发性增强的问题,利用随机几何建模,研究了异构蜂窝网络中基于业务量突发性的最优基站密度.基于业务量突发性提出业务覆盖率定义,推导出异构蜂窝网络中业务覆盖率与基站密度之间的关系.以业务覆盖率为限制条件,构建目标为最小化基站密度的优化问题.利用二分搜索法获得最优基站密度,并推导出最优基站密度的上、下限.通过仿真结果验证了理论推导的准确性,证实了业务量突发性对最优基站密度的影响.

关键词: 最优基站密度, 业务量突发性, 业务覆盖率, 异构蜂窝网络, 随机几何

Abstract: To cope with the bursty traffic caused by popularity of multimedia services, the optimal base station density in heterogeneous networks by taking into account the burst characteristics of the traffic was analyzed using stochastic geometry approach. Based on bursty traffic, the traffic coverage probability of the heterogeneous network was defined and its relation with the base station density was specifically derived. An optimization problem with the aim of minimizing the base station density was formulated under the constraint of traffic coverage probability. Using binary search algorithm, the optimal base station density and the bounds (both upper and lower bound) for simplified analysis are obtained. Simulation confirms the accuracy of theoretical analysis and verifies the impact of the burst characteristics on the optimal base station density.

Key words: the optimal base station density, bursty traffic, traffic coverage probability, heterogeneous networks, stochastic geometry

中图分类号: