Tree-based key predistribution for wireless sensor networks

The establishment of secure links between neighboring nodes is one of the most challenging problems in wireless sensor networks. In this article, we present an efficient key predistribution scheme for sensor networks such that pairwise keys are defined by iterated hash computations based on a tree s...

Full description

Saved in:
Bibliographic Details
Published in:Wireless networks 2009-11, Vol.15 (8), p.1140-1151
Main Authors: Lee, Jooyoung, Kwon, Daesung
Format: Article
Language:English
Subjects:
Communications Engineering
Computer Communication Networks
Electrical Engineering
Engineering
IT in Business
Network security
Networks
Performance evaluation
Sensors
Studies
Wireless communications
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The establishment of secure links between neighboring nodes is one of the most challenging problems in wireless sensor networks. In this article, we present an efficient key predistribution scheme for sensor networks such that pairwise keys are defined by iterated hash computations based on a tree structure. Our scheme can be regarded as an improvement of HARPS, Ramkumar and Memon (IEEE J Sel Area Commun 23(3):611–621, 2005),or a generalization of Leighton and Micali’s scheme (Lect Notes Comput Sci 773:456–479, 1994). We rigorously analyze our scheme focusing on the resiliency of the network and hash computational complexity for each node and compare the performance with existing schemes. Specifically, we show that our scheme provides stronger resiliency and requires less hash computational complexity than HARPS.
ISSN:1022-0038
1572-8196
DOI:10.1007/s11276-008-0108-3