Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol

Abstract

In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active route, the routing protocol must perform a route recovery process. Meanwhile, AODV (Ad Hoc On-demand Multipath Distance Vector) creates single-path route between pairs of source and destination nodes. This paper proposes a new approach of multipath node-disjoint routing based on the AODV protocol which creates two paths from a source node to a destination node without any common nodes. Furthermore, in this research, NS-2 simulator is used to produce simulations of both AODV and the proposed method. At the end, the results of the two simulations are compared to validate the effectiveness and performance of proposed method.