Downlink multicell processing with limited-backhaul capacity
EURASIP Journal on Advances in Signal Processing - Multiuser MIMO Transmission with Limited Feedback, Cooperation, and Coordination
A novel distributed interference mitigation technique using power planning
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Integrated control platform with load balancing algorithm in hybrid optical wireless networks
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Multi-cell MIMO cooperative networks: a new look at interference
IEEE Journal on Selected Areas in Communications - Special issue on cooperative communications in MIMO cellular networks
Adaptive spatial intercell interference cancellation in multicell wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on cooperative communications in MIMO cellular networks
Opportunistic cognitive relaying: a win-win spectrum sharing scheme
EURASIP Journal on Wireless Communications and Networking
EURASIP Journal on Wireless Communications and Networking - Special issue on interference management in wireless communication systems: theory and applications
Convergence of Price-Based Resource Allocation Algorithms in Multicellular Multicarrier Systems
Wireless Personal Communications: An International Journal
| Hi-index | 0.01 |
We address the problem of multicell co-channel scheduling in view of mitigating interference in a wireless data network with full spectrum reuse. The centralized joint multicell scheduling optimization problem, based on the complete co-channel gain information, has so far been justly considered impractical due to complexity and real-time cell-to-cell signaling overhead. However, we expose here the following remarkable result for a large network with a standard power control policy. The capacity maximizing joint multicell scheduling problem admits a simple and fully distributed solution. This result is proved analytically for an idealized network. From the constructive proof, we propose a practical algorithm that is shown to achieve near maximum capacity for realistic cases of simulated networks of even small sizes.