Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Combinatorial Design Based Key Pre-distribution Scheme with High Scalability and Minimal Storage for Wireless Sensor Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Given the sensitivity of applications and the sensor node’s resource constraints, key management is an important security concern in Wireless Sensor Networks (WSNs). Combinatorial Design based schemes are used to propose key pre-distribution in WSNs as they have patterns that can be mapped to the WSNs. We employ Combinatorial Designs to pre-distribute the keys to the sensor nodes. The deployment area is divided into equal-sized regions called cells. The network comprises two types of sensor nodes: ordinary sensor nodes and cell masters. The ordinary sensor nodes within a cell can communicate with each other directly. The inter-cell communication is through the cell masters, which have higher resource capabilities than the ordinary sensor nodes. To take into account the Radio Frequency range of cell masters, we use Lee sphere region around each cell (Ruj in ACM Transactions on Sensor Networks (TOSN) 6:4, 2009, Rui Key predistribution using partially balanced designs in wireless sensor networks, 2007). The proposed key pre-distribution scheme for cell masters provides high network scalability with low key storage overhead compared to other schemes. The model’s performance is measured in terms of key storage overhead and the number of sensor nodes supported. A detailed analysis of resiliency in terms of fractions of links disrupted is also presented. Also, the proposed scheme achieved better resiliency and requires much less number of keys to be stored in sensor nodes than the existing schemes.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Data availability

Not applicable.

Code Availability

Not applicable.

References

  1. Ruj, S., & Roy, B. (2009). Key predistribution using combinatorial designs for grid-group deployment scheme in wireless sensor networks. ACM Transactions on Sensor Networks (TOSN), 6(1), 4.

    Article  Google Scholar 

  2. Ruj, S., & Roy, B. (2007). Key predistribution using partially balanced designs in wireless sensor networks. In International Symposium on Parallel and Distributed Processing and Applications. pp. 431–445. Springer.

  3. Zhu, C., Zheng, C., Shu, L., & Han, G. (2012). A survey on coverage and connectivity issues in wireless sensor networks. Journal of Network and Computer Applications, 35(2), 619–632.

    Article  Google Scholar 

  4. Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002). A survey on sensor networks. IEEE Communications Magazine, 40(8), 102–114.

    Article  Google Scholar 

  5. Kumar, A., & Pais, A. R. (2017). En-route filtering techniques in wireless sensor networks: A survey. Wireless Personal Communications, 96(1), 697–739.

    Article  Google Scholar 

  6. 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 

  7. Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., & Yung, M. (1992). Perfectly secure key distribution for dynamic conferences. In Annual international cryptology conference. pp. 471–486. Springer.

  8. Liu, D., & Ning, P. (2003). Establishing pairwise keys in distributed sensor networks. In Proceedings of the 10th ACM conference on Computer and communications security. pp. 52–61.

  9. Liu, D., & Ning, P. (2003). Location-based pairwise key establishments for static sensor networks. In Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks, pp. 72–82.

  10. Blom, R. (1984). An optimal class of symmetric key generation systems. In: Workshop on the Theory and Application of of Cryptographic Techniques, pp. 335–338. Springer.

  11. Du, W., Deng, J., Han, Y. S., Varshney, P. K., Katz, J., & Khalili, A. (2005). A pairwise key predistribution scheme for wireless sensor networks. ACM Transactions on Information and System Security (TISSEC), 8(2), 228–258.

    Article  Google Scholar 

  12. Huang, D., Mehta, M., Medhi, D., & Harn, L. (2004). Location-aware key management scheme for wireless sensor networks. In Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks. pp. 29–42.

  13. Huang, D., & Medhi, D. (2007). Secure pairwise key establishment in large-scale sensor networks: An area partitioning and multigroup key predistribution approach. ACM Transactions on Sensor Networks, 3(3), 16-es.

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  15. Lee, J., & Stinson, D.R. (2005). A combinatorial approach to key predistribution for distributed sensor networks. In IEEE Wireless Communications and Networking Conference. 2005, vol. 2, pp. 1200–1205. IEEE.

  16. Simonova, K., Ling, A.C., & Wang, X.S. (2006). Location-aware key predistribution scheme for wide area wireless sensor networks. In Proceedings of the fourth ACM workshop on Security of ad hoc and sensor networks. pp. 157–168.

  17. Mitra, S., Mukhopadhyay, S., & Dutta, R. (2012). A flexible deterministic approach to key pre-distribution in grid based wsns. In International conference on ad hoc networks. pp. 164–179. Springer.

  18. Bag, S. (2015). A new key predistribution scheme for grid-group deployment of wireless sensor networks. Adhoc & Sensor Wireless Networks 27.

  19. Bag, S., & Roy, B. (2013). A new key predistribution scheme for general and grid-group deployment of wireless sensor networks. EURASIP Journal on Wireless Communications and Networking, 2013(1), 145.

    Article  Google Scholar 

  20. Modiri, V., Javadi, H. H. S., & Anzani, M. (2017). A novel scalable key pre-distribution scheme for wireless sensor networks based on residual design. Wireless Personal Communications, 96(2), 2821–2841.

    Article  Google Scholar 

  21. Kumar, A., & Pais, A. R. (2019). A new combinatorial design based key pre-distribution scheme for wireless sensor networks. Journal of Ambient Intelligence and Humanized Computing, 10(6), 2401–2416.

    Article  Google Scholar 

  22. Kumar, A., & Pais, A. R. (2019). A new hybrid key pre-distribution scheme for wireless sensor networks. Wireless Networks, 25(3), 1185–1199.

    Article  Google Scholar 

  23. Kumar, A., Bansal, N., & Pais, A. R. (2019). New key pre-distribution scheme based on combinatorial design for wireless sensor networks. IET Communications, 13(7), 892–897.

    Article  Google Scholar 

  24. Kumar, A., Bansal, N., & Pais, A. R. (2021). A partial key pre-distribution based en-route filtering scheme for wireless sensor networks. Journal of Ambient Intelligence and Humanized Computing, 12(1), 1471–1486.

    Article  Google Scholar 

  25. Kittur, L.J., & Pais, A.R. (2022). Key pre-distribution scheme for wireless sensor networks using combinatorial design. In Proceedings of First International Conference on Computational Electronics for Wireless Communications. pp. 635–644. Springer.

  26. Stinson, D. (2007). Combinatorial designs: Constructions and analysis. Springer Science & Business Media.

    MATH  Google Scholar 

  27. Blackburn, S.R., Etzion, T., Martin, K.M., & Paterson, M.B. (2008). Efficient key predistribution for grid-based wireless sensor networks. In International conference on information theoretic security. pp. 54–69. Springer.

  28. Black, P.E. (2006). Manhattan distance dictionary of algorithms and data structures. https://xlinux.nist.gov/dads//.

  29. Wallis, W. D. (2016). Introduction to combinatorial designs. CRC Press.

    Book  MATH  Google Scholar 

  30. Liu, D., & Ning, P. (2005). Improving key predistribution with deployment knowledge in static sensor networks. ACM Transactions on Sensor Networks (TOSN), 1(2), 204–239.

    Article  Google Scholar 

Download references

Funding

Not applicable.

Author information

Authors and Affiliations

Authors

Contributions

Not applicable.

Corresponding author

Correspondence to Lakshmi Jayant Kittur.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kittur, L.J., Pais, A.R. Combinatorial Design Based Key Pre-distribution Scheme with High Scalability and Minimal Storage for Wireless Sensor Networks. Wireless Pers Commun 128, 855–873 (2023). https://doi.org/10.1007/s11277-022-09979-2

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-022-09979-2

Keywords