Local repair mechanisms for on-demand routing in mobile ad hoc networks

With the dynamic and mobile nature of ad hoc wireless networks, links may fail due to topological changes by mobile nodes. As the degree of mobility increases, the wireless network would suffer more link errors. Ad hoc routing protocols that use broadcast to discover routes may become inefficient due to frequent failures of intermediate connections in an end-to-end communication. When an intermediate link breaks, it is beneficial to discover a new route locally without resorting to an end-to-end route discovery. Based on the concept of localizing the route request query, we propose an efficient approach to repair error links quickly. The approach can apply to the ad hoc on-demand distance vector (AODV) routing protocol. As an enhancement to AODV, the proposed approach leads to two routing protocols, called AODV-LRQ and AODV-LRT, which are aimed to efficiently repair the link errors. To evaluate the effects of the route repair, we define a factor, called bonus gain, as the ratio between the throughput increment to the routing overhead increment. Simulation results show that the proposed methods can get high bonus gain, that is, it can maintain the throughput as well as reduce the routing overheads.

[1]  Jian Tang,et al.  Reliable routing in mobile ad hoc networks based on mobility prediction , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[2]  P. Srinath,et al.  Router handoff: a preemptive route repair strategy for AODV , 2002, 2002 IEEE International Conference on Personal Wireless Communications.

[3]  Young-Joo Suh,et al.  A reliable route selection algorithm using Global Positioning Systems in mobile ad-hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[4]  Rahim Tafazolli,et al.  RDMAR: a bandwidth-efficient routing protocol for mobile ad hoc networks , 1999, WOWMOM '99.

[5]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[6]  K MarinaMahesh,et al.  Query localization techniques for on-demand routing protocols in ad hoc networks , 2002 .

[7]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[8]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[9]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[10]  Bu-Sung Lee,et al.  PATCH: a novel local recovery mechanism for mobile ad-hoc networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[11]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[12]  Rajendra V. Boppana,et al.  A comparison of TCP performance over three routing protocols for mobile ad hoc networks , 2001, MobiHoc '01.

[13]  Chai-Keong Toh,et al.  Associativity-Based Routing for Ad Hoc Mobile Networks , 1997, Wirel. Pers. Commun..

[14]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[15]  Mahesh K. Marina,et al.  Query Localization Techniques for On-Demand Routing Protocols in Ad Hoc Networks , 2002, Wirel. Networks.

[16]  Samir Ranjan Das,et al.  Query Localization Techniques for On-Demand Routing Protocols in Ad Hoc Networks , 1999, Wirel. Networks.