Key predistribution schemes for distributed sensor networks via block designs
From MaRDI portal
Publication:1936501
DOI10.1007/S10623-011-9590-1zbMath1261.94043arXiv1108.0243OpenAlexW2088070135MaRDI QIDQ1936501
Rahul Mukerjee, Mausumi Bose, Aloke Dey
Publication date: 5 February 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.0243
association schemelocal connectivitybalanced incomplete block designresiliencykey predistribution schemesdual design
Combinatorial aspects of block designs (05B05) Combinatorics in computer science (68R05) Applications of design theory to circuits and networks (94C30)
Related Items (2)
Key Predistribution Schemes Using Bent Functions in Distributed Sensor Networks ⋮ A unified approach to combinatorial key predistribution schemes for sensor networks
Cites Work
- A unified approach to combinatorial key predistribution schemes for sensor networks
- Incomplete Block Designs
- A Key Predistribution Scheme Based on 3-Designs
- Key Predistribution Schemes Using Codes in Wireless Sensor Networks
- Combinatorial Designs
- Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks
- On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks
- Selected Areas in Cryptography
- Unnamed Item
- Unnamed Item
This page was built for publication: Key predistribution schemes for distributed sensor networks via block designs