Connectivity properties of secure wireless sensor networks

Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

51 Scopus citations


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. Copyright 2004 ACM.
Original languageEnglish (US)
Title of host publicationProceedings of the 2004 ACM Workshop on Security of Ad Hoc and Sensor Networks, SASN'04
PublisherAssociation for Computing Machinery (ACM)
Number of pages6
ISBN (Print)1581139721
StatePublished - Jan 1 2004
Externally publishedYes


Dive into the research topics of 'Connectivity properties of secure wireless sensor networks'. Together they form a unique fingerprint.

Cite this