An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
A pairwise key pre-distribution scheme for wireless sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Toward resilient security in wireless sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Resilience of sink filtering scheme in wireless sensor networks
Computer Communications
Wireless sensor network localization techniques
Computer Networks: The International Journal of Computer and Telecommunications Networking
PDF: A Public-key based False Data Filtering Scheme in Sensor Networks
WASA '07 Proceedings of the International Conference on Wireless Algorithms,Systems and Applications
Space efficient secret sharing for implicit data security
Information Sciences: an International Journal
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Arranging cluster sizes and transmission ranges for wireless sensor networks
Information Sciences: an International Journal
IEEE Transactions on Parallel and Distributed Systems
Multi-Dimensional resilient statistical en-route filtering in wireless sensor networks
GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
BeeSensor: An energy-efficient and scalable routing protocol for wireless sensor networks
Information Sciences: an International Journal
Resilient Network Coding in the Presence of Byzantine Adversaries
IEEE Transactions on Information Theory
ICDCS '12 Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems
Hi-index | 0.07 |
False data filtering is an important issue in wireless sensor networks. In this paper, we consider a new type of false data injection attacks called collaborative false data injection, and propose two schemes to defend such attacks. In collaborative false data injection attacks, multiple compromised nodes collaboratively forge a fake report and inject the report into the network. This type of attacks is hard to defend with existing approaches, because they only verify a fixed number of message authentication codes (MACs) carried in the data report but the adversary can easily obtain enough compromised nodes from different geographical areas of the network to break their security. Our novel solution is to bind the keys of sensor nodes to their geographical locations, and verify the legitimacy of a data report by checking whether the locations of the sensors endorsing the report are logical (e.g., the sensors should be close enough to each other to sense the same event). We propose two filtering schemes: The geographical information based false data filtering scheme (GFFS) which utilizes the absolute positions of sensors in the verification, and the neighbor information based false data filtering scheme (NFFS) which utilizes relative positions of sensors when absolute positions cannot be obtained. We theoretically analyze the filtering probability of the two proposed schemes, and evaluate their performance through extensive simulations. Simulation results show that, when there are totally ten nodes compromised in a 400 nodes network, the detection probability of collaborative false data injection attacks is higher than 97% in GFFS and NFFS, but is less than 7% in traditional false data filtering approaches such as SEF.