Earticle

초록

영어

To establish pairwise keys for each pair of neighboring sensor nodes is a basic service, forming the basis other security services, such as authentication and encrypted in wireless sensor networks (WSNs). However, due to constrained energy, memory, and computational capabilities of sensor nodes to establish the pairwise key is challenging task. Here, a combination of polynomial pool-based and the probabilistic key predistribution scheme for WSN is presented. In the proposed scheme part of sensor nodes are pre-loaded polynomial shares, and the polynomial shares are used to compute the keys which make up a key pool. And the rest of sensor nodes are preloaded the keys selected from this key pool. The proposed scheme is analyzed based on connectivity, resistance against attacks, memory consumption and communication overhead. And the simulation results show that the proposed scheme performs better in terms of network resilience to node capture compared to the existing schemes.

목차

Abstract
 1. Introduction
  1.1 Contributions and Organizations
  1.2 Selected Related Work
 2. Overview of the Polynomial-based Key Predistribution Scheme
 3. The Proposed Scheme
  3.1 Preliminaries
  3.2 Key Predistribution Scheme
 4. Performance Analysis
  4.1 Overhead
  4.2. Local Connectivity
  4.3. Security Analysis
 5. Conclusion
 References

키워드

저자

• Jianmin Zhang [ College of Computer, Henan Institute of Engineering Zhengzhou 451191, China ]
• Qingmin Cui [ College of Computer, Henan Institute of Engineering Zhengzhou 451191, China ]
• Rui Yang [ College of Science, Henan Institute of Engineering Zhengzhou 451191, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605