Abstract-When a sensor network is deployed in hostile environments, the adversary may cnmprnmise some sensor nodes, and use the compromised nodes to inject false seming reports or modify the reports sent by other nodw. In order to defend against the attacks with low cost, researchers have proposed symmetric group keybased en-route filtering schemes, such as SEF [l] and I-LHAP [2]. However, if the adversary has compromised a large number of nodes, many group keys can be captured, and the filtering schemes may become ineffective or even useless. To deal with node compromise, the compromised nodes should be identified and the innocent nodes should update their group keys. Some existing intruder identification schemes can he used to identify the compromised nodes, but most existing group rekeying schemes are not suitable for sensor networks since they have large overhead and are not scalable. To address the problem, we propose a family of predktribution and local collaboration-based group rehying (PCGR) schemes. These schemes are designed based on the ideas that future group keys can be preloaded to the sensor nodes before deployment, and neighbors can collaborate to protect and appropriately use the preloaded keys+ Extensive analyses and simutations are conducted to evaluate the proposed schemes, and the results show that the proposed schemes can achieve a good level of security, outperform most previous group rekeying schemes, and significantly improve the effectiveness of filtering false data. index Terms: System design, simulations, sensor networks, security, group rekeying.
In REF , the authors proposed a group rekeying scheme for filtering false data in sensor networks.
Group rekeying for filtering false data in sensor networks: a predistribution and local collaboration-based approach
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
Computer Science