A simple greedy scheme for multicell capacity maximization

We study joint optimization of transmit power and scheduling in a multicell wireless network. Despite promising significant gains, this problem is known to be NP-hard and thus difficult to tackle in practice. However, we show that this problem lends itself to analysis for large wireless networks which allow simpler modeling of inter-cell interference. We introduce a low complexity greedy algorithm that is efficient for a large network. As the number of users per cell increases, the solution goes to all cells being active and employing maximum SINR scheduling, which can be implemented in a distributed manner. Using simulation parameters equivalent to those used in realistic wireless networks we show that the scheme, though simple, exhibits substantial gains over existing resource allocation schemes.