协作多点传输系统中基于图论的动态分簇算法

Dynamic Clustering Algorithm Based on Graph Theory for Coordinated Multi-point Transmission System

在蜂窝移动通信系统中,小区间的干扰严重限制着小区边缘用户的性能,而协作多点传输(Coordinated Multi-Point,Co MP)技术可以显著减少小区之间的干扰并改善边缘用户的性能。为了提升小区边缘用户的数据传输速率,本文针对Co MP系统提出一种基于图论的动态分簇算法。该算法利用图论的方法建立蜂窝网络的拓扑结构图,通过对小区间干扰的分析,能够同时生成多个簇大小不固定的协作簇,解决了簇大小固定和依次分簇所造成的系统受限问题。仿真结果表明,相比于其他分簇算法,本文算法在改善分簇的性能的同时降低了计算复杂度,并提高了系统的和速率。

In cellular mobile communication systems,the performance of cell edge users are restricted seriously by inter-cells interference.However,Coordinated Multi-Point transmission(CoMP)can reduce the interference among cells significantly and improve the performance of edge users.In order to improve the data transmission rate of community edge users,a dynamic clustering algorithm based on graph theory is proposed for the CoMP system.The algorithm takes full advantages of the graph theory to build the topology of the cellular network.By analyzing the inter-cell interference,the algorithm can generate multiple clusters of unfixed clusters at the same time.It solves the system restriction problem caused by cluster size fixed and sequential clustering.Compared with the other dynamic clustering algorithm,the simulation results show that this algorithm can reduce the computational complexity and improve the sum rate of the system while improving clustering performance.