北京航空航天大学学报 ›› 2009, Vol. 35 ›› Issue (9): 1080-1082.

• 论文 • 上一篇    下一篇

新的传感器网络对偶密钥预分配方案

丁晓宇, 刘建伟, 邵定蓉   

  1. 北京航空航天大学 电子信息工程学院, 北京 100191
  • 收稿日期:2008-07-15 出版日期:2009-09-30 发布日期:2010-09-14
  • 作者简介:丁晓宇(1976-),男,河南洛阳人,博士生,ding_xiao_yu@163.com.
  • 基金资助:

    国家863基金资助项目(2006AA01Z422);国家自然科学基金资助项目(60672102)

New pairwise key predistribution scheme for wireless sensor networks

Ding Xiaoyu, Liu Jianwei, Shao Dingrong   

  1. School of Electronics and Information Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100191, China
  • Received:2008-07-15 Online:2009-09-30 Published:2010-09-14

摘要: 提出了一种新的基于超立方体和多项式的对偶密钥预分配方案,此方案以超立方体的维度和传感器节点编码的汉明距离为参数.方案具有如下特性:当任意两个邻居传感器节点间的汉明距离小于预先设定的门限值时,可以直接建立对偶密钥.该方案的创新在于将传感器节点间的汉明距离参数化,解决了以往方案只能在汉明距离为1时才能直接建立对偶密钥的限制,经过安全和性能的分析说明,当汉明距离门限值增大时,方案通过牺牲抗节点俘获能力可以提高直接对偶密钥建立概率,从而节省了对于传感器网络来说十分重要的能量消耗.

Abstract: A new 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 was developed. This scheme 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. The scheme is typical for the innovation that the Hamming distance threshold is parameterized which solves the constraint in previous schemes that any two neighboring nodes can establish pairwise key only when the Hamming distance is one. Extensive performance and security analysis shows that by increasing Hamming distance threshold value, the resilience against node capture attack for higher probability of direct pairwise key establishment can be traded off, so as to save the energy consumption which is the most important issue for sensor networks.

中图分类号: 


版权所有 © 《北京航空航天大学学报》编辑部
通讯地址:北京市海淀区学院路37号 北京航空航天大学学报编辑部 邮编:100191 E-mail:jbuaa@buaa.edu.cn
本系统由北京玛格泰克科技发展有限公司设计开发