BROWSE
Detail
Conference Paper
Secure Rejoining Scheme for Dynamic Sensor Networks
Cited 0 time in 
Share 
Share
- Authors
- Young Sik Hwang, Seung Wan Han, Taek Yong Nam
- Issue Date
- 2006-06
- Citation
- Emerging Trends in Information and Communication Security (LNCS 3995), v.3995, pp.101-114
- Publisher
- Springer
- Language
- English
- Type
- Conference Paper
- Abstract
- The establishment of cryptography keys is one of the challenging problems in the sensor networks. Key Infection [1] is a promising model to solve this problem on the commodity sensor networks without complex mechanism. This model, however, does not consider the mobility of sensors, so if sensor nodes move out of initial communication range, then they cannot rejoin the network. So, key infection model has been limited to the static sensor network. To be applied on the dynamic sensor network, therefore, key infection model has to be extended to handle node's rejoining. In this paper, we propose secure rejoining scheme for dynamic sensor networks and verify the proposed scheme formally. Our scheme is secure, since it uses old pair-wise key information to verify sensor node's rejoining. Furthermore, our scheme does not require additional verification information and maintains the reasonable number of links. © Springer-Verlag Berlin Heidelberg 2006.
- KSP Keywords
- Communication range, Infection model, Key information, Number of links, Pair-wise, Sensor node, Static sensor, challenging problems, dynamic sensor network, key infection