A Key Distribution Scheme for Sensor Networks Using Structured Graphs
classification
💻 cs.CR
keywords
graphsstructurednetworksschemesensorachievesadvantageousalgorithm
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.