An efficient bandwidth guaranteed routing for ad hoc networks using ieee 802.11 with interference consideration

  • Authors:
  • Hakim Badis

  • Affiliations:
  • Université Paris-Est, Marne-la-Vallée, France

  • Venue:
  • Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In multi-hop wireless networks, flows that traverse the same geographical vicinity contend for the same wireless channel capacity. This is in sharp contrast with wireline networks, where only flows that traverse the same link contend for its capacity. Providing bandwidth guaranteed service in ad hoc networks therefore requires consideration of the underlying interference model. To address this issue, we first separate the underlying scheduling problem from QoS routing with guaranteed bandwidth, by presenting clique (complete subgraph) based constraints as the feasibility conditions for flows. We use packet level simulations in OPNET to compare the throughput achieved by distributed MAC protocol like 802.11b with the capacity predicted by our theoretical constraints. Simulations demonstrate that clique constraints are sufficient if they are satisfied on a network whose link capacities are scaled by a factor β according to the variation in interference range used by our interference model. As an example, we integrate our link capacity estimation model to the QOLSR routing protocol functioning. Simulation results show that QOLSR protocol yields better performance compared to the best-effort OLSR protocol.