Connectivity properties of secure wireless sensor networks

Authors:
Roberto Di Pietro;Luigi V. Mancini;Alessandro Mei;Alessandro Panconesi;Jaikumar Radhakrishnan
Affiliations:
University of Rome "La Sapienza", Italy;University of Rome "La Sapienza", Italy;University of Rome "La Sapienza", Italy;University of Rome "La Sapienza", Italy;Tata Institute of Fundamental Research, Bombay, India
Venue:
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Year:
2004

Citing 9
Cited 8

An optimal class of symmetric key generation systems

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
On k-connectivity for a geometric random graph

Random Structures & Algorithms
Secure pebblenets

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
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
Perfectly-Secure Key Distribution for Dynamic Conferences

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Random Key Predistribution Schemes for Sensor Networks

SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
A pairwise key pre-distribution scheme for wireless sensor networks

Proceedings of the 10th ACM conference on Computer and communications security
Establishing pairwise keys in distributed sensor networks

Proceedings of the 10th ACM conference on Computer and communications security

Energy efficient node-to-node authentication and communication confidentiality in wireless sensor networks

Wireless Networks
A randomized, efficient, and distributed protocol for the detection of node replication attacks in wireless sensor networks

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Redoubtable Sensor Networks

ACM Transactions on Information and System Security (TISSEC)
Minimum node degree and κ-connectivity for key predistribution schemes and distributed sensor networks

WiSec '08 Proceedings of the first ACM conference on Wireless network security
Distributed data source verification in wireless sensor networks

Information Fusion
Key management for mobile sensor networks

MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
On optimality of key pre-distribution schemes for distributed sensor networks

ESAS'06 Proceedings of the Third European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Expansion properties of (secure) wireless networks

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the problem of connectivity in Secure Wireless Sensor Networks (SWSN) using random pre-distribution of keys. We propose a geometric random model for SWSNs. Under this new and realistic model, we describe how to design secure and connected networks using a small constant number of keys per sensor. Extensive simulations support the above stated result and demonstrate how connectivity can be guaranteed for a wide interval of practical network sizes and sensor communication ranges.