2011 IEEE 73rd Vehicular Technology Conference (VTC Spring) 2011
DOI: 10.1109/vetecs.2011.5956662
|View full text |Cite
|
Sign up to set email alerts
|

Inter-Cluster Interference Management Based on Cell-Clustering in Network MIMO Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 29 publications
(18 citation statements)
references
References 9 publications
0
18
0
Order By: Relevance
“…The intuitive reason for the performance gains is that since BSs within a cluster change dynamically, no regions within the cell are always prone to interference. Efficient, iterative algorithms are proposed in [18,[20][21][22][23][24][25], and significant performance gains are observed for a small cluster size (≤ 4 BSs). DC requires a hybrid architecture where the clustering algorithm runs on a central server, and then MCP is performed in each cluster in a distributed manner.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The intuitive reason for the performance gains is that since BSs within a cluster change dynamically, no regions within the cell are always prone to interference. Efficient, iterative algorithms are proposed in [18,[20][21][22][23][24][25], and significant performance gains are observed for a small cluster size (≤ 4 BSs). DC requires a hybrid architecture where the clustering algorithm runs on a central server, and then MCP is performed in each cluster in a distributed manner.…”
Section: Related Workmentioning
confidence: 99%
“…In [22] and [23], the network is modelled as a graph where the vertices represent the BSs and any two vertices are connected by an edge if the interference between the corresponding BSs is above a certain threshold. Each edge is then assigned a utility value which could be either the average increase in achievable rate or the increase in interference if the two vertices form a cluster.…”
Section: Dynamic Clusteringmentioning
confidence: 99%
“…In [122], the authors developed an efficient cell-clustering algorithm to maximize the sum rate of the users based on graph theory. In [123], a joint clustering and scheduling algorithm is proposed to maximize the weighted sum rate by greedily selecting the BS clusters from a set of predetermined candidate clusters.…”
Section: Joint Rrh Clustering and Precodingmentioning
confidence: 99%
“…This has been shown to be a good trade-off between performance and overhead. Even higher performance gains can be attained if the clusters are formed dynamically [17], [18] for example by user-centric approaches [19].…”
Section: Introductionmentioning
confidence: 99%