Skip to main content
SpringerLink
Log in

An Efficient Grid-Based Pairwise Key Predistribution Scheme for Wireless Sensor Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Research on wireless sensor networks (WSNs) has been receiving a lot of attention recently. Because of the constraints on the cost of hardware, there are a lot of restrictions regarding memory, computational ability, and energy consumption, hampering WSN research. So far, many key establishment schemes have been proposed for WSNs. For the proposed schemes, random key predistribution is a practical solution. With this, each sensor shares a common key with its neighbors via predistributed keys. However, it may happen that two sensor nodes do not share a common key. In this paper, an efficient grid-based pairwise key predistribution scheme for WSNs is proposed. In the proposed scheme, multiple polynomials for each row, each column, and each diagonal in the grid are constructed. Then, each sensor node in each row, column, and diagonal in the grid establishes a pairwise key with the other node using the predistributed symmetric polynomial. Simulation results demonstrate the effectiveness of the proposed scheme in increasing the probability of establishing pairwise keys and reducing communication overhead.

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
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Agrawal, D. P., & Zeng, Q.-A. (2003). Introduction to wireless and mobile system. Brooks/Cole Publishing.

  2. Jain, N., & Agrawal, D. P. (2005). Current trends in wireless sensor network design. International Journal of Distributed Sensor Networks, 1, 101–122.

    Article  Google Scholar 

  3. Carman, D. W.,Matt, B. J., & Cirincione, G. H. (2002). Energy-efficient and low-latency key management for sensor networks. In Proceedings of the 23rd army science conference, pp. 97–116.

  4. Hodjat, A., & Verbauwhede, I. (2002). The energy cost of secrets in ad-hoc networks. In Proceedings of the IEEE circuits and systems workshop on wireless communications and networking, pp. 31–35.

  5. He, T., Stankovic, J. A., Lu, C. &, Abdelzaher, T. (2003). SPEED: A stateless protocol for real-time communication in sensor networks. In Proceedings of the 23th IEEE international conference on distributed computing systems, pp. 46–55.

  6. Heinzelman, W. R., Kulik, J., & Balakrishnan, H. (1999). Adaptive protocols for information dissemination in wireless sensor networks. In Proceedings of the 5th annual ACM/IEEE international conference on mobile computing and networking, pp. 174–185.

  7. Heinzelman, W. R., Chandrakasan, A., & Balakrishnan, H. (2000). Energy-efficient communication protocols for wireless microsensor networks. In Proceedings of the 2000 Hawaii international conference on system sciences, pp. 3005–3014.

  8. Intanagonwiwat, C., Govindan, R., & Estrin, D. (2000). A scalable and Robust communication paradigm for sensor networks. In Proceedings of the 6th ACM international conference on mobile computing and networking, pp. 56–67.

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

  10. Cheng ,Y., & Agrawal, D. P. (2005). Efficient pairwise key establishment and management in static wireless sensor networks. In Proceedings of the 2005 IEEE international conference on mobile ad-hoc and sensor systems, pp. 586–597.

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

  12. Blom, R. (1985). An optimal class of symmetric key generation systems. In Proceedings of the Eurocrypy workshop on advances in cryptology, pp. 335–338.

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

  14. Kwon, T., Lee, J., & Song, J. (2009). Location-based pairwise key predistribution for wireless sensor networks. IEEE Transactions on Wireless Communications, 8(11), 5436–5442.

    Article  Google Scholar 

  15. Zhang, L.-P., & Wang, Y. (2010). An ID-based pairwise key predistribution scheme for wireless sensor networks. In Proceedings of the 6th international conference on wireless communications networking and mobile, computing, pp. 1–4.

  16. Long, Y., Wen, Q.-Y., Jin, Z.-P., & Shi, M. (2012). Secure pairwise key establishment for key predistribution in wireless sensor networks. In Proceedings of the 2012 international conference on computer science and service system, pp. 822–825.

  17. Mu, K., & Cui, Q. (2012). An efficient pairwise key establishment scheme for wireless sensor networks. In Proceedings of the 2012 international conference on wireless communications, networking and mobile computing, pp. 1–4.

  18. Kumar, S., & Singh, R. K. (2013). Pair-wise key establishment using random number & distinct random functions in WSNs. In Proceedings of the 2013 IEEE international advance computing conference, pp. 863–869.

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

  20. Sadi, M. G., . Kim, D. S., & Park, J. S. (2005). GBR: Grid based random key predistribution for wireless sensor network. In Proceedings of the 11th international conference on parallel and distributed systems, pp. 310–315.

  21. Rasheed, A., & Mahapatra, R. (2011). Key predistribution schemes for establishing pairwise keys with a mobile sink in sensor networks. IEEE Transactions on Parallel and Distributed Systems, 22(1), 176–184.

    Article  Google Scholar 

  22. Goldreich, O., Goldwasser, S., & Micali, S. (1986). How to construct random functions. Journal of the ACM, 33(4), 792–807.

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This work was supported by the National Science Council of Republic of China under grants NSC-101-2221-E-239-032 and NSC-102-2221-E-239-020.

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National United University, Miao-Li, 360, Taiwan, ROC

    Neng-Chung Wang

  2. Department of Computer Science and Information Engineering, National Taichung University of Science and Technology, Taichung, 404, Taiwan, ROC

    Young-Long Chen

  3. Department of Computer Science and Information Engineering, Chaoyang University of Technology, Taichung, 413, Taiwan, ROC

    Hong-Li Chen

Authors
  1. Neng-Chung Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Young-Long Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hong-Li Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Neng-Chung Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, NC., Chen, YL. & Chen, HL. An Efficient Grid-Based Pairwise Key Predistribution Scheme for Wireless Sensor Networks. Wireless Pers Commun 78, 801–816 (2014). https://doi.org/10.1007/s11277-013-1493-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-013-1493-1

Keywords

Search

Navigation