On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks

TL;DR

This paper reviews the use of combinatorial designs for key predistribution in wireless sensor networks, highlighting their mathematical structure and assessing their suitability for secure, infrastructure-less environments.

Contribution

It critically examines the applicability of combinatorial designs in developing key predistribution schemes for wireless sensor networks.

Findings

Combinatorial designs offer a structured approach to key predistribution.

Their suitability depends on network security and scalability requirements.

The paper identifies strengths and limitations of design-based schemes.

Abstract

The constraints of lightweight distributed computing environments such as wireless sensor networks lend themselves to the use of symmetric cryptography to provide security services. The lack of central infrastructure after deployment of such networks requires the necessary symmetric keys to be predistributed to participating nodes. The rich mathematical structure of combinatorial designs has resulted in the proposal of several key predistribution schemes for wireless sensor networks based on designs. We review and examine the appropriateness of combinatorial designs as a tool for building key predistribution schemes suitable for such environments.