Computer and Modernization ›› 2018, Vol. 0 ›› Issue (12): 16-.doi: 10.3969/j.issn.1006-2475.2018.12.004

Previous Articles     Next Articles

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

  

  1. (College of Internet of Things Engineering, Hohai University, Changzhou 213022, China)
  • Received:2018-04-28 Online:2019-01-03 Published:2019-01-04

Abstract: 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.

Key words: coordinated multi-point transmission, inter-cell interference, dynamic clustering, graph theory

CLC Number: