Combinatorial Approach to Key Generation using Multiple Key Spaces for Wireless Sensor Networks

Abstract

Key generation is an important challenge among the issues related to security in wireless sensor network. Each node has a set of keys called key-chain rather than a single shared key.The key-chains are generated at the base station and stored in the ROMs of sensor nodes prior to deployment. This paper brings in the idea of deterministic approach to key generation. There is no need to assume a probability that any two nodes are neighbors. We use combinatorics based approach using a block design technique called symmetric Balanced Incomplete Block Design (BIBD). We construct multiple key-spaces out of a key pool from which the key-chains are formed. The main contribution to this work is the use of multiple key spaces to decrease memory utilization at each sensor node, retain connectivity and still not hamper the resilience of the network. It decreases the redundancy in key generation. It eliminates the dependency between the number of keys in the key-chain and number of nodes in the network.978-1-4244-2963-9/08/$25.00

Redundancy in Key Management for WSNs

“…In [13,14], the application of SBIBD and Generalized Quadrangles to key management is investigated and a hybrid proposal was presented. Srinivasa et al [15] proposed an approach based on SBIBD and multiple key-space. Lee and Stinson [16] used Transversal designs.…”

Application‐specific hybrid symmetric design of key pre‐distribution for wireless sensor networks

“…To reduce the memory usage of the symmetric design, Srinivasa et al [26] propose a multiple key-space approach based on symmetric BIBD. For a network of size N, they consider a prime power n such that n 2 + n + 1 > N and construct a symmetric design from key pool P. In this scheme, the nodes are partitioned into k n groups, and each sensor node belonging to a group is assigned a key chain from the corresponding key space, which is a subset of the key pool P. Therefore, there are k n key spaces such that each of which contains m 2 + m + 1 blocks (key chains), where m is a prime power.…”

“…Çamtepe and Yener propose a key pre‐distribution scheme using symmetric BIBD. Another approach based on the symmetric BIBD scheme has been proposed by Srinivasa et al , in which multiple key spaces are constructed out of a key pool instead of a single key space. In another study, Lee and Stinson use transversal design for key pre‐distribution.…”

“…To reduce the memory usage of the symmetric design, Srinivasa et al , propose a multiple key‐space approach based on symmetric BIBD. For a network of size N , they consider a prime power n such that n 2 + n + 1> N and construct a symmetric design from key pool P .…”