ID-based multiple space key pre-distribution scheme for wireless sensor networks

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

Abstract

Providing security services for wireless sensor networks plays a vital role in secure network operation especially when sensor networks are deployed in hostile areas. In order to pave the way for these mechanisms, cryptographic keys must be agreed on by communicating nodes. Unfortunately, due to resource constraints, the key agreement problem in wireless sensor networks becomes quite intricate. To deal with this problem, many public-key unrelated proposals have been proposed so far. One prominent branch of these proposals is based on random key pre-distribution. Inspired by this trend, in this paper, we propose a new random key pre-distribution scheme that is comparable to Du et al.'s scheme [2] in terms of network resiliency and memory usage. On the other hand, our later analysis shows that our scheme outperforms Du et al.'s scheme in terms of computational and communication overhead. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Dai, T. T., & Hong, C. S. (2007). ID-based multiple space key pre-distribution scheme for wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4517 LNCS, pp. 235–246). Springer Verlag. https://doi.org/10.1007/978-3-540-72697-5_20

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