Skip to main content
SpringerLink
Log in

A Novel Scalable Key Pre-distribution Scheme for Wireless Sensor Networks Based on Residual Design

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Key distribution is one of the most challenging security issues in wireless sensor networks. To achieve a high level of security, each pair of nodes must share a secret key in order to communicate with each other. Recently, many researchers have used combinatorial designs as key pre-distribution scheme in wireless sensor networks. In this paper, we describe a new construction of a design in combinatorial algebraic called residual design and use it for key establishment. This is the first time for application of residual design. Our approach is a highly scalable key management scheme for wireless sensor networks which provides a good secure connectivity. We show that the basic mapping from residual design to key pre-distribution has an extremely high network scalability while this mapping does not have high resilience. Therefore, we present a new approach for key pre-distribution based on residual design that improves the resilience of the network while maintaining connectivity and high scalability. We also explain that the computational cost and storage overhead is low. Performance and security properties of the proposed scheme are studied both analytically and computationally to compare our scheme to main existing schemes. The obtained results show that at equal key-ring size, our scheme provides better scalability with high connectivity and resilience.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Rathnayaka, A. J. D., & Potdar, V. M. (2011). Wireless sensor network transport protocol: A critical review. Journal of Network and Computer Applications, 36, 1–13.

    Google Scholar 

  2. Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (1990). Handbook of applied cryptography. New York, NY: CRC Press.

    MATH  Google Scholar 

  3. Camtepe, S. A., & Yener, B. (2007). Combinatorial design of key distribution mechanisms for wireless sensor networks. IEEE/ACM Transactions on Networking, 15, 346–358.

    Article  Google Scholar 

  4. Ghen, C. Y., & Chao, H. C. (2011). A survey of key distribution in wireless sensor networks. Security and Communication Networks, 7, 2495–2508.

    Google Scholar 

  5. Eschenauer, L., & Gligor, V. D. (2002). A key-management scheme for distributed sensor networks. In Proceeding of the 9th ACM conference on computer and communications security (pp. 41–47).

  6. Chan, H., Perring, A., & Song, D. (2003). Random key pre-distribution schemes for sensor networks. In Proceeding of IEEE symposium on security and privacy (pp. 197–213).

  7. Qian, S. (2012). A novel key pre-distribution for wireless sensor networks. Physics Procedia, 25, 2183–2189.

    Article  Google Scholar 

  8. Li, W. S., Tsai, C. W., Chen, M., Hsieh, W. S., & Yang, C. S. (2013). Threshold behavior of multi-path random key pre-distribution for sparse wireless sensor networks. Mathematical and Computer Modelling, 57(11), 2776–2787.

    Article  MathSciNet  MATH  Google Scholar 

  9. Blom, R. (1985). An optimal class of symmetric key generation systems. In Proceedings of Eurocrypt, advances in cryptology (pp. 335–338). Springer.

  10. Blundo, C., Santis, A. D., Herzberg, A., Vaccaro, U., & Yung, M. (1992). Perfectly-secure key distribution for dynamic conferences. In Proceeding, advances in cryptology (CRYPTO 92) (pp. 471–486).

  11. Camtepe, S. A., & Yener, B. (2004). Combinatorial design of key distribution mechanisms for wireless sensor networks. In P. Samarati, P. Y. A. Ryan, D. Gollmann, & R. Molva (Eds.), ESORICS, volume 3193 of lecture notes in computer science (pp. 293–308). Springer.

  12. Lee, J., & Stinson, D. (2005). A combinatorial approach to key pre-distribution for distributed sensor networks. In IEEE wireless communications and networking conference (WCN’ 05), IEEE communication society (pp. 1200–1205).

  13. Ruj, S., & Roy, B. (2007). Key pre-distribution using partially balanced designs in wireless sensor networks. In 5th international symposium (ISPA) (pp. 431–445). Springer.

  14. Chakrabarti, D., Maitra, S., & Roy, B. K. (2006). A key pre-distribution scheme for wireless sensor networks: Merging blocks in combinatorial design. International Journal of Information Security, 5, 105–114.

    Article  MATH  Google Scholar 

  15. Ruj, S., Nayak, A., & Stojmenovic, I. (2013). Pairwise and triple key distribution in wireless sensor networks with applications. IEEE Transactions on Computers, 62(11), 2224–2237.

    Article  MathSciNet  MATH  Google Scholar 

  16. Bechkit, W., Challal, Y., Bouabdallah, A., & Tarokh, V. (2013). A highly scalable key pre-distribution scheme for wireless sensor networks. IEEE Transactions on Wireless Communications, 12(2), 948–959.

    Article  Google Scholar 

  17. Liu, D., Ning, P., & Li, R. (2005). Establishing pairwise keys in distributed sensor networks. ACM Transactions on Information and System Security (TISSEC), 8(1), 41–77.

    Article  Google Scholar 

  18. Kavitha, T., & Sridharan, D. (2010). Hybrid design of scalable key distribution for wireless sensor networks. IACSIT International Journal of Engineering and Technology, 2(2), 136–141.

    Google Scholar 

  19. Dargahi, T., Javadi, H. H. S., & Hosseinzade, M. (2015). Application-specific hybrid symmetric design of key pre-distribution for wireless sensor networks. Journal of Security and Communication Networks, 8, 1561–1574.

  20. Zhang, J., & Varadharajan, V. (2010). Wireless sensor network key management survey and taxonomy. Journal of Network and Computer Applications, 33, 63–75.

    Article  Google Scholar 

  21. Stinson, D. (2004). Combinatorial designs: Construction and analysis. Berlin: Springer.

    MATH  Google Scholar 

  22. Wallis, W. D. (1988). Combinatorial designs. Pure and applied mathematics series. New York: CRC Press.

    MATH  Google Scholar 

  23. Kendall, E., Kendall, M., & Kendall, W. S. (2012). A generalised formula for calculating the resilience of random key predistribution schemes. In IACR Cryptology ePrint Archive (p. 426).

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran

    Vahid Modiri

  2. Department of Mathematics and Computer Science, Shahed University, Tehran, Iran

    Hamid Haj Seyyed Javadi & Mohaddese Anzani

Authors
  1. Vahid Modiri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hamid Haj Seyyed Javadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohaddese Anzani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hamid Haj Seyyed Javadi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Modiri, V., Javadi, H.H.S. & Anzani, M. A Novel Scalable Key Pre-distribution Scheme for Wireless Sensor Networks Based on Residual Design. Wireless Pers Commun 96, 2821–2841 (2017). https://doi.org/10.1007/s11277-017-4326-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-017-4326-9

Keywords

Search

Navigation