In this paper, a novel resource allocation (RA) strategy is designed for the downlink of orthogonal frequency division multiple access networks employing practical modulation and coding under quality of service constraints and retransmission techniques. Compared with previous works, two basic concepts are combined together, namely: 1) taking the goodput (GP) as performance metric and 2) ensuring maximum fairness among users. Thus, the resulting RA maximizes the GP of the worst users, optimizing subcarrier allocation (SA), per-subcarrier power allocation (PA), and adaptation of modulation and coding (AMC) of the active users, yielding a nonlinear nonconvex mixed optimization problem (OP). The intrinsic demanding difficulty of the OP is tackled by iteratively and optimally solving the AMC, PA, and SA subproblems, devoting special care to the difficult nonlinear combinatorial SA-OP. First, the optimal (yet computationally complex) solution is found by applying the branch and bound method to the optimal SA solution found in the relaxed domain, and accordingly, it is taken as benchmark. Then, an innovative suboptimal yet efficient solution based on the metaheuristic ant colony optimization (ACO) framework is derived. The proposed RA strategy is corroborated by comprehensive simulations, showing improved performance even at the cost of affordable numerical complexity.

Resource Allocation via Max–Min Goodput Optimization for BIC-OFDMA Systems

LOTTICI VINCENZO
Co-primo
Writing – Review & Editing
;
GIANNETTI FILIPPO
Co-primo
Writing – Review & Editing
;
2016-01-01

Abstract

In this paper, a novel resource allocation (RA) strategy is designed for the downlink of orthogonal frequency division multiple access networks employing practical modulation and coding under quality of service constraints and retransmission techniques. Compared with previous works, two basic concepts are combined together, namely: 1) taking the goodput (GP) as performance metric and 2) ensuring maximum fairness among users. Thus, the resulting RA maximizes the GP of the worst users, optimizing subcarrier allocation (SA), per-subcarrier power allocation (PA), and adaptation of modulation and coding (AMC) of the active users, yielding a nonlinear nonconvex mixed optimization problem (OP). The intrinsic demanding difficulty of the OP is tackled by iteratively and optimally solving the AMC, PA, and SA subproblems, devoting special care to the difficult nonlinear combinatorial SA-OP. First, the optimal (yet computationally complex) solution is found by applying the branch and bound method to the optimal SA solution found in the relaxed domain, and accordingly, it is taken as benchmark. Then, an innovative suboptimal yet efficient solution based on the metaheuristic ant colony optimization (ACO) framework is derived. The proposed RA strategy is corroborated by comprehensive simulations, showing improved performance even at the cost of affordable numerical complexity.
2016
Andreotti, Riccardo; Wang, Tao; Lottici, Vincenzo; Giannetti, Filippo; Vandendorpe, Luc
File in questo prodotto:
File Dimensione Formato  
J10.pdf

solo utenti autorizzati

Descrizione: Articolo di ricerca
Tipologia: Versione finale editoriale
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 1.4 MB
Formato Adobe PDF
1.4 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
J43_Journal_MMG_POSTPRINT.pdf

accesso aperto

Tipologia: Documento in Post-print
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 532.45 kB
Formato Adobe PDF
532.45 kB Adobe PDF Visualizza/Apri

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/807327
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 3
social impact