Abstract

In this paper, dynamic user-centric cell clustering, which is capable of exploiting dynamics in the channel states, is investigated for joint intra-cluster interference cancellation in a multi-cell environment. A resource efficient cluster size minimization problem is formulated to dynamically group the cells into clusters based on user channel states such that quality-of-service provisioning for cell-edge users can be improved. The integer programming problem depends largely on the intra-cluster interference weight. A subgradient algorithm is employed to solve the relaxed problem when no constrain on cooperation cost is present. To reduce extra burden on backhaul due to base station (BS) cooperation, constraints on the number of per-BS cooperative links and the maximum user-centric cluster size are introduced to the optimization problem, which is solved efficiently by a greedy algorithm. Numerical results show that the proposed dynamic user-centric clustering algorithms achieve significant improvements over existing static and fixed-size dynamic clustering schemes in terms of cell-edge performance and backhaul efficiency. The proposed greedy algorithm, in particular, can effectively alleviate the overall and per-BS cooperation cost while guaranteeing the cooperative gain. With similar resource consumption and outage performance, the proposed scheme achieves 12.6% higher rate gain compared with existing fixed size dynamic clustering strategy.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.