作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2019, Vol. 45 ›› Issue (3): 107-112. doi: 10.19678/j.issn.1000-3428.0051854

• 移动互联与通信技术 • 上一篇    下一篇

UDN中基于K-means聚类算法的干扰协调方案

王振朝1,2,白莉莎1,宋伯尧1   

  1. 1.河北大学 电子信息工程学院,河北 保定 071002; 2.河北省数字医疗工程重点实验室,河北 保定 071002
  • 收稿日期:2018-06-19 出版日期:2019-03-15 发布日期:2019-03-15
  • 作者简介:王振朝(1958—),男,教授、博士,主研方向为下一代移动通信网;白莉莎(通信作者)、宋伯尧,硕士研究生。
  • 基金资助:

    河北省自然科学基金(F2014201168)。

Interference Coordination Scheme Based on K-means Clustering Algorithm in UDN

WANG Zhenchao1,2,BAI Lisha1,SONG Boyao1   

  1. 1.College of Electronic and Information Engineering,Hebei University,Baoding,Hebei 071002,China; 2.Key Laboratory of Digital Medical Engineering of Hebei Province,Baoding,Hebei 071002,China
  • Received:2018-06-19 Online:2019-03-15 Published:2019-03-15

摘要:

针对超密集网络中低功率节点间的干扰问题,提出一种基于K-means聚类算法的时域干扰协调方案。根据节点的分布特点对其进行分类,计算每个类内的节点干扰并求和得到节点所受的总干扰。在此基础上,根据干扰最小化原则进行时域几乎空白子帧分配,以最大化系统局部吞吐量。仿真结果表明,相比基于广义干扰模型的干扰协调方案,该方案结果更精确,网络吞吐量更高。

关键词: 超密集网络, 聚类分析, 干扰模型, 分布式系统, 几乎空白子帧分配

Abstract:

Aiming at the problem of interference between low power nodes in Ultra-Dense Networks(UDN),a time-domain interference coordination scheme based on K-means clustering algorithm is proposed.According to the distribution characteristics,the nodes are classified,the interference of each class is calculated and the total interference is obtained.On this basis,Almost Blank Subframes(ABS) in time-domain are allocated according to the interference minimization principle to maximize the local throughput of the system.Simulation results show that the proposed scheme is more accurate and has higher network throughput than the interference coordination scheme based on generalized interference model.

Key words: Ultra-Dense Networks(UDN), cluster analysis, interference model, distributed system, Almost Blank Subframes(ABS) allocation

中图分类号: