GCRP: Geographic virtual circuit routing protocol for ad hoc networks

Geographic routing exploits localized information con-cerning explicit node locations to make forwarding deci-sions. This approach adapts well to the dynamic nature of ad hoc networks. However, it is subject to increased overhead during the local minimum recovery process. In this paper we specify GCRP, a routing protocol based on the novel geocircuit paradigm, that exploits already dis-covered paths to avoid repeated recoveries from the same local minimums. The proposed protocol is established to exhibit loop-freedom, while robustly eliminating mobility-induced loops. Performance analysis demonstrates signifi-cant advantage of GCRP relative to conventional geogram routing, over a wide range of network environment condi-tions. Gains increase as limiting network parameters are increased, namely node mobility, traffic load, network size and density. Effective repair of broken geocircuits preserves scalability in highly mobile environments. 1