Fair Joint Routing and Scheduling Problem in Wireless Mesh Networks

Cristiana Gomes 1 Hervé Rivano 1
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : 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.
Document type :
Reports
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/inria-00148957
Contributor : Rapport de Recherche Inria <>
Submitted on : Thursday, May 24, 2007 - 10:35:13 AM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Long-term archiving on : Tuesday, September 21, 2010 - 1:14:41 PM

Files

RR-6198.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00148957, version 2

Collections

Citation

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

Share

Metrics

Record views

412

Files downloads

173