Link scheduling is used in wireless mesh networks (WMNs) to guarantee interference-free transmission on the shared wireless medium in a time division multiple access approach. Several papers in the literature address the problem of link scheduling guaranteeing a minimum throughput to the flows traversing the WMN. However, none of the existing works address the problem of computing a schedule that guarantees that prespecified end-to-end delay constraints are met. In this paper, we make a first step forward in this direction by defining a link scheduling algorithm that works in sinktree WMNs, i.e. those whose traffic is routed towards a common sink (i.e., the Internet gateway). Our iterative algorithm exploits a delay-based admission control procedure, devised through network calculus, which tests the feasibility of a schedule from the point of view of delay guarantees. Preliminary analyses reported in this paper show that the algorithm finds feasible solutions in few iterations.

Link Scheduling with End-to-end Delay Constraints in Wireless Mesh Networks

LENZINI, LUCIANO;LORI, ALESSANDRO;STEA, GIOVANNI;VAGLINI, GIGLIOLA
2009-01-01

Abstract

Link scheduling is used in wireless mesh networks (WMNs) to guarantee interference-free transmission on the shared wireless medium in a time division multiple access approach. Several papers in the literature address the problem of link scheduling guaranteeing a minimum throughput to the flows traversing the WMN. However, none of the existing works address the problem of computing a schedule that guarantees that prespecified end-to-end delay constraints are met. In this paper, we make a first step forward in this direction by defining a link scheduling algorithm that works in sinktree WMNs, i.e. those whose traffic is routed towards a common sink (i.e., the Internet gateway). Our iterative algorithm exploits a delay-based admission control procedure, devised through network calculus, which tests the feasibility of a schedule from the point of view of delay guarantees. Preliminary analyses reported in this paper show that the algorithm finds feasible solutions in few iterations.
2009
9781424444397
File in questo prodotto:
File Dimensione Formato  
16/40181280077322219863342576783982084144

solo utenti autorizzati

Tipologia: Versione finale editoriale
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 342.2 kB
Formato Unknown
342.2 kB Unknown   Visualizza/Apri   Richiedi una copia

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