TY - GEN
T1 - Clustering method for CoMP with limited backhaul data transfer using convex relaxation
AU - Zhao, Jian
AU - Quek, Tony Q.S.
AU - Lei, Zhongding
PY - 2013
Y1 - 2013
N2 - Joint transmission (JT) is an attractive coordinated multipoint (CoMP) downlink transmission technique in multi-cell networks. It offers high system throughput but needs to distribute each user data to multiple base stations (BSs), which can lead to huge backhaul signaling overhead when the number of users is large. In this paper, we address the problem of jointly optimizing the BS assignment for each user data and the BS transmit beamformer design subject to per-BS power constraints and given quality-of-service (QoS) requirements. Our aim is to minimize the backhaul user data transfer from the data center to the BSs for the JT approach. We formulate such a problem into a sparsity- maximization problem. However, this problem is NP-hard. We propose to tackle it by first applying convex relaxation to an equivalent form of the original problem and improving the obtained results by solving a series of convex ℓ1-norm minimization problems. Compared to full BS cooperation, the proposed method saves about 13%-35% backhaul user data transfer in our simulations for moderate number of users and QoS requirement.
AB - Joint transmission (JT) is an attractive coordinated multipoint (CoMP) downlink transmission technique in multi-cell networks. It offers high system throughput but needs to distribute each user data to multiple base stations (BSs), which can lead to huge backhaul signaling overhead when the number of users is large. In this paper, we address the problem of jointly optimizing the BS assignment for each user data and the BS transmit beamformer design subject to per-BS power constraints and given quality-of-service (QoS) requirements. Our aim is to minimize the backhaul user data transfer from the data center to the BSs for the JT approach. We formulate such a problem into a sparsity- maximization problem. However, this problem is NP-hard. We propose to tackle it by first applying convex relaxation to an equivalent form of the original problem and improving the obtained results by solving a series of convex ℓ1-norm minimization problems. Compared to full BS cooperation, the proposed method saves about 13%-35% backhaul user data transfer in our simulations for moderate number of users and QoS requirement.
UR - https://www.scopus.com/pages/publications/84891364641
UR - https://www.scopus.com/pages/publications/84891364641#tab=citedBy
U2 - 10.1109/ICC.2013.6655447
DO - 10.1109/ICC.2013.6655447
M3 - Conference contribution
AN - SCOPUS:84891364641
SN - 9781467331227
T3 - IEEE International Conference on Communications
SP - 5398
EP - 5403
BT - 2013 IEEE International Conference on Communications, ICC 2013
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2013 IEEE International Conference on Communications, ICC 2013
Y2 - 9 June 2013 through 13 June 2013
ER -