Abstract

Security schemes of pairwise key establishment, which enable sensors to communicate with each other se-curely, play a fundamental role in research on security issue in wireless sensor networks. A general frame-work for key predistribution is presented, based on the idea of KDC (Key Distribution Center) and polyno-mial pool schemes. By utilizing nice properties of H2 (Hierarchical Hypercube) model, a new security mechanism for key predistribution based on such model is also proposed. Furthermore, the working per-formance of tolerance resistance is seriously inspected in this paper. Theoretic analysis and experimental fig-ures show that the algorithm addressed in this paper has better performance and provides higher possibilities for sensor to establish pairwise key, compared with previous related works.

Highlights

  • The security issue in wireless sensor networks has become research focus because of their tremendous application available in military as well as civilian areas

  • Liu et al [3] developed the idea addressed in previous works and proposed a general framework of polynomial pool-based key predistribution

  • In order to improve possibilities of direct pairwise key establishment, and depress communication overhead on indirect key establishment, we propose a H2 (Hierarchical Hypercube) framework, combined with a new key predistribution scheme

Read more

Summary

Introduction

The security issue in wireless sensor networks has become research focus because of their tremendous application available in military as well as civilian areas. Liu et al [3] developed the idea addressed in previous works and proposed a general framework of polynomial pool-based key predistribution. Based on such a framework, they presented random subset assignment and hypercube-based assignment for key predistribution. It still requires further research on key predistribution because of deficiencies existent in those previous works. Though the hypercubebased assignment can make sure that there exist a key path, the possibilities of direct pairwise key establishment are not perfect, leading to large communication overhead. The schemes has better working performance on probabilities of pairwise key establishment between any two sensors

Notations and Definitions
Polynomial-based Key Predistribution
Random Subset Assignment and Hypercube-Based Assignment
Pairwise Key Establishment Scheme Based on H2 Model
Polynomial Pool Generation and Key Predistribution
Direct Key Establishment
Indirect Key Establishment
Dynamic Key Path Establishment
Relative Definitions of Local Weak Connectivity Definition 6
Global Connectivity of Local-Weak-Connected Hypercube
Feasibilities of the Algorithm
Overhead Analysis
The Probability of Pairwise Key Re-estab-lishment
Findings
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call