Earticle

초록

영어

As Wireless Sensor Networks (WSNs) are usually deployed in remote or even hostile environment, the adoption of security mechanism is fundamental. To achieve secure communication between sensor nodes in WSNs, it is important to establish efficient key predistribution schemes. Unfortunately, key management scheme is a challenging issue for WSNs because of the resource limitations in the sensor nodes. In this paper, we propose an efficient key management scheme for WSNs, which assigns the key spaces to sensor nodes via combinatorial design. In the scheme Finite Projective Plane is mapped to obtain efficient key distribution scheme. Connectivity, resistance against attacks, storage and communication overhead are studied analytically and computationally. Compared to related schemes, the proposed scheme performs better against compromised node attacks.

목차

Abstract
 1. Introduction
 2. Background
  2.1. Matrix-Based Key Establishment Schemes
  2.2. Basics on Combinatorial Design
 3. The Proposed Scheme
  3.1. Mapping from Finite Projective Plane to Key Space Distribution
  3.2. Details of the Proposed Scheme.
 4. Performance Analysis
  4.1. Local Connectivity
  4.2. Resilience against Node Capture
  4.3. Storage and Communication Overhead
 5. Conclusion
 References

키워드

저자

• Jianmin Zhang [ College of Computer, Henan Institute of Engineering, Zhengzhou 451191, China ]
• Xuerui Wang [ College of Computer, Henan Institute of Engineering, Zhengzhou 451191, China ]
• Jian Li [ College of Computer, Henan Institute of Engineering, Zhengzhou 451191, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605