Connectivity preservation and key distribution in wireless sensor networks using multi-deployment scheme

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Secure key establishment in wireless sensor networks has been shown to be efficient. For sake of computation power, pre-distribution of symmetric keys is recommended. In such schemes, a set S of keys is used and each deployed node knows a subset of S. However, the capture of nodes can quickly lead to the corruption of a significant part of the network and solutions like multi-deployment have been proposed. In multi-deployment schemes, sets of nodes - using different key sets - are sequentially deployed that limits the impact of the capture of nodes. In this paper, we consider the problem of connectivity of single deployment in regards to the size of key sets. We show that connectivity guaranteed solutions lead to network vulnerability when nodes are captured. Then we evaluate network robustness of different schemes. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Simplot-Ryl, D., & Simplot-Ryl, I. (2006). Connectivity preservation and key distribution in wireless sensor networks using multi-deployment scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4159 LNCS, pp. 988–997). Springer Verlag. https://doi.org/10.1007/11833529_100

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free