Distributed polite water-filling for optimization of MIMO B-MAC interference networks

It is often impractical to obtain global channel knowledge and conduct centralized optimization for wireless networks. We study distributed weighted sum-rate maximization (WSRM) in general MIMO interference networks, named B-MAC interference networks. It is desirable to exploit the structure of the problem to design distributed algorithms with high performance and low signaling overhead. We recently unveiled a polite water-filling (PWF) structure satisfied by all Pareto optimal inputs of important achievable regions of the B-MAC interference networks. The PWF offers an elegant method to decompose a network into multiple equivalent single user channels and thus, facilitates the design of distributed algorithms. Based on the PWF, we design efficient distributed algorithms which only need local channel knowledge and converge to a stationary point of the WSRM problem. For TDD networks, the duality inherited in PWF and the channel reciprocity are further exploited to reduce the signaling overhead. The proposed algorithms are shown by simulations to outperform the state-of-the-art.