Joengmin Hwang
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.
- ͘amps: ͘-adaptive multi-domain power aware sensors. http: //www-mtl.mit.edu/research/icsystems/uamps.Google Scholar
- Wireless integrated network sensors, ucla. http://www.janet.ucla.edu/WINS.Google Scholar
- N. Alon and J. Spencer. The probabilistic method. In Wiley-Interscience, 2000.Google ScholarCross Ref
- R. Blom. An optimal class of symmetric key generation systems. In EUROCRYPT 84, 1985. Google ScholarDigital Library
- C. Blundo, A. D. Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung. Perfectly-secure key distribution for dynamic conferences. In Crypto, 1992. Google ScholarDigital Library
- H. Chan, A. Perrig, and D. Song. Random key predistribution schemes for sensor networks. In IEEE Symposium on Research in Security and Privacy, 2003. Google ScholarDigital Library
- W. Du, J. Deng, Y. S. Han, S. Chen, and P. K. Varshney. A key management scheme for wireless sensor networks using deployment knowledge. In Conference of the IEEE Communications Society (Infocom), 2004.Google Scholar
- W. Du, J. Deng, Y. S. Han, and P. K. Varshney. A pairwise key pre-distribution scheme for wireless sensor networks. In ACM Conference on Computer and Communications Security (CCS), 2003. Google ScholarDigital Library
- P. Erdös and A. Rényi. On the evolution of random graph. Institute of Mathematics Hungarian Academy of Sciences, 1959.Google Scholar
- L. Eschenauer and V. D. Gligor. A key-management scheme for distributed sensor networks. In ACM Conference on Computer and communication Security (CCS), 2004. Google ScholarDigital Library
- T. Hou and V. Li. Transmission range control in multihop packet radio networks. In IEEE Transaction on Communications, 1986.Google Scholar
- S. Janson, T. Luczak, and A. Rucinski. Random Graphs. Wiley, 2000.Google ScholarCross Ref
- J. M. Kahn, R. H. Katz, and K. S. J. Pister. Next century challenges: Mobile networking for smart dust. In Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), 1999. Google ScholarDigital Library
- L. Kleinrock and J. Silvester. Optimum transmission radii for packet radio networks or why six is a magic number. In IEEE National Telecommunication Conference, 1978.Google Scholar
- D. Liu and P. Ning. Establishing pairwise keys in distributed sensor networks. In ACM Conference on Computer and Communications Security (CCS), 2003. Google ScholarDigital Library
- A. M. R. D. Pietro and L. V. Mancini. Efficient and resilient key discovery based on pseudo-random key pre-deployment. In 4th IEEE Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks, 2004.Google Scholar
- J. Spencer. The strange logic of random graphs. In Algorithms and Combinatorics, 2000. Google ScholarDigital Library
- H. Takagi and L. Kleinrock. Optimal transmission ranges for randomly distributed packet radio terminals. In IEEE Transaction on Communications, 1984.Google Scholar
- D. D. Wentzloff, B. H. Calhoun, R. Min, A. Wang, and N. Ickes. Design considerations for next generation wireless power-aware microsensor nodes. In International Conference on VLSI Design, 2004. Google ScholarDigital Library
- F. Xue and P. R. Kumar. The number of neighbors needed for connectivity of wireless networks. In Wireless Networks, 2004. Google ScholarDigital Library
- S. Zhu, S. Setia, and S. Jajodia. Leap: Efficient security mechanisms for large-scale distributed sensor networks. In 10th ACM Conference on Computer and Communication Security (CCS), 2003. Google ScholarDigital Library
Index Terms
- Revisiting random key pre-distribution schemes for wireless sensor networks
Recommendations
A pairwise key pre-distribution scheme for wireless sensor networks
CCS '03: Proceedings of the 10th ACM conference on Computer and communications securityTo achieve security in wireless sensor networks, it is important to be able to encrypt and authenticate messages sent among sensor nodes. Keys for encryption and authentication purposes must be agreed upon by communicating nodes. Due to resource ...
Combinatorial Design Based Key Pre-distribution Scheme with High Scalability and Minimal Storage for Wireless Sensor Networks
AbstractGiven the sensitivity of applications and the sensor node’s resource constraints, key management is an important security concern in Wireless Sensor Networks (WSNs). Combinatorial Design based schemes are used to propose key pre-distribution in ...
A Random Key Management Scheme for Wireless Sensor Networks
WASA '08: Proceedings of the Third International Conference on Wireless Algorithms, Systems, and ApplicationsThe establishment of shared keys between communicating neighbor nodes in wireless sensor networks is a challenge due to resource-constrained sensor networks. Several key pre-distribution schemes have been proposed in literatures to establish pairwise ...
Comments