PVFS: A Probabilistic Voting-based Filtering Scheme in Wireless Sensor Networks Online publication date: Tue, 26-Aug-2008
by Feng Li, Avinash Srinivasan, Jie Wu
International Journal of Security and Networks (IJSN), Vol. 3, No. 3, 2008
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Security and Networks (IJSN):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com