Hierarchical Hypercube Based Pairwise Key Establishment Scheme for Sensor Networks
- 1 Department of Computer Science, Lakehead University, Thunder Bay, Canada
Abstract
Security schemes of pairwise key establishment, which enable sensors to communicate with each other se-curely, play a fundamental role in research on security issue in wireless sensor networks. A general frame-work for key predistribution is presented, based on the idea of KDC (Key Distribution Center) and polyno-mial pool schemes. By utilizing nice properties of H2 (Hierarchical Hypercube) model, a new security mechanism for key predistribution based on such model is also proposed. Furthermore, the working per-formance of tolerance resistance is seriously inspected in this paper. Theoretic analysis and experimental fig-ures show that the algorithm addressed in this paper has better performance and provides higher possibilities for sensor to establish pairwise key, compared with previous related works.
- L. Eeschnaure and V. D. Gligor, “A key-management scheme for distributed sensor networks,” in proceedings of the 9th ACM Conference on Computer and Commu-nication Security, pp. 41-47, 2002.
- H. Chan, A. Oerrig, and D. Song, “Random key predis-tribution schemes for sensor networks,” in IEEE Sypo-sium on Research in Security and Privacy, pp. 197-213, 2003.
- D. G. Liu, P. Ning, and R. F. Li, “Establishing pairwise keys in distributed sensor networks,” ACM Journal Name, Vol. 20, pp. 1-35, 2004.
- C. Blundo, A. Desantis, S. Kutten, et al., “Perfectly secure key distribution for dynamic conferences,” in Advances in Cryptology-CRYPTO’92, LNCS, 740, pp. 471-486, 1993.
- L. Wang and Y. P. Lin, “Maximum safety-path matrices based fault-tolerant routing for hypercube multi-com-puters,” Journal of Software, Vol. 15, No. 7, pp. 994-1004, 2004.
- L. Wang and Y. P. Lin, “A fault-tolerant routing strategy based on maximum safety-path vectors for hypercube multi-computers,” Journal of China Institute of Commu-nications, Vol. 16, No. 4, pp. 130-137, 2004.