Efficient key establishment for group-based wireless sensor deployments

  • Authors:
  • Li Zhou;Jinfeng Ni;Chinya V. Ravishankar

  • Affiliations:
  • University of California - Riverside, Riverside, CA;University of California - Riverside, Riverside, CA;University of California - Riverside, Riverside, CA

  • Venue:
  • Proceedings of the 4th ACM workshop on Wireless security
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Establishing pairwise keys for each pair of neighboring sensors is the first concern in securing communication in sensor networks. This task is challenging because resources are limited. Several random key predistribution schemes have been proposed, but they are appropriate only when sensors are uniformly distributed with high density. These schemes also suffer from a dramatic degradation of security when the number of compromised sensors exceeds a threshold. In this paper, we present a group-based key predistribution scheme, GKE, which enables any pair of neighboring sensors to establish a unique pairwise key, regardless of sensor density or distribution. Since pairwise keys are unique, security in GKE degrades gracefully as the number of compromised nodes increases. In addition, GKE is very efficient since it requires only localized communication to establish pairwise keys, thus significantly reducing the communication overhead. Our security analysis and performance evaluation illustrate the superiority of GKE in terms of resilience, connectivity, communication overhead and memory requirement.