Efficient Localized Detection of Erroneous Nodes (ELDEN)

Abstract

Wireless Sensor Networks (WSNs) have attracted considerable research effort in the community during the past couple of years. One of the most challenging issues so far is the extension of network lifetime with regards to small battery capacity and self-sustained operation. Endeavors to save energy have been made on various frontiers, ranging from hardware improvements over medium access and routing protocols to network clustering and role changing strategies. Only weak attention has been paid to the detection of erroneous nodes which can be also used for lifetime extension of WSNs. In contrast to some authors, regarding detection of failures in communication as error detection, we focus on faulty sensor readings. In this work we present an efficient error detection algorithm which detects erroneous nodes within the network based on neighborhood relations. The results of our algorithm enables direct reactions of concerned nodes or network parts without expensive involvement of any kind of central computing instances.

A Lightweight Fault-Detection Scheme for Resource-Constrained Solar Insecticidal Lamp IoTs

“…However, current quantile-based distributed fault-detection methods do not set intervals based on historical data but rather perform fault detection based on multiple data from neighboring nodes simultaneously. For example, the process of the quantile fault-detection method proposed in the literature [ 34 ] consists of:…”

An anomaly node detection method for distributed time synchronization algorithm in cognitive radio sensor networks

“…If one node is voted by all its neighbors, the node will be regarded as an abnormal node. As an improvement to the simple voting, the voting methods discussed in Xiao et al 18 and Behnke et al 19 were affected by the weights between nodes. The method presented in Xiao et al 18 required that the nodes be connected only when they are similar, which make the voting credible.…”

“…The method presented in Xiao et al 18 required that the nodes be connected only when they are similar, which make the voting credible. The Efficient Localized Detection of Erroneous Nodes (ELDEN) proposed by Behnke et al 19 computed the weight through the distance between nodes and every node chooses the median of its neighbors to compare with its own state value. Then the difference will be normalized by the weight and becomes the final difference Y.…”