Paper 2008/412 Original: eprint.iacr.org/2008/412 ↗
Key Predistribution for Homogeneous Wireless Sensor Networks with Group Deployment of Nodes
Abstract
Recent literature contains proposals for key predistribution schemes for sensor networks in which nodes are deployed in separate groups. In this paper we consider the implications of group deployment for the connectivity and resilience of a key predistribution scheme. After showing that there is a lack of flexibility in the parameters of a scheme due to Liu, Ning and Du, limiting its applicability in networks with small numbers of groups, we propose a more general scheme, based on the structure of a resolvable transversal design. We demonstrate that this scheme permits effective trade-offs between resilience, connectivity and storage requirements within a group-deployed environment as compared with other schemes in the literature, and show that group deployment can be used to increase network connectivity, without increasing storage requirements or sacrificing resilience.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2008-10-02: last updated
- 2008-10-02: published
- Short URL
- https://ia.cr/2008/412
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2008/412,
author = {Keith M. Martin and Maura B. Paterson and Douglas R. Stinson},
title = {Key Predistribution for Homogeneous Wireless Sensor Networks with Group Deployment of Nodes},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/412},
year = {2008},
url = {https://eprint.iacr.org/2008/412}
}