A Lightweight of Cluster-Based Key Management Scheme for Wireless Sensor Networks

Abstract:

According to the existing problems in current key management strategy of wireless sensor networks, which have computation complexity, multi-memory space and inflexible management, this paper proposed a lightweight of cluster-based key management scheme for wireless sensor networks. Implementing the EBS(exclusive basis system) in the cluster heads communication, it could effectively enhance the ability of the resilience. Using Chinese remainder theorem in sensors communication, it will have less storage consumption, Lower communication and computational overhead. Under comparative analysis, it meets the needs of the WSNs key management and provides the better connectivity as well as the resilience compare to other key management schemes.

• Periodical: Applied Mechanics and Materials (Volumes 341-342)
• Pages: 1133-1137
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.341-342.1133
• Online since: July 2013
• Authors: Yong Lei Song, Shu Guo Cao
• Keywords: Chinese Remainder Theorem, Exclusive Basis System (EBS), Key Management, Wireless Sensor Network (WSN)

References

[1] D Akyildiz F, Su W, Sankarasubramaniam Y, Cayirci E. Wireless sensor network: A survey. Computer Networks, 2002, 38(4): 393-422.

DOI: 10.1016/s1389-1286(01)00302-4

[2] Carman DW, Kruus PS, Matt BJ. Constraints and approaches for distributed sensor security. Technical Report, #00-010, NAI Laboratories, (2000).

[3] Perrig A, Stankovic J, Wagner D. Security in wireless sensor networks. Communications of the ACM(Special Issue on Wireless Sensor Networks), 2004, 47(6): 53-57.

DOI: 10.1145/990680.990707

[4] Eschenauer L, Gligor V. A key management scheme for distributed sensor networks. In: Proc. of the 9th ACM Conf. on Computer and Communications Security. New York: ACM Press, 2002. 41-47.

DOI: 10.1145/586110.586117

[5] Chan H, Perrig A, Song D. Random key predistribution schemes for sensor networks. In: Proc. of the 2003 IEEE Symp. on Security and Privacy. Washington: IEEE Computer Society, 2003. 197-213.

[6] C. Blundo, A. D. Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung. Perfectly-secure key distribution for dynamic conferences, Lecture Notes in Computer Science, 740: 471–486, (1993).

DOI: 10.1007/3-540-48071-4_33

[7] Dong gang Liu and Peng Ning Location-Based Pair-wise Key Establishments for Relatively Static Sensor Networks, " 2003 ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN, 03), October 31, 2003 George W. Johnson Center at George Mason University, Fairfax, VA, USA.

DOI: 10.1145/986858.986869

[8] PATHANA S K, DAIT T, HONG C S. An efficient LU decomposition-based key pre-distribution scheme for ensuring security in wireless sensor networks[C] /Proc of the 6th IEEE International Conference on the Computer and Information Technology. Los Alamitos: IEEE Computer Society, 2006: 227-232.

DOI: 10.1109/cit.2006.44

[9] ZHENG Xin-liang, HUANG C T, MATTHEW S M. Chinese remainder theorem based group key management[C] /Proc of ACM SE 2007. 2007: 266-271.