Dynamic Clustering of Coordinated Multi-point Transmission Based on Friends Algorithm

摘要

Coordinated multi-point（Co MP） transmission has been regarded as a fascinating technology for4 G wireless communication systems. In this paper, the Co MP dynamic clustering problem is studied, a Friends algorithm（F-A） is proposed based on the procedure of making friends in human society, and then a dynamic clustering scheme is proposed based on F-A. The mutual interference among cells of the network is considerate in this algorithm, which can be obtained by CSI feedback.Compared to Traversal search（T-S） algorithm, the proposed algorithm has lower computational complexity, and the performance is almost equal. Simulation results show the proposed scheme is effective for dynamic clustering.