Recent results show that sum-rate maximizing multicell power allocation promises significant gains in interferencelimited data networks. Finding practical, i.e. distributed, versions of this global optimization problem however remains a challenging task. In this work, we establish a general framework for the distributed power allocation problem for N mutually interfering links enabling us to derive a fully distributed power allocation algorithm. Although a gain for N = 2 is observed, a performance gap is still observed compared to a centralized algorithm. As a way to fill that gap, we propose minimal information (in this case 1 bit) message passing between interfering links to improve performance. Numerical results show these algorithms to exploit a substantial amount of the capacity gain offered by centralized optimization.
Capacity maximizing power allocation for interfering wireless links: a distributed approach
GLOBECOM 2007, 50th IEEE Global Communications Conference, November 26-30, 2007, Washington, USA
© 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
PERMALINK : https://www.eurecom.fr/publication/2318