Cooperation resource efficient user-centric clustering for QoS provisioning in uplink CoMP

In this paper, user-centric clustering for uplink coordinated multi-point (CoMP) processing in a multi-cell environment is investigated such that the inter-cell interference (ICI) within cluster can be effectively eliminated. Although full cooperation among all cells in the network can achieve the h...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SPAWC : signal processing advances in wireless communications S. 1 - 5
Hauptverfasser: Zhe Zhang, Ning Wang, Jiankang Zhang, Xiaomin Mu, Wong, Kon Max
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.07.2017
Schlagworte:
ISSN:1948-3252
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, user-centric clustering for uplink coordinated multi-point (CoMP) processing in a multi-cell environment is investigated such that the inter-cell interference (ICI) within cluster can be effectively eliminated. Although full cooperation among all cells in the network can achieve the highest cooperative gain in terms of ICI cancellation, such scheme consumes too much cooperation resources in the form of backhaul and processing power. In addition, from the quality-of-service (QoS) provisioning perspective, different users may have different demand for CoMP processing to guarantee its QoS. By considering the tradeoff between cooperative gain and cost, a cluster size minimization problem subject to QoS constraints is formulated to achieve dynamic user-centric clustering for uplink CoMP. As the constrained 0-1 integer programming problem depends largely on the intra-cluster interference weight, we propose a subgradient-based algorithm to solve the relaxed problem. Simulation results demonstrate that the proposed clustering algorithm achieves both the smallest cluster size and the best QoS provisioning for cell-edge users in terms of outage probability in the comparison with existing clustering algorithms.
ISSN:1948-3252
DOI:10.1109/SPAWC.2017.8227663