Fast distributed multi-cell scheduling with delayed limited-capacity backhaul links

Authors:
Ralf Bendlin;Yih-Fang Huang;Michel T. Ivrlac;Josef A. Nossek
Affiliations:
Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN;Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN;Institute for Circuit Theory and Signal Processing, Munich University of Technology, Munich, Germany;Institute for Circuit Theory and Signal Processing, Munich University of Technology, Munich, Germany
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 8
Cited 0

Cochannel interference mitigation and cooperative processing in downlink multicell multiuser MIMO networks

EURASIP Journal on Wireless Communications and Networking - Special issue on multiuser MIMO networks
Cooperative Spatial Multiplexing with Hybrid Channel Knowledge

IZS '06 Proceedings of the 2006 International Zurich Seminar on Communications
Low-complexity distributed multibase transmission and scheduling

EURASIP Journal on Advances in Signal Processing
Finite-Length MMSE Tomlinson–Harashima Precoding for Frequency Selective Vector Channels

IEEE Transactions on Signal Processing
Linear transmit processing in MIMO communications systems

IEEE Transactions on Signal Processing - Part I
The capacity gain from intercell scheduling in multi-antenna systems

IEEE Transactions on Wireless Communications
Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels

IEEE Transactions on Information Theory
Transmit beamforming and power control for cellular wireless systems

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Both fast scheduling and spatial signal processing have proven to be capacity-increasing methods in wireless communication systems. However, when applied in the downlink of a cellular network, the combination of both leads to non-stationary intercell interference. If the base stations do not cooperate, either they have to encode the data very conservatively to gain robustness or the non-stationary fluctuations of the interference powers lead to frequent outages, both of which strongly impair the average achievable throughput. On the other hand, base station cooperation increases complexity and delays, contradicting the desire for fast scheduling algorithms. In this paper, we propose a scheme that makes average channel state information available to all base stations via low-rate backhaul communication, whereas high-rate inter-base-station communication is limited to B ⌈log2 K⌉-bit integers, K being the number of users in each of the B cells. Simulations show that for slow fading channels, the proposed algorithm preserves most of the per cell sum-rate of other beamforming and dirty-paper coding approaches that have unlimited-capacity backhaul links. Furthermore, when out-of-cell information is outdated the proposed algorithm even outperforms those.