Location-aware key predistribution scheme for wide area wireless sensor networks

ABSTRACT

Key predistribution in wireless sensor networks refers to the problem of distributing secret keys among sensors prior to deployment. Solutions appeared in the literature can be classified into two categories: basic schemes that achieve fixed probability of sharing a key between any pair of sensors in a network and location-aware schemes that use a priori knowledge about sensors' communication needs, such as location information, to guarantee connectivity only among sensors that need to and can talk. Location-aware schemes achieve performance enhancement over the basic schemes by using resources efficiently. However, existing location-aware solutions are not compatible with combinatorial methods that use a set of key groups to generate sensors' key rings. Combinatorial methods are appealing as they achieve deterministic performance close to optimal. Besides, existing location-aware solutions do not have enough flexibility in terms of trade-off between connectivity and resilience. In this paper we propose a general key predistribution framework that can use any key predistribution method as its underlying scheme, including combinatorial ones. The proposed framework provides the user with options on how to allocate available resources to achieve desired performance based on the needs of the application. We also consider heterogeneous sensor networks consisting of nodes with different amount of memory and communication ranges and show that special treatment of this case results in substantial performance improvement. We confirm the good performance of our framework by providing experimental and analytical results.

REFERENCES

• 1: I. F. Akyildiz , W. Su , Y. Sankarasubramaniam , E. Cayirci, Wireless sensor networks: a survey, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.38 n.4, p.393-422, 15 March 2002 [doi>10.1016/S1389-1286(01)00302-4]
• 2: R Blom, An optimal class of symmetric key generation systems, Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques, p.335-338, December 1985, Paris, France
• 3: Carlo Blundo , Alfredo De Santis , Amir Herzberg , Shay Kutten , Ugo Vaccaro , Moti Yung, Perfectly-Secure Key Distribution for Dynamic Conferences, Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology, p.471-486, August 16-20, 1992
• 4: S. A. Camtepe, and B. Yener. Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks. Computer Security -- ESORICS, Springer-Verlag, LNCS 3193, 2004, pp 293--308.
• 5: S.A. Camtepe, and B. Yener. Key Distribution Mechanisms for Wireless Sensor Networks: a Survey. Technical Report TR-05-07, Rensselaer Polytechnic Institute
• 6: Haowen Chan , Adrian Perrig , Dawn Song, Random Key Predistribution Schemes for Sensor Networks, Proceedings of the 2003 IEEE Symposium on Security and Privacy, p.197, May 11-14, 2003
• 7: W. Du, J. Deng, Y. S. Han, S. Chen, P. Varashney. A key management scheme for wireless sensor networks using deployment knowledge. Proceedings of IEEE INFOCOM'04. IEEE Computer Society Press, Los Alamitos, CA, 2004
• 8: Wenliang Du , Jing Deng , Yunghsiang S. Han , Pramod K. Varshney , Jonathan Katz , Aram Khalili, A pairwise key predistribution scheme for wireless sensor networks, ACM Transactions on Information and System Security (TISSEC), v.8 n.2, p.228-258, May 2005 [doi>10.1145/1065545.1065548]
• 9: Laurent Eschenauer , Virgil D. Gligor, A key-management scheme for distributed sensor networks, Proceedings of the 9th ACM conference on Computer and communications security, November 18-22, 2002, Washington, DC, USA [doi>10.1145/586110.586117]
• 10: J. Lee, D. R. Stinson. On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks using Combinatorial Designs CACR 2005-40 Technical report, 2005
• 11: Donggang Liu , Peng Ning, Establishing pairwise keys in distributed sensor networks, Proceedings of the 10th ACM conference on Computer and communications security, October 27-30, 2003, Washington D.C., USA [doi>10.1145/948109.948119]
• 12: Donggang Liu , Peng Ning, Location-based pairwise key establishments for static sensor networks, Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks, October 31, 2003, Fairfax, Virginia [doi>10.1145/986858.986869]
• 13: Douglas R. Stinson, Combinatorial Designs: Constructions and Analysis, SpringerVerlag, 2003
• 14: P. Traynor, H. Choi, G. Cao, S. Zhu, T. La Porta, "Establishing Pair-Wise Keys in Heterogeneous Sensor Networks" IEEE INFOCOM, April 2006.
• 15: http://www.intel.com/research/exploratory/heterogeneous.htm

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.0 General
          Subjects: Security and protection (e.g., firewalls)

General Terms:
Design, Management, Security

Keywords:
key predistribution scheme, security, sensor network