A node-disjoint multi-path extension of the location prediction based routing protocol for mobile ad hoc networks

Abstract

We propose a node-disjoint multi-path extension to the location prediction-based routing protocol (LPBR-M) to reduce the number of broadcast multi-path route discoveries for mobile ad hoc networks. During a broadcast route discovery, the intermediate forwarding nodes include their location and mobility information in the Route-Request messages. Upon failure of all the node-disjoint paths learnt from the latest route discovery, the destination runs the algorithm to determine the set of node-disjoint paths on a predicted global topology, constructed from the location and mobility information collected during the latest broadcast route discovery, and sends a sequence of Route-Reply messages on each of the predicted paths. If the source receives at least one Route-Reply message within certain time, it continues to send the data packets along the newly learnt node-disjoint paths. Otherwise, the source initiates another broadcast route discovery. Simulation results of LPBR-M along with the link-disjoint path based AOMDV and node-disjoint path based AODVM routing protocols indicate that LPBR-M incurs the longest time between successive broadcast route discoveries and a hop count close to that incurred by the minimum hop count based multi-path protocols.