AODV-MBR: A New Routing Protocol with Modified Backup Approach

Abstract

Nodes in mobile ad hoc networks communicate with one another via packet radios on wireless multi-hop links. Because of node mobility and power limitations, the network topology changes frequently. Routing protocols therefore play an important role in mobile multi-hop network communications. A prominent trend in ad hoc network routing is the reactive on-demand (AODV) philosophy where routes are established only when required. 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. Most of the protocols in this category, however, use single route and do not utilize multiple alternate paths. In this paper, we propose a scheme to improve existing on-demand routing protocols by creating a mesh and providing multiple alternate routes with the assurance of no link failure. Our algorithm establishes the link failure prediction embedded within the existing protocol. We improve the Ad hoc On-Demand Distance Vector Backup Routing (AODV-BR) protocol and compare our proposed approach with existing ones through simulation on various performance metrics by varying Traffic Load.