Threshold based multipath routing algorithm in mobile adhoc and sensor networks

Abstract

While communicating nodes in Mobile Adhoc and Sensor Networks (MASNets), need to use multipath routing algorithms to tolerate nodes and links failures, it becomes interesting to let them specify to which extent these paths should be disjoint. Such feature is of high importance as it allows nodes to cope with the sensitivity of the used applications and the variation of the nodes density depending on the network area. We develop in this paper a new secure multipath algorithm, which allows nodes in MASNet to perform an on-demand discovery and generation of a set of paths, while specifying a disjointness threshold, representing the maximal number of nodes shared between any two paths in the set of the k established paths. The algorithm, which is called Secure Multipath Routing Algorithm for Mobile Adhoc and Sensor Networks (SeMuRAMAS), 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 use of Watchdog and digital signature, are used to protect the route discovery process. The conducted simulation estimates the additional overhead, showing the efficiency of the algorithm. © 2012 Springer-Verlag.