Open AccessDynamic Clustering of Coordinated Multi‐point Transmission Based on Friends Algorithm
Author(s) -
Heng Wei,
Liang Tian,
Meng Chao,
Li Shihuan,
Lu Xiaowen
Publication year - 2015
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2015.04.032
Subject(s) - tree traversal , cluster analysis , computer science , scheme (mathematics) , transmission (telecommunications) , interference (communication) , point (geometry) , algorithm , artificial intelligence , computer network , mathematics , telecommunications , geometry , mathematical analysis , channel (broadcasting)
Coordinated multi‐point (CoMP) transmission has been regarded as a fascinating technology for 4G wireless communication systems. In this paper, the CoMP 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.