Name
Abstract | ||
|---|---|---|
In a practical network MIMO system, a limited number of transceivers form a super virtual cell, called cluster, to cooperatively transmit data to extremely improve the system performance in terms of sum capacity, user fairness, and coverage area. Clustering algorithm is thus identified as a key enabler to reap such enormous coordinated transmission gain. In this paper, a heuristic algorithm is proposed to dynamically bind together some base stations, which can adjust itself to the ever-changing interference condition. Through utilizing the predefined connection graph, the complexity of proposed scheme is reduced while retaining a similar performance to exhaustive searching algorithm. Compared with other previous clustering methods, the proposed one demonstrates its robustness against the unrealistic feedback channel and mostly matches the performance gain produced by exhaustive searching clustering strategy. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.4304/jcp.8.11.2750-2755 | JOURNAL OF COMPUTERS |
Keywords | Field | DocType |
network MIMO, interference mitigation, adaptive clustering algorithm, distributive beamforming | Base station,Search algorithm,Heuristic (computer science),Computer science,MIMO,Communication channel,Robustness (computer science),Interference (wave propagation),Cluster analysis,Distributed computing | Journal |
Volume | Issue | ISSN |
8 | 11 | 1796-203X |
Citations | PageRank | References |
1 | 0.39 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wentao Cui | 1 | 1 | 0.73 |
| Kai Niu | 2 | 561 | 86.80 |
| Qian Wan | 3 | 23 | 7.01 |
| weiling wu | 4 | 42 | 9.81 |