This abstract introduces a new algorithm called the Disjoint Path Vector (DPV) algorithm for constructing a fault-tolerant topology to route data collected by sensor nodes to super nodes. In WSNs, guaranteeing k-connectivity of the communication graph is fundamental to obtain a certain degree of fault tolerance. The resulting topology is tolerant up to k-1 node failures in the worst case. We propose a distributed algorithm, namely the DPV algorithm, for solving this problem in an efficient way in terms of total transmission power of the resulting topologies, maximum transmission power assigned to sensor nodes, and total number of control message transmissions. Our simulation results show that our DPV algorithm achieves between 2.5-fold and 4-fold reduction in total transmission power required in the network, depending on the packet loss rate, and a 2-fold reduction in maximum transmission power required in a node compared to existing solutions.
You are here: / / DISJOINT PATH VECTOR FOR HETEROGENEOUS WIRELESS SENSOR NETWORKS