Distributed fault-tolerant algorithm for Wireless Sensor Network

Abstract

Wireless Sensor Networks (WSNs) are a set of tiny autonomous and interconnected devices. These nodes are scattered in a region of interest to collect information about the surrounding environment depending on the intended application. In many applications, the network is deployed in harsh environments such as battlefield where the nodes are susceptible to damage. In addition, nodes may fail due to energy depletion and breakdown in the onboard electronics. The failure of nodes may leave some areas uncovered and degrade the fidelity of the collected data. Therefore, establish a fault-tolerant mechanism is very crucial. Given the resource-constrained setup, this mechanism should impose the least overhead and performance impact. This paper focuses on recovery process after a fault detection phase in WSNs. We present an algorithm to recover faulty node called Distributed Fault-Tolerant Algorithm (DFTA). The performance evaluation is tested through simulation to evaluate some factors such as: Packet delivery ratio, control overhead, memory overhead and fault recovery delay. We compared our results to a referenced algorithm: Fault Detection in Wireless Sensor Networks (FDWSN), and found that our DFTA performance outperforms that of FDWSN.