PVFS: A Probabilistic Voting-based Filtering Scheme in Wireless Sensor Networks

Authors:
Feng Li;Avinash Srinivasan;Jie Wu
Affiliations:
Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL 33431, USA.;Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL 33431, USA.;Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL 33431, USA
Venue:
International Journal of Security and Networks
Year:
2008

Citing 0
Cited 4

Wireless telemedicine and m-health: technologies, applications and research issues

International Journal of Sensor Networks
Information-theoretic modeling of false data filtering schemes in wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)
A survey of security visualization for computer network logs

Security and Communication Networks
A survey of cyber crimes

Security and Communication Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study two important attacks in Wireless Sensor Networks (WSNs): the fabricated report with false votes attack; the false votes on real reports attack. Most of the existing works address the first attack while leaving an easy way for the attackers to launch the second. We draw our motivation from this and propose a Probabilistic Voting-based Filtering Scheme (PVFS) to deal with both of these attacks simultaneously. With the general en-route filtering scheme as the underlying model, PVFS combines cluster-based organisation, probabilistic key assignment, and voting methods to curtail these attacks. Through both analysis and simulation, we demonstrate that PVFS can achieve strong protection against both the aforementioned attacks while maintaining a sufficiently high filtering power.