This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9
Big Island, Hawaii
January 06-January 09
ISBN: 0-7695-1874-5
Youngki Hwang, Syracuse University
Pramod Varshney, Syracuse University
In this paper, we present the design and simulation of a bandwidth constrained multiple path on-demand routing protocol for ad-hoc networks to support end-to-end Quality of Service, which is known as the Adaptive Dispersity QoS Routing (ADQR) Protocol. We propose a route discovery algorithm to find multiple disjoint paths with longer-lived connections, where each path also specifies associated network resource information. This provides an efficient approach for network resource reservation combined with data dispersion and for route maintenance. A longer-lived path generally involves less route maintenance, resulting in an increase of bandwidth utilization. We propose a route maintenance algorithm to proactively monitor network topology changes, providing an interface to network resource management protocols. We also propose a fast rerouting algorithm to significantly reduce data flow and QoS disruptions. Rerouting is proactively carried out before path unavailability occurs. Simulation results show that ADQR reduces data disruptions and provides end-to-end QoS, by employing efficient route discovery and maintenance mechanisms with network resource information.
Citation:
Youngki Hwang, Pramod Varshney, "An Adaptive QoS Routing Protocol with Dispersity for Ad-hoc Networks," hicss, vol. 9, pp.302a, 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9, 2003
Usage of this product signifies your acceptance of the Terms of Use.