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

摘要

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