Katerina Simonova
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.
- F. Akylidiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci. Wireless sensor networks: A survey. Computer Networks, 38(4): 392--422, 2002 Google Scholar
Digital Library
- R. Blom An optimal class of symmetric key generation systems. Advances in Cryptology: Proceedings of EUROCRYPT 84. Lecture Notes in Computer Science, Vol. 209. Springer Verlag, New York, 335--338, 1985 Google ScholarDigital Library
- C. Blundo, A. Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung. Perfectly-secure key distribution for dynamic conferences. In Advances in Cryptology (CRYPTO '92), 471--486, 1993 Google ScholarDigital Library
- 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. Google ScholarDigital Library
- S.A. Camtepe, and B. Yener. Key Distribution Mechanisms for Wireless Sensor Networks: a Survey. Technical Report TR-05-07, Rensselaer Polytechnic InstituteGoogle Scholar
- H. Chan, A. Perrig, and D. Song Random Key Predistribution Schemes for sensor networks. Proceedings of the IEEE Symposium on Research in Security and Privacy. Infocom. IEEE Computer Society Press, Los Alamitos, CA 197--203, 2003 Google ScholarDigital Library
- 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, 2004Google Scholar
- W. Du, J. Deng, Y. S. Han, P. K. Varshney, J. Katz, and A. Khalili "A Pairwise Key Pre-Distribution Scheme for Wireless Sensor Networks", ACM Transactions on Information and System Security 8(2): 228--258, 2005 Google ScholarDigital Library
- L. Eschenauer, V.D. Gligor. A key-management scheme for distributed sensor networks. Proceedings of the 9th ACM Conference on Computer and Communication Security (CCS'02). ACM, New York, 41--47, 2002 Google ScholarDigital Library
- 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, 2005Google Scholar
- D. Liu and P. Ning. Establishing Pairwise keys in distributed sensor networks. Proceedings of the 10th ACM Conference on Computer and Communication Security (CCS'03). ACM, New York, 52--61, 2003 Google ScholarDigital Library
- D. Liu and P. Ning. Location-Based pairwise key establishments for static sensor networks. Proceedings of the 2003 ACM Workshop on Security in Ad Hoc and Sensor Networks (SASN'03). ACM, New York, 72--82, 2003 Google ScholarDigital Library
- D. R. Stinson. Combinatorial Designs: Constructions and Analysis, Springer-Verlag, New York, 2003 Google ScholarDigital Library
- P. Traynor, H. Choi, G. Cao, S. Zhu, T. La Porta, "Establishing Pair-Wise Keys in Heterogeneous Sensor Networks" IEEE INFOCOM, April 2006.Google Scholar
- http://www.intel.com/research/exploratory/heterogeneous.htmGoogle Scholar
Index Terms
- Location-aware key predistribution scheme for wide area wireless sensor networks
Recommendations
Group-based key predistribution for wireless sensor networks
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 ...
Location-aware key establishment in wireless sensor networks
IWCMC '06: Proceedings of the 2006 international conference on Wireless communications and mobile computingDue to its efficiency, symmetric key cryptography is very attractive in sensor networks. A number of pairwise key pre-distribution protocols have been proposed, but the scalability is often constrained by the conflict between the desired probability of ...
A pairwise key predistribution scheme for wireless sensor networks
To achieve security in wireless sensor networks, it is important to be able to encrypt and authenticate messages sent between sensor nodes. Before doing so, keys for performing encryption and authentication must be agreed upon by the communicating ...
Comments