skip to main content
research-article

Group-based key predistribution for wireless sensor networks

Published:08 April 2008Publication History
Skip Abstract Section

Abstract

Many key predistribution techniques have been developed recently to establish pairwise keys between sensor nodes in wireless sensor networks. To further improve these schemes, researchers have also proposed to take advantage of the sensors' expected locations and discovered locations to help the predistribution of the keying materials. However, in many cases, it is very difficult to deploy sensor nodes at their expected locations or guarantee the correct location discovery at sensor nodes in hostile environments. In this article, a group-based deployment model is developed to improve key predistribution. In this model, sensor nodes are only required to be deployed in groups. The critical observation in the article is that the sensor nodes in the same group are usually close to each other after deployment. This deployment model is practical; it greatly simplifies the deployment of sensor nodes, while still providing an opportunity to improve key predistribution. Specifically, the article presents a novel framework for improving key predistribution using the group-based deployment knowledge. This framework does not require the knowledge of the sensors' expected or discovered locations and is thus suitable for applications where it is difficult to deploy the sensor nodes at their expected locations or correctly estimate the sensors' locations after deployment. To seek practical key predistribution schemes, the article presents two efficient instantiations of this framework, a hash key-based scheme and a polynomial-based scheme. The evaluation shows that these two schemes are efficient and effective for pairwise key establishment in sensor networks; they can achieve much better performance than the previous key predistribution schemes when the sensor nodes are deployed in groups.

References

  1. Akyildiz, I., Su, W., Sankarasubramaniam, Y., and Cayirci, E. 2002. Wireless sensor networks: A survey. Comput. Netw. 38, 4, 393--422. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Anderson, R., Chan, H., and Perrig, A. 2004. Key infection: Smart trust for smart dust. In Proceedings of the IEEE International Conference on Network Protocols (ICNP 2004). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Basagni, S., Herrin, K., Bruschi, D., and Rosti, E. 2001. Secure pebblenets. In Proceedings of the ACM International Symposium on Mobile ad hoc Networking and Computing. 156--163. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., and Yung, M. 1993. Perfectly-secure key distribution for dynamic conferences. In Advances in Cryptology—CRYPTO '92. Lecture Notes in Computer Science, vol. 740. Springer Berlin, Germany. 471--486. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Capkun, S. and Hubaux, J. 2005. Secure positioning of wireless devices with application to sensor networks. In Proceedings of IEEE InfoCom'05.Google ScholarGoogle Scholar
  6. Carman, D., Kruus, P., and Matt, B. J. 2000. Constrains and approaches for distributed sensor network security. Tech. rep. 00-010. NAI Labs, Glenwood, MD.Google ScholarGoogle Scholar
  7. Chan, H. and Perrig, A. 2005. PIKE: Peer intermediaries for key establishment in sensor networks. In Proceedings of IEEE Infocom.Google ScholarGoogle Scholar
  8. Chan, H., Perrig, A., and Song, D. 2003. Random key predistribution schemes for sensor networks. In Proceedings of the IEEE Symposium on Research in Security and Privacy. 197--213. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Deng, J., Han, R., and Mishra, S. 2003. Security support for in-network processing in wireless sensor networks. In Proceedings of the 2003 ACM Workshop on Security in ad hoc and Sensor Networks (SASN '03). Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Du, W., Deng, J., Han, Y. S., Chen, S., and Varshney, P. 2004. A key management scheme for wireless sensor networks using deployment knowledge. In Proceedings of IEEE INFOCOM'04.Google ScholarGoogle Scholar
  11. Du, W., Deng, J., Han, Y. S., and Varshney, P. 2003. A pairwise key pre-distribution scheme for wireless sensor networks. In Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS'03). 42--51. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Eschenauer, L. and Gligor, V. D. 2002. A key-management scheme for distributed sensor networks. In Proceedings of the 9th ACM Conference on Computer and Communications Security. 41--47. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Gay, D., Levis, P., von Behren, R., Welsh, M., Brewer, E., and Culler, D. 2003. The nesC language: A holistic approach to networked embedded systems. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI 2003). Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Hartung, C., Balasalle, J., and Han, R. 2005. Node compromise in sensor networks: The need for secure systems. Tech. Rep. CU-CS-990-05. University of Colorado at Boulder, Boulder, CO.Google ScholarGoogle Scholar
  15. Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D., and Pister, K. S. J. 2000. System architecture directions for networked sensors. In Proceedings of the Conference Architectural Support for Programming Languages and Operating Systems. 93--104. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Hu, L. and Evans, D. 2003. Secure aggregation for wireless networks. In Proceedings of the Workshop on Security and Assurance in ad hoc Networks. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Huang, D., Mehta, M., Medhi, D., and 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 (SASN '04). 29--42. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Hwang, J. and Kim, Y. 2004. Revisiting random key pre-distribution schemes for wireless sensor networks. In Proceedings of the 2nd ACM Workshop on Security of ad hoc and Sensor Networks (SASN '04). 43--52. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Karlof, C. and Wagner, D. 2003. Secure routing in wireless sensor networks: Attacks and countermeasures. In Proceedings of the 1st IEEE International Workshop on Sensor Network Protocols and Applications.Google ScholarGoogle Scholar
  20. Lazos, L., Capkun, S., and Poovendran, R. 2005. Rope: Robust position estimation in wireless sensor networks. In Proceedings of the Fourth International Conference on Information Processing in Sensor Networks (IPSN '05). Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Lazos, L. and Poovendran, R. 2004. Serloc: Secure range-independent localization for wireless sensor networks. In Proceedings of the ACM Workshop on Wireless Security (WiSe 2004, Philadelphia, PA). Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Li, Z., Trappe, W., Zhang, Y., and Nath, B. 2005. Robust statistical methods for securing wireless localization in sensor networks. In Proceedings of the Fourth International Conference on Information Processing in Sensor Networks (IPSN '05). Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Liu, D. and Ning, P. 2003a. Establishing pairwise keys in distributed sensor networks. In Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS'03). 52--61. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Liu, D. and Ning, P. 2003b. Location-based pairwise key establishments for static sensor networks. In Proceedings of the 2003 ACM Workshop on Security in ad hoc and Sensor Networks (SASN '03). 72--82. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Liu, D. and Ning, P. 2005. Improving key predistribution with deployment knowledge in static sensor networks. ACM Trans. Sensor Netw. 1, 2, 204--239. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Liu, D., Ning, P., and Du, W. 2005. Attack-resistant location estimation in wireless sensor networks. In Proceedings of the Fourth International Conference on Information Processing in Sensor Networks (IPSN '05). Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Niculescu, D. and Nath, B. 2001. Ad hoc positioning system (APS). In Proceedings of IEEE GLOBECOM '01.Google ScholarGoogle Scholar
  28. Perrig, A., Szewczyk, R., Wen, V., Culler, D., and Tygar, D. 2001. SPINS: Security protocols for sensor networks. In Proceedings of the Seventh Annual International Conference on Mobile Computing and Networks. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Pietro, R. D., Mancini, L. V., and Mei, A. 2003. Random key assignment for secure wireless sensor networks. In Proceedings of the 2003 ACM Workshop on Security in ad hoc and Sensor Networks (SASN '03). Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Przydatek, B., Song, D., and Perrig, A. 2003. SIA: Secure information aggregation in sensor networks. In Proceedings of the First ACM Conference on Embedded Networked Sensor Systems (SenSys '03). Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Ray, S., Ungrangsi, R., Pellegrini, F. D., Trachtenberg, A., and Starobinski, D. 2003. Robust location detection in emergency sensor networks. In Proceedings of IEEE INFOCOM 2003.Google ScholarGoogle Scholar
  32. Wood, A. D. and Stankovic, J. A. 2002. Denial of service in sensor networks. IEEE Comput. 35, 10, 54--62. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Yu, Z. and Guan, Y. 2005. A key predistribution scheme using deployment knowledge for wireless sensor networks. In Proceedings of the ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN). Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Zhu, S., Setia, S., and Jajodia, S. 2003. LEAP: Efficient security mechanisms for large-scale distributed sensor networks. In Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS'03). 62--72. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Group-based key predistribution for wireless sensor networks

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM Transactions on Sensor Networks
        ACM Transactions on Sensor Networks  Volume 4, Issue 2
        March 2008
        192 pages
        ISSN:1550-4859
        EISSN:1550-4867
        DOI:10.1145/1340771
        Issue’s Table of Contents

        Copyright © 2008 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 8 April 2008
        • Accepted: 1 September 2007
        • Revised: 1 February 2007
        • Received: 1 August 2006
        Published in tosn Volume 4, Issue 2

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader