Connectivity-Aware and Adaptive Multipath Routing Algorithm for Mobile Adhoc and Sensor Networks

Abstract

We propose in this paper a connectivity-aware routing algorithm and a set of related theorems. This algorithm allows nodes in Mobile Adhoc and Sensor Networks (MASNets) to provide the highest connectivity life time to a specific destination since the issuance of data becomes a necessity for MASNets. In the proposed Solution, nodes in MASNets are able to specify the disjointness degree of the available paths allowing the discovery of the optimal set of backup routes and consequently enhance the survivability of the connectivity. These nodes perform an on-demand discovery and a generation of a set of routes, by specifying a disjointness threshold, representing the maximal number of nodes shared between any two paths in the set of k established paths. The proposed multipath routing algorithm, is adaptive, secure, and uses labels to carry the disjointness-threshold between nodes during the route discovery. A set of security mechanisms, based on the Watchdog and the digital signature concepts, is used to protect the route discovery process.