We investigate the problem of joint routing and link scheduling in Time-Division Multiple Access (TDMA) Wireless Mesh Networks (WMNs) carrying real-time traffic. We propose a framework that always computes a feasible solution (i.e. a set of paths and link activations) if there exists one, by optimally solving a mixed integer-nonlinear problem. Such solution can be computed in minutes or tens thereof for e.g. grids of up to 4 × 4 nodes. We also propose heuristics based on Lagrangian decomposition to compute suboptimal solutions considerably faster and/or for larger WMNs, up to about 50 nodes. We show that the heuristic solutions are near-optimal, and we exploit them to gain insight on the schedulability in WMN, i.e. to investigate the optimal placement of one or more gateways from a delay bound perspective, and to investigate how the schedulability is affected by the transmission range.

Optimal joint routing and link scheduling for real-time traffic in TDMA Wireless Mesh Networks / Paola Cappanera;Luciano Lenzini;Alessandro Lori;Giovanni Stea;Gigliola Vaglini. - In: COMPUTER NETWORKS. - ISSN 1389-1286. - STAMPA. - 57:(2013), pp. 2301-2312. [10.1016/j.comnet.2012.11.021]

Optimal joint routing and link scheduling for real-time traffic in TDMA Wireless Mesh Networks

CAPPANERA, PAOLA;
2013

Abstract

We investigate the problem of joint routing and link scheduling in Time-Division Multiple Access (TDMA) Wireless Mesh Networks (WMNs) carrying real-time traffic. We propose a framework that always computes a feasible solution (i.e. a set of paths and link activations) if there exists one, by optimally solving a mixed integer-nonlinear problem. Such solution can be computed in minutes or tens thereof for e.g. grids of up to 4 × 4 nodes. We also propose heuristics based on Lagrangian decomposition to compute suboptimal solutions considerably faster and/or for larger WMNs, up to about 50 nodes. We show that the heuristic solutions are near-optimal, and we exploit them to gain insight on the schedulability in WMN, i.e. to investigate the optimal placement of one or more gateways from a delay bound perspective, and to investigate how the schedulability is affected by the transmission range.
2013
57
2301
2312
Paola Cappanera;Luciano Lenzini;Alessandro Lori;Giovanni Stea;Gigliola Vaglini
File in questo prodotto:
File Dimensione Formato  
ComNet-WiMesh-2013.pdf

Accesso chiuso

Descrizione: Articolo principale
Tipologia: Pdf editoriale (Version of record)
Licenza: Tutti i diritti riservati
Dimensione 1.43 MB
Formato Adobe PDF
1.43 MB Adobe PDF   Richiedi una copia

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

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/793163
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 27
  • ???jsp.display-item.citation.isi??? 24
social impact