A Key Distribution Scheme for Sensor Networks Using Structured Graphs

TL;DR

This paper introduces a key predistribution scheme for sensor networks utilizing structured graphs, optimizing parameters like key count, path length, and routing complexity for improved network security and efficiency.

Contribution

The paper proposes a novel key distribution method based on structured graphs, enhancing network performance and security in sensor networks.

Findings

Reduces the number of keys per node while maintaining connectivity.

Optimizes path lengths and network diameter.

Simplifies routing algorithms for sensor networks.

Abstract

This paper presents a new key predistribution scheme for sensor networks based on structured graphs. Structured graphs are advantageous in that they can be optimized to minimize the parameter of interest. The proposed approach achieves a balance between the number of keys per node, path lengths, network diameter and the complexity of routing algorithm.