Eun Mi Chun , In Shil Doh , Ha Young Oh , So Young Park , Joo Young Lee , Ki Joon Chae , Sang Ho Lee , Jae Hoon Nah

The KIPS Transactions:PartC, Vol. 12, No. 4, pp. 473-480, Aug. 2005
10.3745/KIPSTC.2005.12.4.473,   PDF Download:

Abstract

We can obtain useful information by deploying large scale sensor networks in various situations. Security is also a major concern in sensor networks, and we need to establish pairwise keys between sensor nodes for secure communication. In this paper, we propose new pairwise key establishment mechanism based on clustering and polynomial sharing. In the mechanism, we divide the network field into clusters, and based on the polynomial-based key distribution mechanism, we create bivariate polynomials and assign unique polynomial to each cluster. Each pair of sensor nodes located in the same cluster can compute their own pairwise keys through assigned polynomial shares from the same polynomial. Also, in our proposed scheme, sensors, which are in each other''s transmission range and located in different clusters, can establish path key through their clusterheads. However, path key establishment can increase the network overhead. The number of the path keys and time for path key establishment of our scheme depend on the number of sensors, cluster size, sensor density and sensor transmission range. The simulation result indicates that these schemes can achieve better performance if suitable conditions are met.

Statistics
Cite this article