Publication | Closed Access
A Dynamic Cell Clustering Algorithm for Maximization of Coordination Gain in Uplink Coordinated System
17
Citations
19
References
2015
Year
Cluster ComputingEngineeringNetwork AnalysisPower ControlSelf-organizing NetworkDistributed CoordinationSystems EngineeringCombinatorial OptimizationMaximum Coordination GainComputer EngineeringUplink Coordinated SystemCooperative Wireless CommunicationMobile ComputingComputer ScienceSmall CellWireless Cooperative NetworkNetwork ScienceEdge ComputingHeterogeneous NetworkSystems BiologyCoordination GainDynamic Clustering Algorithm
We propose a dynamic clustering algorithm for maximizing a coordination gain in the uplink coordinated system. The dynamic clustering algorithm configures clusters periodically to adopt the change of the channel environment. Since the greedy-search clustering algorithm does not guarantee cell-edge users' performance and the full-search clustering algorithm (FSCA) is highly complex, we define a coordination gain between the coordinated communication system and the single-cell communication system, as a new parameter, to maximize the benefit of the coordinated communication system. We develop a maximum coordination gain (MAX-CG) clustering algorithm to maximize the coordination gain and an interference weight (IW) clustering algorithm to reduce complexity and guarantee the data rate of cell-edge users. Simulation results show that the MAX-CG clustering algorithm improves the average user rate and the 5% edge user rate. The IW clustering algorithm improves the 5% edge user's rate, guarantees the fairness among the cells, and reduces the complexity to only half of the existing algorithm.
| Year | Citations | |
|---|---|---|
Page 1
Page 1