Fast recovery from node compromise in wireless sensor networks
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Dual-verifiers DVS with message recovery for tolerant routing in wireless sensor networks
PAISI'11 Proceedings of the 6th Pacific Asia conference on Intelligence and security informatics
| Hi-index | 0.00 |
Wireless sensor networks (WSNs) suffer from a wide range of security attacks due to their limited processing and energy capabilities. Their use in numerous mission critical applications, however, requires that fast recovery from such attacks be achieved. Much research has been completed on detection of security attacks, while very little attention has been paid to recovery from an attack. In this paper, we propose a novel, lightweight authentication protocol that can secure network and node recovery operations such as re-clustering and reprogramming. Our protocol is based on hash functions and we compare the performance of two well-known lightweight hash functions, SHA-1 and Rabin. We demonstrate that our authentication protocol can be implemented efficiently on a sensor network test-bed with TelosB motes. Further, our experimental results show that our protocol is efficient both in terms of computational overhead and execution times which makes it suitable for low resourced sensor devices.