An Adaptive QoS Routing Protocol with Dispersity for Ad-hoc Networks

  • Authors:
  • Youngki Hwang;Pramod Varshney

  • Affiliations:
  • -;-

  • Venue:
  • HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9 - Volume 9
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present the design and simulation ofa bandwidth constrained multiple path on-demand routingprotocol for ad-hoc networks to support end-to-end Qualityof Service, which is known as the Adaptive DispersityQoS Routing (ADQR) Protocol. We propose a route discoveryalgorithm to find multiple disjoint paths with longer-livedconnections, where each path also specifies associatednetwork resource information. This provides an efficientapproach for network resource reservation combinedwith data dispersion and for route maintenance. A longer-livedpath generally involves less route maintenance, resultingin an increase of bandwidth utilization. We proposea route maintenance algorithm to proactively monitor networktopology changes, providing an interface to networkresource management protocols. We also propose a fastrerouting algorithm to significantly reduce data flow andQoS disruptions. Rerouting is proactively carried out beforepath unavailability occurs. Simulation results showthat ADQR reduces data disruptions and provides end-to-endQoS, by employing efficient route discovery and maintenancemechanisms with network resource information.