A Disjoint Multi-Path Routing Algorithm in Wireless Sensor Network

Wireless sensor network (WSN) are usually used to monitor environment by collecting data from sensors deployed in a particular area. But the link quality of WSN is unstable and the network easily has nodes failures, so the data loss is an open problem in wireless sensor network. In order to achieve routing robustness in networks, people proposed multi-path routing (MPR) in sensor networks. But MPR fails when the common links or the common nodes in multiple paths fail. To solve the common-link and common-node problem, disjoint multi-path routing (DMPR) is employed where sensors send data to the sink through link-disjoint or node-disjoint path. In this paper, the authors develop a routing mechanism where sensor nodes can send data to sink through node-disjoint paths. And the algorithm is suited for multi-sink applications where every sensor node can forward the packets to any one of the sinks. The number of routing table entries of the algorithms at each node is |K|, where |K| denotes the number of multi-path. The running time complexity of the algorithm is O(|L|), where |L| denotes the number of links in the network. The experiment results show that the algorithm can effectively improve the routing reliability in sensor networks.