Heuristics for Bandwidth Reservation in Multihop Wireless Networks
Résumé
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.