A novel secure and multipath routing algorithm in Wireless Sensor Networks

Abstract

Multipath routing in Wireless Sensors Networks (WSNs) is used in order to tolerate node failures and improve the reliability of data routing. To make a multipath routing algorithm adaptive to the sensitivity of the used application, communicating nodes in the network should be able to specify to which extent the established paths are disjoint. In this paper, we propose a novel routing algorithm for Wireless Sensor Networks (WSN) entitled Secure Multipath Routing Algorithm (SeMuRa). We extend the concept of k-connectivity to k-x-connectivity where x is the value of threshold representing the maximal number of nodes shared between any two paths in the set of the k established paths. The proposed algorithm: a) is based on on-demand routing; b) uses labels in the datagrams exchanged during the route discovery to carry the threshold x; and c) is secure thanks to the use of threshold signature. A simulation is conducted to prove the efficiency of the algorithm and estimate the additional overhead.