Minimum node degree and κ-connectivity for key predistribution schemes and distributed sensor networks

Authors:
Jiang Wu;Douglas R. Stinson
Affiliations:
University of Waterloo, Waterloo, ON, Canada;University of Waterloo, Waterloo, ON, Canada
Venue:
WiSec '08 Proceedings of the first ACM conference on Wireless network security
Year:
2008

Citing 15
Cited 0

The connectivity of the block-intersection graphs of designs

Designs, Codes and Cryptography
Random intersection graphs when m= w(n): an equivalence theorem relating the evolution of the G(n, m, p) and G(n,P/italic) models

Random Structures & Algorithms
On the minimum node degree and connectivity of a wireless multihop network

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A key-management scheme for distributed sensor networks

Proceedings of the 9th ACM conference on Computer and communications security
Random Key Predistribution Schemes for Sensor Networks

SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Combinatorial Designs: Constructions and Analysis

Combinatorial Designs: Constructions and Analysis
Revisiting random key pre-distribution schemes for wireless sensor networks

Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Connectivity properties of secure wireless sensor networks

Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Establishing pairwise keys in distributed sensor networks

ACM Transactions on Information and System Security (TISSEC)
A pairwise key predistribution scheme for wireless sensor networks

ACM Transactions on Information and System Security (TISSEC)
A key pre-distribution scheme for wireless sensor networks: merging blocks in combinatorial design

International Journal of Information Security - Special issue on ISC'05
Combinatorial design of key distribution mechanisms for wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
A canonical seed assignment model for key predistribution in wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)
On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs

ACM Transactions on Information and System Security (TISSEC)
Product construction of key distribution schemes for sensor networks

SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Connectivity is a desired property for distributed sensor networks (DSNs)secured by key predistribution schemes (KPSs). Previous research has studied whether a DSN is connected using the random graph model, but there has been no research on how strong the connectivity is. In this paper, we give results on the minimum node degree and κ-connectivity for DSNs secured by random KPSs and deterministic KPSs. As well, we use computer simulations to verify our results and validate the use of the random graph model in computing the connectivity of DSNs.