Scheduling Constraints and Interference Graph Properties for Graph-based Interference Coordination in Cellular OFDMA Networks

  • Authors:
  • Marc C. Necker

  • Affiliations:
  • Institute of Communication Networks and Computer Engineering, University of Stuttgart, Stuttgart, Germany 70569

  • Venue:
  • Mobile Networks and Applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The currently emerging 802.16e (WiMAX) and 3GPP Long Term Evolution (LTE) cellular systems are based on Orthogonal Frequency Division Multiple Access (OFDMA). OFDMA suffers from heavy inter-cell interference if neighboring base stations use the same frequency range. One approach to solve this issue is the application of beamforming antennas in combination with interference coordination (IFCO) mechanisms between base stations. In this paper, we trace the problem of IFCO back to the graph coloring problem and investigate the achievable resource utilization of the interference coordinated system. We develop a heuristic that allows the combination of arbitrary scheduling algorithms with the IFCO mechanism. This allows an efficient utilization of the radio system's frequency resources while still obeying scheduling constraints, such as Quality of Service requirements. Finally, we study the tradeoff between fairness and the total system throughput.