Secure Rejoining Scheme for Dynamic Sensor Networks

  • Young-Sik Hwang
  • Seung-Wan Han
  • Taek-Yong Nam
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3995)


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.


Sensor Network Sensor Node Neighbor Node Secure Connection Symmetric Cryptography 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Anderson, R., Chan, H., Perrig, A.: Key Infection: Smart Trust for Smart. In: IEEE International Conference on Network Protocols (ICNP 2004) (2004)Google Scholar
  2. 2.
    Eschenauer, L., Gligor, V.D.: A Key-Management Scheme for Distributed Sensor Networks, Conference on Computer and Communications Security. In: Proceedings of the 9th ACM conference on Computer and communications security 2002, Washington, DC, USA (2002)Google Scholar
  3. 3.
    Chan, H., Perrig, A., Song, D.: Random Key Predistribution Schemes for Sensor Networks. In: IEEE Symposium on Research and Privacy (2003)Google Scholar
  4. 4.
    Du, W., Deng, J., Han, Y.S., Varshney, P.K.: A Pairwise Key Pre-Distribution Scheme for wireless sensor networks. In: ACM conference on Computer and Communications Security (CCS) (2003)Google Scholar
  5. 5.
    Blom, R.: An Optimal Class of Symmetric Key Generation Systems. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 335–338. Springer, Heidelberg (1985)CrossRefGoogle Scholar
  6. 6.
    Hwang, J.M., Kim, Y.D.: Revisiting Random Key Pre-distribution Schemes for Wireless Sensor Networks. In: SASN 2004, Washington, DC, USA (October 2004)Google Scholar
  7. 7.
    Szewxzyk, R., Osterwell, E., Polastre, J., Hamiltom, M., Mainwaring, A., Estrin, D.: Habitat Monitoring. Communication of the ACM 47(6) (June 2004)Google Scholar
  8. 8.
    Shi, E., Perrig, A.: Designing Secure Sensor Networks. IEEE Wireless Communications (December 2004)Google Scholar
  9. 9.
    Diffle, W., Hellman, M.E.: New Directions in Cryptography. IEEE Transactions on Information Theory IT-22(6) (November 1976)Google Scholar
  10. 10.
    Burrows, M., Abadi, M., Needham, R.: A Logic of Authentication. ACM Transactions Computer Systems (February 1990)Google Scholar
  11. 11.
    Boyd, C., Mathuira, A.: Protocols for Authentication and Key Establishment, pp. 59–62. Springer, Heidelberg (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Young-Sik Hwang
    • 1
    • 2
  • Seung-Wan Han
    • 1
  • Taek-Yong Nam
    • 1
  1. 1.Privacy Protection Research Division, Electronics and Telecommunications Research InstituteDaejeonSouth Korea
  2. 2.University of Science & TechnologyDaejeonSouth Korea

Personalised recommendations