h-Hop distributed and localized algorithm for fault tolerant wireless

Wireless sensor networks (WSNs) have emerged as a new information gathering paradigm based on the collaborative effort of a large number of sensing nodes. Sensor nodes in such environments are unstable to provide services. Hence, fault tolerant is necessary for a WSN to guarantee the sensor nodes communicate with the end-users to provide information. In this paper, we consider the problem of communication range assignments for every sensor nodes while providing a k-fault tolerant WSN. We introduce a distributed and localized algorithm for solving the range assignment problem for which the total transmission power for all sensors is minimized while maintaining k-vertex disjoint paths between any pair of sensor nodes. We consider a general model of h-hop message forwarding of sensor nodes. And we also analyze the execution time complexity and the average throughput of the algorithm.