A general pairwise key predistribution scheme for wireless sensor networks |
| |
Authors: | Xiaoyu Ding Zhiping Liu Dingrong Shao |
| |
Affiliation: | (1) School of Electronics and Information Engineering, Beihang University, Beijing, 100083, China;(2) Department of Basical Courses, Zibo Vocational Institute, Zibo, 255314, Shandong, China |
| |
Abstract: | This paper develops a general hypercube-based key predistribution scheme for establishing pairwise keys between sensor nodes
using polynomials, which is parameterized by the dimension of hypercube and the Hamming distance threshold variables. The
scheme addresses the weaknesses of existing key predistribution schemes, which have either worse security or lower efficiency.
It exhibits a nice property—when the Hamming distance between any two neighboring sensor nodes is less than the pre-defined
threshold, the pairwise key can be established directly. Extensive performance and security analysis shows that by increasing
Hamming distance threshold value, we can trade off the resilience against node capture attack for higher probability of direct
pairwise key establishment, so as to save the energy consumption which is the most important issue for sensor networks.
Biography: DING Xiaoyu(1977–), male, Ph.D. candidate, research direction: information security. |
| |
Keywords: | pairwise key establishment sensor networks hypercube-based key predistribution polynomial Hamming distance |
本文献已被 维普 SpringerLink 等数据库收录! |
|