We consider a problem arising in the design of green wireless local area networks. Decisions on powering-on a set of access points (APs), via the assignment of one power level (PL) to each opened AP, and decisions on the assignment of the user terminals (UTs) to the opened APs, have to be taken simultaneously. The PL assigned to an AP affects, in a nonlinear way, the capacity of the connections between the AP and the UTs that are assigned to it. The objective is to minimize the overall power consumption of the APs, which has two components: location/capacity dimensioning costs of the APs; assignment costs that depend on the total demands assigned to the APs. We develop a branch-and-Benders-cut (BBC) method where, in a non-standard fashion, the master problem includes the variables of the Benders subproblem, but relaxes their integrality. The BBC method has been tested on a large set of instances, and compared to a Benders decomposition algorithm on a subset of instances without assignment costs, where the two approaches can be compared. The computational results show the superiority of BBC in terms of solution quality, scalability and robustness.

A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks

SCUTELLA', MARIA GRAZIA;GARROPPO, ROSARIO GIUSEPPE;NENCIONI, GIANFRANCO;TAVANTI, LUCA
2016-01-01

Abstract

We consider a problem arising in the design of green wireless local area networks. Decisions on powering-on a set of access points (APs), via the assignment of one power level (PL) to each opened AP, and decisions on the assignment of the user terminals (UTs) to the opened APs, have to be taken simultaneously. The PL assigned to an AP affects, in a nonlinear way, the capacity of the connections between the AP and the UTs that are assigned to it. The objective is to minimize the overall power consumption of the APs, which has two components: location/capacity dimensioning costs of the APs; assignment costs that depend on the total demands assigned to the APs. We develop a branch-and-Benders-cut (BBC) method where, in a non-standard fashion, the master problem includes the variables of the Benders subproblem, but relaxes their integrality. The BBC method has been tested on a large set of instances, and compared to a Benders decomposition algorithm on a subset of instances without assignment costs, where the two approaches can be compared. The computational results show the superiority of BBC in terms of solution quality, scalability and robustness.
2016
Gendron, Bernard; Scutella', MARIA GRAZIA; Garroppo, ROSARIO GIUSEPPE; Nencioni, Gianfranco; Tavanti, Luca
File in questo prodotto:
File Dimensione Formato  
1-s2.0-S0377221716302958-main.pdf

solo utenti autorizzati

Descrizione: articolo principale
Tipologia: Versione finale editoriale
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 1.74 MB
Formato Adobe PDF
1.74 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
GWLAN-EJOR.pdf

accesso aperto

Descrizione: Articolo principale
Tipologia: Documento in Post-print
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 522.62 kB
Formato Adobe PDF
522.62 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/811591
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 31
  • ???jsp.display-item.citation.isi??? 29
social impact