Skip to Main content Skip to Navigation

Heuristics for Bandwidth Reservation in Multihop Wireless Networks

Géraud Allard 1 Philippe Jacquet 1
1 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : We propose three heuristics to compute QoS routes in a multihop wireless networks considering interferences constraints. It has been proved that reservation under such conditions is an NP-complete problem. Our heuristics are based on Dijkstra's shortest path algorithm in which we integrate the notion of bandwidth capacity in order to satisfy flows requirements.We show with several simulations that these heuristics not only allows computation of routes that save bandwidth of nodes with low capacity but also that network can handle more QoS-flows.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 5:48:15 PM
Last modification on : Friday, February 4, 2022 - 3:13:40 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:20:53 PM


  • HAL Id : inria-00071508, version 1



Géraud Allard, Philippe Jacquet. Heuristics for Bandwidth Reservation in Multihop Wireless Networks. [Research Report] RR-5075, INRIA. 2004. ⟨inria-00071508⟩



Record views


Files downloads