Elsevier

Ad Hoc Networks

Volume 25, Part A, February 2015, Pages 170-184
Ad Hoc Networks

Distributed self fault diagnosis algorithm for large scale wireless sensor networks using modified three sigma edit test

https://doi.org/10.1016/j.adhoc.2014.10.006Get rights and content

Abstract

Distributed self diagnosis is an important problem in wireless sensor networks (WSNs) where each sensor node needs to learn its own fault status. The classical methods for fault finding using mean, median, majority voting and hypothetical test based approaches are not suitable for large scale WSNs due to large deviation in inaccurate data transmission by different faulty sensor nodes. In this paper, a modified three sigma edit test based self fault diagnosis algorithm is proposed which diagnose both hard and soft faulty sensor nodes. The proposed distribute self fault diagnosis (DSFD) algorithm is simulated in NS3 and the performances are compared with the existing distributed fault detection algorithms. The simulation results show that the detection accuracy, false alarm rate and false positive rate performance of the DSFD algorithm is much better in adverse environment where the traditional methods fails to detect the fault. The other parameters such as detection latency, energy consumption and the network life time are also determined.

Introduction

Wireless sensor networks (WSNs) comprise of thousands of tiny sensor nodes having limited memory, less processing power, battery constraint is deployed in an environment such as underwater, underground for multimedia and terrestrial applications like navigation, environmental monitoring, agriculture, landslide monitoring and emergency rescue operations [1], [43], [33]. The sensor nodes are sensing and processing capability and interact with other sensor nodes using a wireless medium. The sensor nodes form an adhoc network without following any infrastructure. In fact, the communications between sensor nodes is a type of peer to peer communication.

Since the sensor nodes are deployed in hostile and human inaccessible environments, they are subjected to various kinds of faults. These faulty sensor nodes lead to produce erroneous results during their normal operation. In order to prevent the WSNs from the effect of faulty sensor node, a self fault diagnosis algorithm is proposed here to diagnose both hard [3], [7], [13] and soft faulty sensor nodes [6], [17], [42], [2]. The fault free sensor nodes produce correct results during the network operation. The hard faulty sensor nodes do not respond, whereas the soft faulty sensor nodes respond with erroneous data skewed from the original data. The actual and erroneous data sensed by different sensor nodes is assumed to be a random variable which varies from one region to another region of the sensor network [18], [34]. Distributed self fault diagnosis of WSNs has recently important due to their application in various sectors of society. The dependence on WSN encompasses to design and develop a robust fault diagnosis algorithm for WSNs, so that they can sustain for longer duration in the presence of faults.

The fault diagnosis techniques based on classical estimates like sample mean, variance, co-variance or correlations are adversely influenced by large deviation of data for a faulty sensor node [25], [8], [30]. In fact, these estimators are producing correct fault status when many sensor nodes are faulty within a particular region. Motivated by this, a modified three sigma edit test approach is adapted to diagnose the faulty sensor nodes present in WSNs. In the proposed approach, the performance of the diagnosis depends on neighboring node’s data where each sensor node participates in the fault diagnosis process to identify itself as faulty (hard or soft) or fault free. The accuracy in finding the status of all the sensor nodes depends on the number of neighboring nodes. The proposed diagnosis algorithm performs better when more number of neighboring nodes are likely to be faulty.

It has been seen from the literature that the existing method leads to a large number of message exchanges over the network for data and status exchange which rapidly depletes the energy of the sensor nodes. It really puts a large overhead for the large scale WSNs. Due to poor performance and high energy overhead of the existing set of approaches, it is necessary to design and develop an efficient fault diagnosis algorithm for large scale WSNs.

This paper has following contributions: (i) Modified three sigma edit test based fault diagnosis algorithm is proposed to diagnose the faulty sensor nodes present in WSNs. (ii) The proposed method is compared with traditional comparison model and three sigma edit test. (iii) A distributed self-fault diagnosis (DSFD) algorithm where each sensor node diagnoses itself with high detection accuracy, low false alarm rate and false positive rate. (iv) Evaluation of the DSFD algorithm using standard simulator NS3 and compare the performance with the existing works in the literature given by Panda and Khilar [29], Chen et al. [6] and Jiang [17].

The remaining part of the paper is organized as follows. In Section 2, the related work which provides an exhaustive survey about the previous work is discussed. The network, fault and radio model are discussed in Section 3. The proposed DSFD algorithm is described in Section 4. The analysis of the algorithm along with modified three sigma edit test method is discussed in Section 5. The simulation results with discussions are given in Section 6. Finally, Section 7 concludes the paper.

Section snippets

Related works

The system and node level fault diagnosis has been traditionally known as a system level diagnosis after the work of the researchers Preparata et al. in [32]. Since then, all the system level diagnosis algorithms are feasible for multi-computer and multi-processor systems. A generalized theory for system level fault diagnosis is presented in [39]. The necessary and sufficient conditions are provided for any fault-pattern of any size to be uniquely diagnosable, under the symmetric, and

System model

The system model consists of network, fault and radio model. In network model, the network topology and the way nodes communicate with each other are specified. In fault model, we describe different types of fault based on the behavior of faulty, fault free sensor nodes, and the data generated by different sensor node. Along with this, these models also describe the behavior of the sensor nodes on the occurrence of faults. Finally, the radio model is developed to calculate the energy required

Distributed self-fault diagnosis algorithm (DSFD)

The DSFD algorithm is consisting of two phases such as initialization and self-diagnosis phase. In initialization phase, each sensor node si transmits a message containing the sensed data xi to its neighboring nodes Negi and waits for a estimated transmission time ETTi as given in (18). During that transmission time, it also collects all the messages coming from its neighbors. After ETTi expires, each node si extracts the information from all receiving messages and maintains a neighboring Table

Analysis of the DSFD Algorithm

The proposed DSFD algorithm for WSNs is based on the assumption of network and fault model given in Section 3. Let the data of the sensor node si at kth time instant is denoted as xi(k). In order to find the faulty sensor node in the network, the data {xi(k)}i=1N of all the sensor nodes are to be analyzed. The sensor reading xi(k) can be either actual sensed data or the erroneous data. This xi(k) follows normal distribution NA,σi2 where σi2 is the variance of erroneous data present at ith

Simulation results and discussions

The performance of the proposed DSFD algorithm is evaluated and compared with the existing DFD [29], Jiang [17] and JSA [6] algorithms in terms of detection accuracy (DA), false positive rate (FPR), false alarm rate (FAR), and other network parameters such as total number of message exchange in the network, energy consumption, diagnosis latency to find all the faulty node, network life time which are defined in Section 5. All the algorithms are simulated in a standard network simulator NS3 [37]

Conclusion

In this paper, a modified three sigma edit test based distributed self fault diagnosis (DSFD) algorithm for large scale wireless sensor networks is proposed. Here each sensor node collects data from the neighbors and then diagnose itself by using the modified three sigma edit test of the received data. The performance of the DSFD is compared with the existing algorithms and all the algorithms are simulated in NS3 simulator. The simulation results show that the proposed method outperforms over

Meenakshi Panda received her M-Tech degree in CSE from Utkal University, India in 2006. Currently she is pursuing her Ph.D in the department of CSE at National Institute of Technology Rourkela, India. She worked as Asst. Prof. at Siliocon Institute of Technology (SIT) Bhubaneswar, Orissa, India for four year before joining Ph.D. Her research interest includes fault detection in wireless sensor networks and robust distributed estimation in faulty WSN.

References (43)

  • Ronald P. Bianchini et al.

    Implementation of online distributed system-level diagnosis theory

    IEEE Trans. Comput.

    (1992)
  • David Braun, Sarit Mukherjee, Cuneyt Akinlar, Zero Configuration Networking, US Patent 7,002,924, February...
  • Jinran Chen et al.

    Distributed fault detection of wireless sensor networks

  • S. Chessa et al.

    Crash faults identification in wireless sensor networks

    Sci. Direct J. Comput. Commun.

    (2002)
  • M. Ding, D. Chen, K. Xing, X. Cheng, Localized fault-tolerant event boundary detection in sensor networks, in: INFOCOM...
  • E.P. Duarte et al.

    Distributed diagnosis of dynamic events in partitionable arbitrary topology networks

    IEEE Trans. Parall. Distrib. Syst.

    (2012)
  • Elias Procópio Duarte et al.

    A hierarchical adaptive distributed system-level diagnosis algorithm

    IEEE Trans. Comput.

    (1998)
  • Mourad Elhadef, Azzedine Boukerche, Hisham Elkadiki, Diagnosing mobile ad-hoc networks: two distributed...
  • Harald T. Friis, A note on a simple transmission formula, in: Proceedings of the I.R.E. and Waves and Electrons, May...
  • W.R. Heinzelman, A. Chandrakasan, H. Balakrishnan, Energy-efficient communication protocol for wireless microsensor...
  • S.H. Hosseini et al.

    On self-fault diagnosis of the distributed systems

    IEEE Trans. Comput.

    (1988)
  • Cited by (102)

    • Cloud-fog-based approach for smart wildfire monitoring

      2023, Simulation Modelling Practice and Theory
    View all citing articles on Scopus

    Meenakshi Panda received her M-Tech degree in CSE from Utkal University, India in 2006. Currently she is pursuing her Ph.D in the department of CSE at National Institute of Technology Rourkela, India. She worked as Asst. Prof. at Siliocon Institute of Technology (SIT) Bhubaneswar, Orissa, India for four year before joining Ph.D. Her research interest includes fault detection in wireless sensor networks and robust distributed estimation in faulty WSN.

    P.M. Khilar was born in India, on July 10, 1968. Graduated from Mysore University in Computer Science and Engineering in the year 1990. Got his M.Tech Degree from NIT, Rourkela in the year 1999 and received his Ph.D. from IIT, Kharagpur in the year 2009. Presently, he is working as an Assistant Professor in CSE Department at NIT Rourkela, India. His current research interests includes Parallel and Distributed Processing and Fault Tolerant Computing.

    View full text