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. AODV is a single path routing protocol that 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.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0201110-175949 |
| Date | 01 February 2010 |
| Creators | Huang, Sheng-yu |
| Contributors | Rong-Hong Jan, Ting-Wei Hou, Tsung-Chuan Huang, Ren-Hung Hwang, Tsang-Ling Sheu |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0201110-175949 |
| Rights | campus_withheld, Copyright information available at source archive |
Page generated in 0.0012 seconds