Paper Info
Title
A key-management scheme for distributed sensor networks
Abstract
Distributed Sensor Networks (DSNs) are ad-hoc mobile networks that include sensor nodes with limited computation and communication capabilities. DSNs are dynamic in the sense that they allow addition and deletion of sensor nodes after deployment to grow the network or replace failing and unreliable nodes. DSNs may be deployed in hostile areas where communication is monitored and nodes are subject to capture and surreptitious use by an adversary. Hence DSNs require cryptographic protection of communications, sensor-capture detection, key revocation and sensor disabling. In this paper, we present a key-management scheme designed to satisfy both operational and security requirements of DSNs. The scheme includes selective distribution and revocation of keys to sensor nodes as well as node re-keying without substantial computation and communication capabilities. It relies on probabilistic key sharing among the nodes of a random graph and uses simple protocols for shared-key discovery and path-key establishment, and for key revocation, re-keying, and incremental addition of nodes. The security and network connectivity characteristics supported by the key-management scheme are discussed and simulation experiments presented.
Year
DOI
Venue
2002
10.1145/586110.586117
ACM Conference on Computer and Communications Security
Keywords
Field
DocType
sensor networks,sensor network,simulation experiment,random graph,satisfiability,key management,mobile network,random graphs
Key management,Key distribution in wireless sensor networks,Route filtering,Computer security,Computer science,Cryptography,Computer network,Revocation,Probabilistic logic,Mobile wireless sensor network,Wireless sensor network,Distributed computing
Conference
ISBN
Citations 
PageRank 
1-58113-612-9
1637
92.62
References 
Authors
7
2
Search Limit
1001000
Name
Order
Citations
PageRank
Laurent Eschenauer1173698.99
Virgil D. Gligor24133513.94