计算机工程2019，Vol.45Issue(3)：107-112,6.DOI:10.19678/j.issn.1000-3428.0051854
UDN中基于K-means聚类算法的干扰协调方案
Interference Coordination Scheme Based on K-means Clustering Algorithm in UDN
摘要
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分类
信息技术与安全科学引用本文复制引用
王振朝,白莉莎,宋伯尧..UDN中基于K-means聚类算法的干扰协调方案[J].计算机工程,2019,45(3):107-112,6.基金项目
河北省自然科学基金(F2014201168). （F2014201168）
