Heuristics for Bandwidth Reservation in Multihop Wireless Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2004

Heuristics for Bandwidth Reservation in Multihop Wireless Networks

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5075.pdf (678.75 Ko) Télécharger le fichier

Dates and versions

inria-00071508 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071508 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More