N-dimensional grid-based key predistribution in wireless sensor networks

  • Authors:
  • Jong-Myoung Kim;Young-Ju Han;Seon-Ho Park;Tai-Myoung Chung

  • Affiliations:
  • Internet Management Technology Laboratory, Department of Electrical and Computer Engineering, School of Information and Communication Engineering, Sungkyunkwan University, Suwon-si, Gyeonggi-do, R ...;Internet Management Technology Laboratory, Department of Electrical and Computer Engineering, School of Information and Communication Engineering, Sungkyunkwan University, Suwon-si, Gyeonggi-do, R ...;Internet Management Technology Laboratory, Department of Electrical and Computer Engineering, School of Information and Communication Engineering, Sungkyunkwan University, Suwon-si, Gyeonggi-do, R ...;Internet Management Technology Laboratory, Department of Electrical and Computer Engineering, School of Information and Communication Engineering, Sungkyunkwan University, Suwon-si, Gyeonggi-do, R ...

  • Venue:
  • ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Security service is one of the fundamental elements required to realize the wireless sensor networks. To distribute key in WSNs, the predistribution technique is commonly used, because the traditional cryptography techniques such as public key cryptography and key distribution center (KDC) are impractical to be applied in the WSNs due to resource constraints of sensor node. The most common technique in famous predistribution schemes is random key predistribution scheme which use probability method. The random key predistribution scheme has a demerit that heavy overhead is occurred on establishing a path key. To reduce the overhead, the grid-based key predistribution scheme was proposed. They uses t-degree bivariate polynomial keys and 2-dimensional grid to provide good properties such as good resilience against the node compromise, high probability of establishing a pairwise key and the minimized overhead on establishing a path key. We extend the dimension of the grid-based key predistribution scheme which is more efficient than other existing schemes. Our scheme improves many properties, except the resilience, of the grid-based key predistribution scheme. So, we introduce n-dimensional grid-based key predistribution using group based deployment as one of methods which can enhance the resilience. Through a mathematical model, we show that our scheme is more efficient than other existing schemes including 2-dimensional grid-based scheme.