International Journal of Education and Management Engineering (IJEME)
IJEME Vol. 2, No. 12, 29 Dec. 2012
Cover page and Table of Contents: PDF (size: 137KB)
An Efficient Key Distribution Scheme for Sensor Networks
Full Text (PDF, 137KB), PP.10-15
Views: 0 Downloads: 0
Author(s)
Mei Weng
1,*
Hongshan Qu
2
Index Terms
Wirless sensor networks, key distributiont, key pool
Abstract
Security schemes of pairwise key establishment plays a fundamental role in research on security issue in wireless sensor networks. However, establishing pairwise keys in wireless sensor networks is not a trivial task, particularly due to the resource constraints on sensors. In this paper, we prose an efficient key distribution scheme, in which each sensor node randomly selects two key pools from several different key pools and chooses keys from these key pools. The analysis shows that this proposed scheme can substantially improve the security of existing key predistribution scheme.
Cite This Paper
Mei Weng,Hongshan Qu,"An Efficient Key Distribution Scheme for Sensor Networks", IJEME, vol.2, no.12, pp.10-15, 2012. DOI: 10.5815/ijeme.2012.12.02
Reference
[1] I.F. Akyildiz, W. Su, Y. Sankarasubramanian. A survey on wireless sensor networks. IEEE Communication Magazine, 2002, 38(8): 102-114
[2] L. Eschenaure and V.D. Gligor, “A key-management scheme for distributed sensor networks”. in: Proc. of the 9the ACM Conference on Computer and Communications, Washington DC, USA, pp.41-47, Nov. 2002
[3] H. Chan, A. Perrig and D. Song, “Random key predistribution schemes for sensor networks”, in: Proc. 20003 IEEE Symposium on Security and Privacy, , May 2003, pp.197-313
[4] W.Du, J. Deng, Y.S. Han, P.K. Varshney, J. Katz, and A. Khalili, “A pairwise key predistribution schemes for sensor networks networks”. ACM Transactions on Information and System Security, Vol.8. No2,May(2005)228-258
[5] D. Liu, P. Ning, and R. Li, “Establishing pairwise keys in distributed sensor networks”. ACM Transactions on Information and System Security, vol.8, pp.41-77, Feb. 2005
[6] R. Blom, “An optimal class of symmetric key generation systems. Advance in Cryptography”. London, UK: Springer-Verlag, pp.335-338 , 1985
[7] C. Blundo, A. D. Santis, A. Herzberg. S. Jutten, U. Vaccaro, and M. Yung. “Perfectly secure key distribution for dynamic conference”, Information and Computation, vol.1, pp.1-23 , Jan. 1995
[8] S.A Campete and B.Yener, “Combintorial design of key distrbution mechanisms for wirless sensor networks”, in: Proc of Computer Security, pp.293-308, 2004.
[9] D.Sanchez and H.Baldus, “A deterministic pairwise key predistribution scheme for mobile sensor networks, “, in: Proc. of the 1st Int’s Conf. on Security and Privace for Emergin Area in Communications Networks, 2005, pp.277-288.
[10] J.Lee and D.K. Stinson, “A combinatorial approach to key predistribution for distributed sensor networks, “ in: Proc. of IEEE Wireless Communication Network Conference, 2005, pp.1200-1205
[11] J.Lee and D.K. Stinson, “On the construction of practical key predistribution schemes for distributed sensor networks using combinatorial designs,” ACM Transactions on Information and System Security.vol.11, no. 2, Article 5, 2008.
[12] J.Lee and D.K. Stinson, “Deterministic key pre-distribution schemes for distrubited sensor networks”, in:Proc. of the 11th Int’l Workshop, 2005, pp.293-307