earticle

논문검색

Key Distribution using Double Keyed-hash Chains for Wireless Sensor Networks

초록

영어

As a security primitive, key establishment plays the most crucial role in the designing of the security mechanism in the wireless sensor networks (WSNs). Unfortunately, the resource limitation of sensor nodes poses a great challenge for designing an efficient and effective key establishment scheme for WSNs. In this paper, we propose an effective key predistribution scheme using double keyed-hash chain schemes. In the proposed scheme, there are two key pools: upward key pools and downward key pools, and the key ring in each sensor is picked from these two key pools. The proposed scheme is analyzed based on connectivity, resistance against attacks, memory consumption and communication overhead. Comparing with the EG scheme and the q-composite scheme, our scheme performs better in terms of network resilience to node capture with little additional overhead cost.

목차

Abstract
 1. Introduction
 2. Selected Related Work
 3. The Proposed Scheme
  3.1. Key Predistribution Phase
  3.2. Pairwise Key Establishment Phase
 4. Performance Analysis
  4.1. Local Connectivity
  4.2. Resilience against Node Capture
  4.3. Memory Usage and Communication Overhead
 5. Conclusion
 Acknowledgement
 References

저자정보

  • Jianmin Zhang College of Computer, Henan Institute of Engineering
  • Jianwei Tan Department of Information Security, Henan Police College
  • Jian Li College of Computer, Henan Institute of Engineering

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.