Reliable and Fast Detection of Gradual Events in Wireless Sensor Networks

Authors:
Liping Peng;Hong Gao;Jianzhong Li;Shengfei Shi;Boduo Li
Affiliations:
Harbin Institute of Technology, China;Harbin Institute of Technology, China;Harbin Institute of Technology, China;Harbin Institute of Technology, China;Harbin Institute of Technology, China
Venue:
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Year:
2008

Citing 5
Cited 1

Distributed Bayesian Algorithms for Fault-Tolerant Event Region Detection in Wireless Sensor Networks

IEEE Transactions on Computers
REED: robust, efficient filtering and event detection in sensor networks

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Contour map matching for event detection in sensor networks

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Distributed Real-Time Detection and Tracking of Homogeneous Regions in Sensor Networks

RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Boundary estimation in sensor networks: theory and methods

IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks

Efficient data collection with spatial clustering in time constraint WSN applications

ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World

Quantified Score

Hi-index	0.00

Visualization

Abstract

Event detection is among the most important applications of wireless sensor networks. Due to the fact that sensor readings do not always represent the true attribute values, previous literatures suggested threshold-based voting mechanism which involves collecting votes of all neighbors to disambiguate node failures from events, instead of reporting an event directly based on the judgement of single sensor node. Although such mechanism significantly reduces false positives, it inevitably introduces false negatives which lead to a detection delay under the scenario of gradual events. In this paper, we propose a new detection method --- the bit-string match voting (BMV), which provides a response time close to that of the direct reporting method and a false positive rate even lower than that of the threshold-based voting method. Furthermore, BMV is able to avoid repeated and redundant reports of the same event, thus prolongs the life of the network. Extensive simulations are given to demonstrate and verify the advantages of BMV.