TY - GEN
T1 - An adaptive QoS routing protocol with dispersity for ad-hoc networks
AU - Hwang, Youngki
AU - Varshney, P.
N1 - Publisher Copyright:
© 2003 IEEE.
PY - 2003
Y1 - 2003
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84969508811&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84969508811&partnerID=8YFLogxK
U2 - 10.1109/HICSS.2003.1174851
DO - 10.1109/HICSS.2003.1174851
M3 - Conference contribution
AN - SCOPUS:84969508811
T3 - Proceedings of the 36th Annual Hawaii International Conference on System Sciences, HICSS 2003
SP - 10
BT - Proceedings of the 36th Annual Hawaii International Conference on System Sciences, HICSS 2003
A2 - Sprague, Ralph H.
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 36th Annual Hawaii International Conference on System Sciences, HICSS 2003
Y2 - 6 January 2003 through 9 January 2003
ER -