By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Pan, M. ; Dept. of Electr. Eng., Nat. Taiwan Univ., Taiwan ; Sheng-Yan Chuang ; Sheng-De Wang

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.

Published in:

Dependable Computing, 2005. Proceedings. 11th Pacific Rim International Symposium on

Date of Conference:

12-14 Dec. 2005