AODV-Based Backup Routing Scheme in Mobile Ad Hoc Networks

As effective routing is critical in mobile ad hoc networks (MANETs), the Ad hoc On-demand Distance Vector (AODV) has been extensively studied in recent years. Given that AODV requires a new route discovery procedure whenever a link breaks, such frequent route discoveries incur a high routing overhea...

Full description

Saved in:
Bibliographic Details
Published in2010 International Conference on Communications and Mobile Computing Vol. 3; pp. 254 - 258
Main Authors Tsung-Chuan Huang, Sheng-Yu Huang, Lung Tang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.04.2010
Subjects
Online AccessGet full text
ISBN9781424463275
1424463270
DOI10.1109/CMC.2010.313

Cover

More Information
Summary:As effective routing is critical in mobile ad hoc networks (MANETs), the Ad hoc On-demand Distance Vector (AODV) has been extensively studied in recent years. Given that AODV requires a new route discovery procedure whenever a link breaks, such frequent route discoveries incur a high routing overhead and increase end-to-end delay. Therefore, by modifying the AODV protocol, this work presents a novel backup routing scheme capable of repairing disrupted links locally without activating a route re-discovery procedure. Additionally, backup paths are established based on 2-hop neighbor knowledge. These backup paths are geographically close to the primary path in order to provide efficient recovery from route failure and maintain an adequate routing length. Simulation results indicate that the proposed backup routing scheme obtains a lower average end-to-end delay and less routing overhead than those of the Ad hoc On-demand Multipath Distance Vector (AOMDV) and the conventional AODV.
ISBN:9781424463275
1424463270
DOI:10.1109/CMC.2010.313