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. Copyright 2004 ACM.
Original language | English (US) |
---|---|
Title of host publication | Proceedings of the 2004 ACM Workshop on Security of Ad Hoc and Sensor Networks, SASN'04 |
Publisher | Association for Computing Machinery (ACM) |
Pages | 53-58 |
Number of pages | 6 |
ISBN (Print) | 1581139721 |
DOIs | |
State | Published - Jan 1 2004 |
Externally published | Yes |