Skip to main content
Log in

Simple, extensible and flexible random key predistribution schemes for wireless sensor networks using reusable key pools

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

Sensor nodes are tiny, low-power, computationally limited and battery constrained electromechanical devices. A sensor node contains a sensing unit and a wireless communication unit. Sensor nodes are deployed over a field for sensing an event data in the environment and transfer it towards a base station over its wireless channel. In a typical application, vast amount of sensor nodes are deployed over a field which constitute a sensor network. Sensor nodes must be customized for a specific sensor network application before the deployment. This customization is needed not only for underlying networking application, but also for security related configurations. Random key predistribution mechanisms have been proposed to provide security for wireless sensor networks. In the literature, there are well known random key predistribution schemes. Some of these schemes are secure, but quite complex to apply in real-world applications due to their node-based customization requirements, while some other are easily applicable but they do not offer reasonable security. In this paper, we propose random key predistribution schemes for wireless sensor networks that provide varying ranges of security. The proposed schemes are easily applicable in real world scenarios due to their simplicity and relaxed node customization requirements. In this respect, our schemes provide a tradeoff. Moreover, our proposed schemes show a good extensibility property. We assume prior deployment knowledge. We examine performance of our schemes and compare them with well known random key predistribution schemes.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Akyildiz I.F., Su W., Sankarasubramaniam Y., Cayirci E. (2002) A survey on sensor networks. IEEE Communications Magazine 40(8): 102–114 doi:10.1109/MCOM.2002.1024422

    Article  Google Scholar 

  • Chan, H., Perrig, A., & Song, D. (2003). Random key predistribution schemes for sensor networks. In Proceedings of IEEE symposium on security and privacy (pp. 197–213).

  • Diffie W., Hellman M.E. (1976) New directions in cryptography. IEEE Transactions on Information Theory 22: 644–654 doi:10.1109/TIT.1976.1055638

    Article  Google Scholar 

  • Du, W., Deng, J., Han, Y. S., Chen, S., & Varshney, P. K. (2004). A key management scheme for wireless sensor networks using deployment knowledge. In Proceedings of IEEE Infocom.

  • Du, W., Deng, J., Han, Y. S., & Varshney, P. K. (2003). A pairwise key pre-distribution scheme for wireless sensor networks. In Proceedings of 10th ACM conference on computer and communications security (pp. 42–51).

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

  • 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).

  • Karlof, C., & Wagner, D. (2003). Secure routing in wireless sensor networks: Attacks and countermeasures. In Proceedings of first IEEE international workshop on sensor network protocols and applications.

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

  • Menezes, A. J., Vanstone, V. A., & Van Oorschot, P. C. (1996). Handbook of Applied Cryptography. CRC Press.

  • Perrig, A., Szewczyk, R., Wen, V., Cullar, D., & Tygar, J. D. (2001). Spins: Security protocols for sensor networks. In Proceedings of 7th annual ACM/IEEE international conference on mobile computing and networking (MobiCom) (pp. 189–199).

  • Rivest R.L., Shamir A., Adleman L.M. (1978) A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2): 120–126 doi:10.1145/359340.359342

    Google Scholar 

  • Tasci, S. E., Bayramoglu, E., & Levi, A. (2008). Simple and flexible random key predistribution schemes for wireless sensor networks using deployment knowledge. In Proceedings of 2nd international conference on information security and assurance (ISA 2008) (pp. 488–494). IEEE Computer Society.

  • Unlu, A., Armagan, O., Levi, A., Savas, E., & Ercetin, O. (2007). Key predistribution schemes for sensor networks for continuous deployment scenario. In Proceedings of IFIP/TC6 networking 2007. LNCS (Vol. 4479, pp. 239–250). Springer.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Albert Levi.

Additional information

This paper is an extended version of Tasci et al. (2008).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Levi, A., Taşçı, S.E., Lee, Y.J. et al. Simple, extensible and flexible random key predistribution schemes for wireless sensor networks using reusable key pools. J Intell Manuf 21, 635–645 (2010). https://doi.org/10.1007/s10845-009-0256-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-009-0256-z

Keywords

Navigation