DFDP: A Distributed Algorithm for Finding Disjoint Paths in Wireless Sensor Networks with Correctness Guarantee

Abstract

In wireless sensor networks, routing messages through multiple (node) disjoint paths between two sensor nodes is a promising way to increase robustness, throughput, and load balance. This paper proposes an efficient distributed algorithm named distributedly finding disjoint paths (DFDP) to find k disjoint paths connecting two given nodes s and t. A set of paths connecting s and t are disjoint if any two of them do not have any common nodes except s and t. Unlike the existing distributed algorithms, DFDP guarantees correctness; that is, it will output k disjoint paths if there exist k disjoint paths in the network or the maximum number of disjoint paths otherwise. Compared with the centralized algorithms which also guarantee correctness, DFDP is shown to have much better efficiency and load balance by theory analysis and simulation results.

Opportunistic Routing with Multi-Channel Cooperative Neighbour Discovery

“…The Routing Overhead (RO), on the other hand, was astronomically expensive. It has been proposed [20] that a dispersed strategy be used to seek discontinuous route in Wireless Sensor Networks (WSNs) to overcome the difficulty of k-disjoint path discovery in WSNs. Nodes may broadcast dumpy packets between one-hop nearby nodes, however, at this moment there are no present message formats that may be employed by the network.…”

Delay-Driven Opportunistic Routing with Multichannel Cooperative Neighbor Discovery for Industry 4.0 Wireless Networks Based on Power and Load Awareness

“…But, the Routing Overhead (RO) was high. To solve the challenge of k-disjoint path discovery in WSN, a dispersed method to discover disjoint routes was suggested [10]. Each node can communicate dumpy packets through 1-hop adjacent nodes, but no predefined message structures were available.…”

“…In Equation (10), dae refers to the value not higher than a and d th is the highest delay. Once C Z X is computed, the receiver updates its cost C Z X ⟵ C Z X either if the PIM is new or when the cost is reduced.…”

An Analysis of Link Disjoint and Node Disjoint Multipath Routing for Mobile Ad Hoc Network

“…Kejia Zhang et al in [8] analyzed effect of disjoint [12] proposed NMN-AODV protocol which is based on AODV. In this protocol only two node-disjoint routes between source and destination node are established for data transmission.…”