Deterministic Key Pre-distribution Scheme Research Articles

Key pre-distribution schemes to support various architectural deployment models in WSN

The tremendous applications of wireless sensor technology for day to day activities are rapidly increasing. They have the ability to make the environment smart and prolific. As vulnerabilities on wireless sensor networks are increasing, ensuring secure communication has gained a lot of attention from past years. In this paper, by considering the resource constraints of those networks, three deterministic key pre-distribution schemes are proposed using the symmetric matrix property to support group, grid and overlay based architecture deployment models. The proposed key pre-distribution schemes aim to minimise the key storage overhead and increase the local connectivity and resilience of the network.

A deterministic key pre-distribution scheme for WSN using projective planes and their complements

We present two deterministic key pre-distribution schemes, one using projective planes and the other using complementary design of projective plane. The nodes are arranged hierarchically through a structure of (p2 + p)-nary tree, where p is a prime power. Our schemes are incumbent to more efficient resilience compared to the existing schemes. Each node requires storing significantly less number of keys. Furthermore, any number of nodes can be intrinsically inserted in the system by attributing a very few keys to the recently introduced nodes only. More interestingly, such node insertions in our schemes are done without interfering the normal functioning of the existing organised network.

A group-based deterministic key pre-distribution scheme for wireless sensor network

In this paper, we present a deterministic key pre-distribution scheme for wireless sensor network using combinatorial designs adapting a group-and cluster-based approach. Clusters are formed by taking a collection of nodes, and those clusters are further taken collectively to form groups. Three types of communications enable us to achieve connectivity of desired level. Our scheme provides better resilience (both in case of node and links) as compared to some other schemes, while keeping the number of secret keys to be stored at each node significantly less.

Key pre-distribution in a non-uniform rectangular grid for wireless sensor networks

A deterministic key pre-distribution scheme is proposed in the paper. The distribution of keys to the nodes precedes a virtual arrangement of the nodes into a non-uniform rectangular grid structure. Distribution of keys is based on projective planes and pairwise connectivity. With small memory requirements, the nodes induce a network which offers a trade-off between connectivity and resilience. The impact of resilience and connectivity can be controlled by choosing the number of rows and columns suitably. Another significant aspect of the proposed scheme is that the path between any two nodes is not unique, which leads to a well-connected network.

Key pre-distribution using partially balanced designs in wireless sensor networks

We propose two deterministic key predistribution schemes in a wireless sensor network (WSN), in which sensor nodes are deployed randomly. Both the schemes are based on combinatorial designs, called partially balanced incomplete block designs (PBIBD). An important feature of our scheme is that every pair of nodes within communication range can communicate directly, making communication faster and efficient. The number of keys per node is of the order of $\sqrt N$, where $N$ is the number of nodes in the network. Our second design has the added advantage that we can introduce new nodes in the network keeping the key pool fixed. This makes the network scalable. We study the resiliency of the network under node compromise and show that our designs give better results than the existing ones.

Key Predistribution Scheme for Grid Based Wireless Sensor Networks using Quadruplex Polynomial Shares per Node

To enable secure communication, pre-distributing keys to sensors in a grid based wireless sensor network has been efficient alternatives. In this paper, we propose a deterministic key predistribution scheme using symmetric bivariate polynomials as key pool in which each node stores four polynomial shares. The -secure property of -degree polynomial is exploited to achieve high resilience against both random and selective node capture. Also, a strategy to mount selective node capture on the proposed scheme is rendered. The proposed scheme is scalable and provides comparable connectivity with that of the existing schemes.

Key predistribution using combinatorial designs for grid-group deployment scheme in wireless sensor networks

We propose a new grid-group deployment scheme in wireless sensor networks. We use combinatorial designs for key predistribution in sensor nodes. The deployment region is divided into square regions. The predistribution scheme has the advantage that all nodes within a particular region can communicate with each other directly and nodes which lie in a different regions can communicate via special nodes called agents which have more resources than the general nodes. The number of agents in a region is always three, whatever the size of the network. We give measures of resiliency taking the Lee distance into account. Apart from considering the resiliency in terms of fraction of links broken, we also consider the resiliency as the number of nodes and regions disconnected when some sensor are compromised. This second measure, though very important, had not been studied so far in key predistribution schemes which use deployment knowledge. We find that the resiliency as the fraction of links compromised is better than existing schemes. The number of keys preloaded in each sensor node is much less than all existing schemes and nodes are either directly connected or connected via two hop paths. The deterministic key predistribution schemes result in constant-time computation overhead for shared key discovery and path key establishment.