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. (C) 2011 Elsevier B.V. All rights reserved.

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

CICCONETTI, CLAUDIO;LENZINI, LUCIANO;MINGOZZI, ENZO;
2011-01-01

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. (C) 2011 Elsevier B.V. All rights reserved.
Cicconetti, Claudio; Lenzini, Luciano; Lodi, A; Martello, S; Mingozzi, Enzo; Monaci, M.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/190361
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 4
social impact