A Comparison Analysis of Fault Detection Algorithms in Wireless Sensor Networks
Zainab Alansari, Anupama Prasanth, Mohammad Riyaz Belgaum · 2018
Sensors are capable of performing different tasks such as receiving various environmental information and have generated the idea of creating and expanding the traditional networks to Wireless Sensor Networks (WSN). A WSN include various sensor nodes which are distributed in the environment to gather data. The sensor node's location is not necessarily defined and not specified. Such a feature allows us to release them in hazardous or inaccessible places. On the other hand, this means that the WSN protocols and algorithms must have the ability to self-deny. Other unique features of WSNs are the ability of sensor nodes to collaborate and coordinate with each other. A processor is assigned to each sensor node which initially performs a series of acquired simple information processing to transmits the semi-processed data instead of sending all raw data to the center, Base Station (BS) or the sink node. Fault detections in WSN are of particular importance due to unique technical and conceptual challenges. In this paper, due to the specific limitations and operating conditions of wireless sensor networks, different fault detection algorithms were examined. The best way to improve the ability of fault detection is to reduce energy consumption in sensor nodes. In such techniques, using the residue number system in the wireless sensor network structure improves repair and fault detection. Moreover, modules are attached whenever we require distinguishing and correcting the information security in the number system. Although there are various algorithms yet the Residue Number System algorithm has higher performance.