A Graph Theoretic Approach for Optimizing Key Pre-distribution in Wireless SensorNetworks

TL;DR

This paper introduces a graph theoretic framework to optimize key pre-distribution in wireless sensor networks, balancing key storage, path length, and resilience, and provides bounds and design schemes for improved security and efficiency.

Contribution

It presents a novel graph theoretic approach to analyze and optimize key pre-distribution schemes, deriving bounds and designing schemes with minimal storage and high resilience.

Findings

Derived a lower bound on key storage for given path length

Established an upper bound on compromise probability

Designed key assignment schemes matching the lower bound complexity

Abstract

Finding an optimal key assignment (subject to given constraints) for a key predistribution scheme in wireless sensor networks is a difficult task. Hence, most of the practical schemes are based on probabilistic key assignment, which leads to sub-optimal schemes requiring key storage linear in the total number of nodes. A graph theoretic framework is introduced to study the fundamental tradeoffs between key storage, average key path length (directly related to the battery consumption) and resilience (to compromised nodes) of key predistribution schemes for wireless sensor networks. Based on the proposed framework, a lower bound on key storage is derived for a given average key path length. An upper bound on the compromising probability is also given. This framework also leads to the design of key assignment schemes with a storage complexity of the same order as the lower bound.