TY - JOUR
T1 - Interference pricing mechanism for downlink multicell coordinated beamforming
AU - Escudero Garzás, José Joaquín
AU - Hong, Mingyi
AU - Garcia, Alfredo
AU - García-Armada, Ana
PY - 2014/6
Y1 - 2014/6
N2 - We consider the downlink coordinated beamforming problem in a cellular network in which the base stations (BSs) are equipped with multiple antennas and each user is equipped with a single antenna. The BSs cooperate in sharing their local interference information, and they aim to maximize the sum-rate of the users in the network. A decentralized interference pricing beamforming (IPBF) algorithm is proposed to identify the coordinated beamformer, where a BS is penalized according to the interference it creates to its peers. We show that the decentralized pricing mechanism converges to an interference equilibrium, which is a KKT point of the sum-rate maximization problem. The proofs rely on the identification of rank-1 solutions of each BSs' interference-penalized rate maximization problem. Numerical results show that the proposed iterative mechanism reduces significantly the exchanged information with respect to other state-of-the-art beamforming algorithms with very little sum-rate loss. The version of the algorithm that limits the coordination to a cluster of base stations (IPBF-L) is shown to have very small sum-rate loss with respect to the full coordinated algorithm with much less backhaul information exchange.
AB - We consider the downlink coordinated beamforming problem in a cellular network in which the base stations (BSs) are equipped with multiple antennas and each user is equipped with a single antenna. The BSs cooperate in sharing their local interference information, and they aim to maximize the sum-rate of the users in the network. A decentralized interference pricing beamforming (IPBF) algorithm is proposed to identify the coordinated beamformer, where a BS is penalized according to the interference it creates to its peers. We show that the decentralized pricing mechanism converges to an interference equilibrium, which is a KKT point of the sum-rate maximization problem. The proofs rely on the identification of rank-1 solutions of each BSs' interference-penalized rate maximization problem. Numerical results show that the proposed iterative mechanism reduces significantly the exchanged information with respect to other state-of-the-art beamforming algorithms with very little sum-rate loss. The version of the algorithm that limits the coordination to a cluster of base stations (IPBF-L) is shown to have very small sum-rate loss with respect to the full coordinated algorithm with much less backhaul information exchange.
KW - Base station coordination
KW - Beamforming
KW - Interference equilibirum
KW - Multiple input-multiple output (MIMO)
KW - Non-convex
UR - http://www.scopus.com/inward/record.url?scp=84903124206&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84903124206&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2014.2315197
DO - 10.1109/TCOMM.2014.2315197
M3 - Article
AN - SCOPUS:84903124206
SN - 0090-6778
VL - 62
SP - 1871
EP - 1883
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 6
M1 - 6782679
ER -