Open Access

A Robust on-Demand Path-Key Establishment Framework via Random Key Predistribution for Wireless Sensor Networks

EURASIP Journal on Wireless Communications and Networking20062006:091304

DOI: 10.1155/WCN/2006/91304

Received: 2 October 2005

Accepted: 12 January 2006

Published: 20 March 2006

Abstract

Secure communication is a necessity for some wireless sensor network (WSN) applications. However, the resource constraints of a sensor render existing cryptographic systems for traditional network systems impractical for a WSN. Random key predistribution scheme has been proposed to overcome these limits. In this scheme, a ring of keys is randomly drawn from a large key pool and assigned to a sensor. Nodes sharing common keys can communicate securely using a shared key, while a path-key is established for those nodes that do not share any common keys. This scheme requires moderate memory and processing power, thus it is considered suitable for WSN applications. However, since the shared key is not exclusively owned by the two end entities, the established path-key may be revealed to other nodes just by eavesdropping. Based on the random-key predistribution scheme, we present a framework that utilizes multiple proxies to secure the path-key establishment. Our scheme is resilient against node capture, collusive attack, and random dropping, while only incurring a small amount of overhead. Furthermore, the scheme ensures that, with high probability, all path-keys are exclusively known by the two end nodes involved in the communication along the path.

[12345678910111213]

Authors’ Affiliations

(1)
Department of Computer Science, University of Pittsburgh
(2)
Department of Computer Science, University of Texas at Dallas

References

  1. Carman DW, Kruus PS, Matt BJ: Constrains and approaches for distributed sensor netowrk security. In Tech. Rep. 00-010. NAI Labs, Glenwood, Md, USA; September 2000.Google Scholar
  2. Eschenauer L, Gligor VD: A key-management scheme for distributed sensor networks. Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS '02), November 2002, Washingtion, DC, USA 41-47.View ArticleGoogle Scholar
  3. Ling H, Znati T: End-to-end pairwise key establishment using multi-path in wireless sensor network. Proceedings of IEEE Global Communications Conference (GLOBECOM '05), November-December 2005, St. Louis, Mo, USAGoogle Scholar
  4. Chan H, Perrig A, Song D: Random key predistribution schemes for sensor networks. Proceedings of IEEE Symposium on Security and Privacy (S&P '03), May 2003, Berkeley, Calif, USA 197-213.Google Scholar
  5. Du W, Deng J, Han YS, Chen S, Varshney PK: A key management scheme for wireless sensor networks using deployment knowledge. Proceedings of 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '04), March 2004, Hong Kong 1: 586-597.Google Scholar
  6. Du W, Deng J, Han YS, Varshney PK: A pairwise key pre-distribution scheme for wireless sensor networks. Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS '03), October 2003, Washingtion, DC, USA 42-51.Google Scholar
  7. Pietro RD, Mancini LV, Mei A: Random key-assignment for secure wireless sensor networks. Proceedings of the 1st ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN '03), October 2003, Fairfax, Va, USA 62-71.View ArticleGoogle Scholar
  8. Liu D, Ning P: Improving key predistribution with deployment knowledge in static sensor networks. ACM Transactions on Sensor Networks 2005,1(2):204-239. 10.1145/1105688.1105691View ArticleGoogle Scholar
  9. Liu D, Ning P, Du W: Group-based key pre-distribution in wireless sensor networks. Proceedings of ACM Workshop on Wireless Security (WiSe '05), September 2005, Cologne, GermanyGoogle Scholar
  10. Zhu S, Xu S, Setia S, Jajodia S: Establishing pairwise keys for secure communication in ad hoc networks: a probabilistic approach. Proceedings of 11th IEEE International Conference on Network Protocols (ICNP '03), November 2003, Atlanta, Ga, USA 326-335.Google Scholar
  11. Shamir A: How to share a secret. Communications of the ACM 1979,22(11):612-613. 10.1145/359168.359176MATHMathSciNetView ArticleGoogle Scholar
  12. Ganesan D, Govindan R, Shenker S, Estrin D: Highly resilient, energy efficient multipath routing in wireless sensor networks. Mobile Computing and Communications Review 2002,1(2):10-24.Google Scholar
  13. Li X, Cuthbert L: A reliable node-disjoint multipath routing with low overhead in wireless ad hoc networks. Proceedings of the 7th ACM International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (ACM MSWiM '04), October 2004, Venice, Italy 230-233.View ArticleGoogle Scholar

Copyright

© Guanfeng Li et al. 2006

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.