bandwidth constrained multiple path on-demand routing protocol, ad-hoc networks, end-to-end quality of service, adaptive disperity QoS Routing Protocol, ADQR, disjointed paths
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 longerlived 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 longerlived 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-toend QoS, by employing efficient route discovery and maintenance mechanisms with network resource information.
Hwang, Youngki and Varshney, Pramod, "An Adaptive QoS Routing Protocol with Dispersity for Ad-hoc Networks" (2003). Electrical Engineering and Computer Science. Paper 101.