Paper Info
Title
Revisiting random key pre-distribution schemes for wireless sensor networks
Abstract
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techniques, such as public key cryptography or key distribution center (e.g., Kerberos), are often not effective. To solve this problem, several key pre-distribution schemes have been proposed for sensor networks based on random graph theory. In these schemes, a set of randomly chosen keys or secret information is pre-distributed to each sensor node and a network is securely formed based on this information. Most of the schemes assumed that the underlying physical network is dense enough, that is, the degree of each node is hig. In this paper, we revisit the random graph theory and use giant component theory by Erdos and Renyi to show that even if the node degree is small, most of the nodes in the network can be connected. Further, we use this fact to analyze the Eschenhauer et. al's, Du et. al's, and Chan et. al's key pre-distribution schemes and evaluate the relation between connectivity, memory size, and security. We show that we can reduce the amount of memory required or improve security by trading-off a very small number of isolated nodes. Our simulation results show that the communication overhead does not increase significantly even after reducing the node degree. In addition, we present an approach by which nodes can dynamically adjust their transmission power to establish secure links with the targeted networked neighbors. Finally, we propose an effcient path-key identification algorithm and compare it with the existing scheme.
Year
DOI
Venue
2004
10.1145/1029102.1029111
SASN
Keywords
Field
DocType
isolated node,sensor node,wireless sensor network,random key pre-distribution scheme,public key cryptography,key management,sensor network,traditional key management technique,key distribution center,key pre-distribution scheme,random graph theory,node degree,wireless sensor networks,random graph,giant component
Key distribution,Key management,Sensor node,Key distribution in wireless sensor networks,Computer science,Computer network,Key distribution center,Mobile wireless sensor network,Public-key cryptography,Wireless sensor network,Distributed computing
Conference
ISBN
Citations 
PageRank 
1-58113-972-1
100
4.09
References 
Authors
14
2
Name
Order
Citations
PageRank
Joengmin Hwang119310.09
Yongdae Kim21944125.44