Secure k-connectivity properties of wireless sensor networks

Wei Law Yee, Li-Hsing Yen, Roberto Di Pietro, Marimuthu Palaniswami

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

11 Scopus citations

Abstract

A k-connected wireless sensor network (WSN) allows messages to be routed via one (or more) of at least k node-disjoint paths, so that even if some nodes along one of the paths fail, or are compromised, the other paths can still be used. This is a much desired feature in fault tolerance and security. k-connectivity in this context is largely a well-studied subject. When we apply the random key predistribution scheme to secure a WSN however, and only consider the paths consisting entirely of secure (encrypted and/or authenticated) links, we are concerned with the secure k-connectivity of the WSN. This notion of secure k-connectivity is relatively new and no results are yet available. The random key pre-distribution scheme has two important parameters: the key ring size and the key pool mechsize. While it has been determined before the relation between these parameters and 1-connectivity, our work in k-connectivity is new. Using a recently introduced random graph model called kryptograph, we derive mathematical formulae to estimate the asymptotic probability of a WSN being securely k-connected, and the expected secure k-connectivity, as a function of the key ring size and the key pool size. Finally, our theoretical findings are supported by simulation results.

Original languageEnglish
Title of host publication2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS
DOIs
StatePublished - 1 Dec 2007
Event2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS - Pisa, Italy
Duration: 8 Oct 200711 Oct 2007

Publication series

Name2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS

Conference

Conference2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS
CountryItaly
CityPisa
Period8/10/0711/10/07

Fingerprint Dive into the research topics of 'Secure k-connectivity properties of wireless sensor networks'. Together they form a unique fingerprint.

  • Cite this

    Yee, W. L., Yen, L-H., Di Pietro, R., & Palaniswami, M. (2007). Secure k-connectivity properties of wireless sensor networks. In 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS [4428764] (2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS). https://doi.org/10.1109/MOBHOC.2007.4428764