We propose a node-disjoint multi-path version to the location prediction-based routing protocol (LPBR-M) for mobile ad hoc networks to simultaneously reduce the number of global broadcast multi-path route discoveries and the average hop count per path from the source to the destination. During a global broadcast route discovery, the intermediate forwarding nodes include their location and mobility information in the Route-Request (MP-RREQ) messages. The destination node selects a set of nodedisjoint paths from the MP-RREQ messages received and sends a sequence of Route-Reply (MP-RREP) messages on each of the node-disjoint paths extracted. Upon failure of all the node-disjoint paths, the destination attempts to locally construct a global topology (using the location and mobility information collected during the global broadcast route discovery) and sends a sequence of MP-LPBR-RREP messages on each of the node-disjoint paths on the predicted global topology. If the source receives at least one MP-LPBR-RREP message within a certain time, it continues to send the data packets along the newly learnt node-disjoint paths. Otherwise, the source initiates another global broadcast route discovery. Simulation results indicate that LPBR-M incurs the longest time between successive route discoveries, lowest energy consumed per data packet and the lowest control message overhead.
Keywords: Multi-path Routing Protocol, Mobile Ad hoc Networks, Location Prediction, Node Disjoint, Simulation