Research On Key Predistribution Scheme In Sensor Networks

Sensor networks are distributed wireless networks which are composed of many sensors. It is widely used in military affairs, environment monitoring, biology medical, remote control etc. It is very important to establish pairwise key between any two sensors for the secure communication in critical moniting scenario. A lot of traditional key management schemes are not suitable for sensor networks for the limited resource in sensor nodes. Nowadays, key predistribution schemes are prevalently and adopted wildly in sensor networks. And it is also the focus of this paper.Firstly, the characteristic and the research actuality of wireless sensor network are described in this paper. Secondly, the existing random-based key predistribution schemes, such as Eschenauer-Gligor scheme and Chan-Perrig -Song scheme are discussed. And the location-based key predistribution schemes, such as the closest pairwise key predistribution scheme and the gird-based pairwise key pre-distribution scheme are also analyzed. Finally, this paper presents three new key predistribution schemes based on the analysis above and the purpose of improving the probability of establish pairwise key and resilient. The first scheme is the hexagon-based key predistribuiton scheme which utilizes the hexagonal model and the expected deployment location of sensor nodes. The second scheme is the group-based key predistribution scheme which constructed by group-based deployment model before node deployment. The last scheme is the matrix-based key predistribution scheme which combined by the Blom matrix and the location information of sensor nodes. The analyses to these schemes are also provided at the same time as the description of their implement. At the end of this paper, the performance analysis and the existing problem are also provided, which offers the valuableexperience for the future research.