A General Pairwise Key Predistribution Scheme for Wireless Sensor Networks  

作　　者：DING Xiaoyu LIU Zhiping SHAO Dingrong 

机构地区：[1]School of Electronics and Information Engineering, Beihang University, Beijing 100083, China [2]Department of Basical Courses, Zibo Vocational Institute, Zibo 255314, Shandong, China

出　　处：《Wuhan University Journal of Natural Sciences》2008年第6期744-748,共5页武汉大学学报（自然科学英文版）

基　　金：Supported by the National High-Technology Research and Development Program of China (863 Program)(2006AA01Z422);the National Natural Science Foundation of China(60672102)

摘　　要：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.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.

关 键 词：pairwise key establishment sensor networks hypercube-based key predistribution POLYNOMIAL Hamming distance 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]