Fair Joint Routing and Scheduling Problem in Wireless Mesh Networks - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2007

Fair Joint Routing and Scheduling Problem in Wireless Mesh Networks

Résumé

There is an increasing interest in using Wireless Mesh Networks (WMNs) as broadband backbone for next-generation wireless networking. WMNs is a scalable and cost-effective solution. Industrial standards groups are revisiting the existing protocols and they work enhanced specifications for WMNs. Wireless Mesh Networks (WMNs) are cost-effective and provide an appealing answer to connectivity issues of ubiquituous computing. One of the key challenges of WMNs is to provide guaranteed quality of service that network operator could claim. In this paper, we address the Fair Round Weighting Problem (F_RWP) and present mixed integer linear programming models for computing an optimal routing and link scheduling. We have considered two kind of transmissions scenarios, burst transmission and permanent regime, and their specific settings.
Fichier principal
Vignette du fichier
RR-6198.pdf (200.17 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00148957 , version 1 (23-05-2007)
inria-00148957 , version 2 (24-05-2007)

Identifiants

  • HAL Id : inria-00148957 , version 2

Citer

Cristiana Gomes, Hervé Rivano. Fair Joint Routing and Scheduling Problem in Wireless Mesh Networks. [Research Report] RR-6198, INRIA. 2007, pp.12. ⟨inria-00148957v2⟩
335 Consultations
130 Téléchargements

Partager

Gmail Facebook X LinkedIn More