Di Pietro R., Mancini L. V., Mei A., Panconesi A., Radhakrishnan J.
Data structures.Graphs and networks
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.
Source: 2nd ACM workshop on Security of ad hoc and sensor networks, pp. 53–58, Washington, US, October 2004
Publisher: ACM Press, New York, USA
@inproceedings{oai:it.cnr:prodotti:91062, title = {Connectivity properties of secure wireless sensor networks}, author = {Di Pietro R. and Mancini L. V. and Mei A. and Panconesi A. and Radhakrishnan J.}, publisher = {ACM Press, New York, USA}, booktitle = {2nd ACM workshop on Security of ad hoc and sensor networks, pp. 53–58, Washington, US, October 2004}, year = {2004} }