Efficient Cell-Clustering Algorithm for Inter-Cluster Interference Mitigation in Network MIMO Systems

Moon, Jun Il; Cho, Dong-Ho

doi:10.1109/lcomm.2011.012511.101865

Cited by 17 publications

(12 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

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%

“…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%

See 1 more Smart Citation

Mitigating inter-cluster interference on the uplink for a three-cell clustered cooperative network

Thampi

Armour

Fan

et al. 2016

J Wireless Com Network

View full text Add to dashboard Cite

In this paper, we propose a practical and scalable solution to mitigating interference on the uplink through static clustering and adaptive fractional frequency reuse (CFFR). The focus is on a three-cell clustered network due to its low complexity. Moreover, we have previously shown that a performance comparable to that of global coordination is achievable using a cluster size of three. In this paper, for a clustered planar Wyner network, we derive analytical capacity equations for zero forcing (ZF) and linear minimum mean squared error (LMMSE)-based receivers. The theoretical results show that inter-cluster interference is the major performance bottleneck and that the smallest interference from the neighbouring clusters is sufficient to significantly lower the system performance. We then switch our study to a more realistic network setting and augment our CFFR technique by adopting an entirely distributed architecture and by implementing a location classification algorithm based on logistic regression. We then show through simulations that CFFR performs significantly better than the widely studied dynamic clustering (DC) technique. Since the inter-cluster interference intensity of CFFR is much lower than DC, the per-cell sum rate performance is 1.5× better, especially at high loads. We also show that the CFFR algorithm is a lot less complex than DC in terms of running time.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Dynamic Clusteringmentioning

confidence: 99%

Mitigating inter-cluster interference on the uplink for a three-cell clustered cooperative network

Thampi

Armour

Fan

et al. 2016

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…which is the probability of the channel being in the states where the allocated transmission rate R t is greater than the channel capacity C s 0 . In the following, we will show that for the uplink CoMP problem, the greedy policy defined in (15) is the optimal policy. The complexity of the greedy policy will also be briefly discussed.…”

Section: Greedy Policymentioning

confidence: 99%

“…It is in fact straightforward to show. In particular, consider at horizon h D 1, the optimal action to take is the maximizer of E h P uDB uD1 u S 1 , a 1 the optimal policy is the greedy policy given in (15). Then, at horizon h C 1,…”

Section: The Optimality and Complexity Of The Greedy Policymentioning

confidence: 99%

See 1 more Smart Citation

A decision theoretic approach for clustering and rate allocation in coordinated multi‐point (CoMP) networks with delayed channel state information

Cai

2014

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

Coordinated multi-point (CoMP) is a promising technique in next generation cellular networks. Compared with traditional mobile networks, one of the important design problems in CoMP is clustering, which decides how the base stations cooperate with each other. Channel state information (CSI) is needed in clustering decisions in CoMP. Most previous works assume that perfect CSI is available. However, practical systems suffer from constraints imposed by backhaul networks, which are used for CSI exchange. In this paper, we study the clustering and rate allocation problem in CoMP with delayed CSI. We present a decision theoretic approach to this problem. Specifically, we model such a system in the framework of networked Markov decision process (networked-MDP) with delays, which is equivalent to a partial observable Markov decision process (POMDP). We derive an optimal policy for such POMDP with low computation complexity. Simulation results are provided to show promising gain achieved in the proposed scheme over existing schemes especially when the delay is large and the channel coherence time is small.

show abstract

The Eighth Category: Sequential and Incremental Precoding with Nonideal Backhaul

Ding

Luo

2013

Signals and Communication Technology

View full text Add to dashboard Cite

Efficient Cell-Clustering Algorithm for Inter-Cluster Interference Mitigation in Network MIMO Systems

Cited by 17 publications

References 4 publications

Mitigating inter-cluster interference on the uplink for a three-cell clustered cooperative network

Mitigating inter-cluster interference on the uplink for a three-cell clustered cooperative network

A decision theoretic approach for clustering and rate allocation in coordinated multi‐point (CoMP) networks with delayed channel state information

The Eighth Category: Sequential and Incremental Precoding with Nonideal Backhaul

Contact Info

Product

Resources

About