Network-wide optimization of transmit power with the goal of maximizing the total throughput, promises significant system capacity gains in interference-limited data networks. Finding distributed solutions to this global optimization problem however, remains a challenging task. In this work, we first focus on the maximization of the weighted sum-rate capacity, as this allows the incorporation of QoS criteria in the objective function. For the case of two links, we are able to analytically characterize the optimal solution to the weighted sum-rate maximization problem. However, computing the optimal solution requires centralized knowledge of network information. We thus formulate a framework for distributed power optimization valid for N mutually interfering links, based on the concept of channel state partitioning. By assuming instantaneous knowledge of local information and statistical knowledge of non-local information, we derive a distributed power allocation algorithm, which we first analyze for the case of N = 2. Although a gain is observed over equal power allocation, the distributed algorithm shows a performance gap as compared to a centralized solution, as expected. We show however, that minimal information message passing (in this case one bit) between interfering links can help reduce this gap substantially. Finally, we also propose a method to incorporate user scheduling into the distributed power allocation algorithm.
Distributed power allocation for interfering wireless links based on channel information partitioning
IEEE Transactions on Wireless Communications, Vol 8, N°6, June 2009
© 2009 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/2819