FEDAV (fault-tolerant event detection algorithm based on voting)

Abstract

The invention discloses an FEDAV which comprises the following steps which are executed sequentially: (1), detection data of each node is acquired; (2), the detection data is subjected to fault-tolerant processing on the basis of a histogram; (3), the detection data is subjected to local error detection on the basis of attribute correlation to distinguish LF nodes and primary Normal nodes; (4), the primary Normal nodes are subjected to local event decision to distinguish LE nodes and Normal nodes; (5), credibility of neighbor nodes of the LF nodes and the LE nodes are computed; and (6), voting is performed based on the credibility and distance weighting, so that the nodes are judged to be either Event nodes or Normal nodes. The FEDAV has a higher event detection rate, a higher error correction rate, a lower event false alarm rate, a lower mistaken introduction rate as well as lower capacity consumption.

Description

technical field [0001] The present invention relates to a fault-tolerant event detection method in a wireless sensor network, in particular to a fault-tolerant event detection algorithm based on voting strategy (Fault-tolerant Event Detection Algorithm based on Voting, referred to as FEDAV) method. Background technique [0002] Wireless Sensor Networks (WSN for short) is a wireless self-organizing network composed of a group of sensor nodes, which is used to collect data and information of various monitored objects in real time, analyze and process them, and provide the detection results to the network. user. [0003] Event detection in WSN refers to detecting the area or boundary where an event occurs. For events with specific characteristics (for example, when a forest fire occurs, high temperature in a local area, dryness, etc.), when such an event occurs, the sampling value of the corresponding sensor will deviate from the sampling value of the normal situation. Theref...

AI Technical Summary

Problems solved by technology

[0005] Bayesian-based fault-tolerant algorithm (Krishnamachari B, Iyengar S. Distributed OTDS Algorithms for Fault-Tolerant Event Region Detection in Wireless Sensor Networks [J]. IEEE Trans, Computers, 2004, 53(3): 241-250) is a classic Although the fault-tolerant algorithm has better fault-tolerant performance, it only corrects its own event decision-making results based on whether the number of neighbors consistent with its own event judgment results reaches half, or the size of the posterior probability. The detection accuracy is not high, because When the spatial redundancy information is insufficient, such as for nodes at the event boundary, the fault tolerance performance is poor

The fault-tolerant algorithm based on voting strategy (Chen J, Kher S, Somani A. Distributed Fault Detection of Wireless Sensor Networks [C]. Proc of the 2006 Workshop on Dependability Issues in Wireless Ad Hoc Networks and Sensor Networks, 2006: 65-71) has not Consider the distance factor between neighbor nodes, and the fault tolerance effect of different neighbor nodes on the central node is different

[0006] Fault-tolerant processing based on spatial correlation has good fault-tolerant performance, but often requires frequent exchange of data between nodes, which consumes a lot of energy

Images