On the gradual deployment of random pairwise key distribution schemes (Extended Version)

TL;DR

This paper proposes a method for gradually deploying sensor nodes in wireless networks using pairwise key distribution, maintaining security with minimal key storage per node across multiple deployment phases.

Contribution

It introduces a phased deployment approach for pairwise key schemes, reducing the key storage requirement to O(log n) while ensuring secure connectivity.

Findings

Secure connectivity maintained across deployment phases

Key ring size can be minimized to O(log n)

Supports incremental sensor network deployment

Abstract

In the context of wireless sensor networks, the pairwise key distribution scheme of Chan et al. has several advantages over other key distribution schemes including the original scheme of Eschenauer and Gligor. However, this offline pairwise key distribution mechanism requires that the network size be set in advance, and involves all sensor nodes simultaneously. Here, we address this issue by describing an implementation of the pairwise scheme that supports the gradual deployment of sensor nodes in several consecutive phases. We discuss the key ring size needed to maintain the secure connectivity throughout all the deployment phases. In particular we show that the number of keys at each sensor node can be taken to be $O(\log n)$ in order to achieve secure connectivity (with high probability).