A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC

  • Authors:
  • C. Cicconetti;L. Lenzini;A. Lodi;S. Martello;E. Mingozzi;M. Monaci

  • Affiliations:
  • Intecs S.p.a., Via Egidio Giannessi, 5, 56121 Pisa, Italy;Dipartimento di Ingegneria dell'Informazione, University of Pisa, Via Diotisalvi, 2, 56010 Pisa, Italy;Dipartimento di Elettronica, Informatica e Sistemistica, University of Bologna, Viale Risorgimento, 2, 40136 Bologna, Italy;Dipartimento di Elettronica, Informatica e Sistemistica, University of Bologna, Viale Risorgimento, 2, 40136 Bologna, Italy;Dipartimento di Ingegneria dell'Informazione, University of Pisa, Via Diotisalvi, 2, 56010 Pisa, Italy;Dipartimento di Ingegneria dell'Informazione, Universití degli Studi di Padova, Via Gradenigo, 6/A, 35131 Padova, Italy

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

Mobile broadband wireless access systems like IEEE 802.16/WiMAX use Orthogonal Frequency Division Multiple Access (OFDMA) in order to exploit frequency and multi-user diversity for improving the spectral efficiency. We assume in this work a two-stage approach for resource allocation, whereby scheduling of packets in a given time frame, and their allocation across different subcarriers and time slots, are carried out separately one after the other. We specifically focus on the allocation problem in the second stage. Our first contribution is a problem formulation which is based on a detailed system model close to a practical IEEE 802.16/WiMAX system using BandAMC. The problem is proved to be NP-complete. Secondly, we propose a heuristic allocation algorithm, called Maximum Regret Band Allocation, and show through an extensive numerical analysis that it is very effective in realistic scenarios, as well as so computationally efficient to be executed in times in the order of one millisecond.