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

被引:0
作者
HENG Wei
LIANG Tian
MENG Chao
LI Shihuan
LU Xiaowen
机构
[1] NationalMobileCommunicationsResearchLaboratory,SoutheastUniversity
关键词
Coordinated multi-point(Co MP); Static clustering; Dynamic clustering; Friends algorithm;
D O I
暂无
中图分类号
TN929.5 [移动通信];
学科分类号
080402 ; 080904 ; 0810 ; 081001 ;
摘要
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.
引用
收藏
页码:414 / 418
页数:5
相关论文
共 1 条
[1]  
3-Cell Network MIMO Architectures with Sectorization and Fractional Frequency Reuse .2 Li-Chun Wang,Chu-Jung Yeh. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS . 2011