Sciweavers

Share
IWCMC
2006
ACM

A probabilistic voting-based filtering scheme in wireless sensor networks

9 years 9 months ago
A probabilistic voting-based filtering scheme in wireless sensor networks
In this paper, we study the fabricated report with false votes attack and the false votes on real reports attack in wireless sensor networks. Since most of the existing works addresses the first attack while leaving an easy way for the attackers to launch the second attack, we propose a probabilistic voting-based filtering scheme (PVFS) to deal with both of them simultaneously. On the basis of the en-route filtering scheme, PVFS combines cluster-based organization, probabilistic key assignment, and voting methods. Through both analysis and simulation, we demonstrate that PVFS could achieve strong protection against both attacks while maintaining a sufficiently high filtering power. Categories and Subject Descriptors C.2.2 [Computer-Communication Networks]: Network Protocols, Wireless Communications General Terms Algorithms, Design, Security, Performance Keywords Wireless sensor networks, node compromise, probabilistic key assignment, voting method
Feng Li, Jie Wu
Added 14 Jun 2010
Updated 14 Jun 2010
Type Conference
Year 2006
Where IWCMC
Authors Feng Li, Jie Wu
Comments (0)
books