No abstract

No abstract

Wireless sensor networks (WSN) continue to get tremendous popularity because of the increasing number of applications. Some times few sensor nodes are unable to send the correct data to the fusion center or to the neighbour node.Since the network is unaware of the faulty status of the node, so the performance degrades more. The data received from the faulty node can treat as outliers. So that a statistical test can be used to identify the outliers data send by the faulty sensor node.In this paper a neighbouring coordination based self detectable distributed fault detection algorithm and statistical Z-test is proposed. The proposed distributed algorithm is implemented in NS3 and the performance is evaluated in terms of false alarm rate (FAR) and detection accuracy (DA). The results are compared with existing algorithm and shows that the proposed approach gives better performance than the existing algorithms.Index Terms-Wireless sensor networks, distributed fault de tection, soft fault, neighbor coordination I. INTRODUCTlONWireless sensor networks (WSNs) is comprised of a large number of small sensing self-powered sensor nodes distributed in a geographical region, which gather information or detect special events and communicate in a wireless fashion, Rapid technical progress in embedded micro sensing, micro-electro mechanical system (MEMS) and wireless communication lead this emerging technology a reality [1], [2]. Sensing, processing and communication are three key elements whose combination in one tiny device gives rise to a vast number of real time remote sensing applications, including environmental monitor ing, precision agriculture, medical applications and battlefield surveillance. Due to their several popular applications, efficient design and implementation of WSNs have become an area of current research.Availability, sustainability, and consistent performance are the essential features of WSNs which can be degraded due to various factors like environmental noise, change of topology due to link failure, energy depletion, hardware interruption or malicious attack etc. It is a common practice that the sensor nodes becomes faulty because they are deployed in an unattended areas. Any changes occur in environment affect the performance of the sensors due to message loss or corrupted with impulsive noise and topology change.There are different types of fault occurs in WSNs such as hard fault, soft fault, transient fault, byzantine fault etc .. Sometimes sensor node remains silent [3], [4] or give wrong information to its surrounding sensor nodes including fusion center. When the sensor node behaves abnormally for a longer time is known as soft fault [5], [6]. If the network is not aware of that type of fault and process the data by assuming that the sensor node is fault free, then there must be a loss of accuracy in the estimation or detection process. Therefore it is an important and challenging problem in WSNs to find such type of faulty node those are providing abnormal data.The centralized fault detection a...

A distributed fault identification algorithm is proposed here to find both hard and soft faulty sensor nodes present in wireless sensor networks. The algorithm is distributed, self-detectable, and can detect the most common byzantine faults such as stuck at zero, stuck at one, and random data. In the proposed approach, each sensor node gathered the observed data from the neighbors and computed the mean to check whether faulty sensor node is present or not. If a node found the presence of faulty sensor node, then compares observed data with the data of the neighbors and predict probable fault status. The final fault status is determined by diffusing the fault information from the neighbors. The accuracy and completeness of the algorithm are verified with the help of statistical model of the sensors data. The performance is evaluated in terms of detection accuracy, false alarm rate, detection latency and message complexity.

No abstract

No abstract

No abstract

The presence of soft faulty sensor nodes in wireless sensor networks (WSNs) creates problem for maintaining the consistent performance over the entire life span. For this, a distributed fault detection algorithm is proposed which is based on the neighboring coordination technique. The sensor node characteristics are accumulated at a particular time instant to compute the faulty status. In this approach the number of message exchange to identify the faulty sensors is less and also saves substantial amount of energy of the sensor nodes. The proposed algorithm is implemented in N 53. The simulation result shows that the detection accuracy is better compared to other detection techniques.