作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (21): 150-152. doi: 10.3969/j.issn.1000-3428.2008.21.054

• 安全技术 • 上一篇    下一篇

WSN的对偶密钥路径本地搜索算法

李 平1,2,林亚平2,吴佳英1   

  1. (1. 长沙理工大学计算机与通信工程学院,长沙 410076;2. 湖南大学计算机与通信学院,长沙 410082)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-11-05 发布日期:2008-11-05

Localized Searching Algorithm of Pairwise Key Path in WSN

LI Ping1,2, LIN Ya-ping2, WU Jia-ying1   

  1. (1. School of Computer and Telecommunications Engineering, Changsha University of Science and Technology, Changsha 410076; 2. College of Computer and Communications, Hunan University, Changsha 410082)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-11-05 Published:2008-11-05

摘要: 无线传感器网络中基于规则网络的密钥预置方案具有预置开销小、寻径快等特点,但这类方案直接对偶密钥建立的概率较低。该文基于已经存在的节点连通集团,针对传感器网络对偶密钥连通图,提出层次连通框架,定义节点层次连通度,给出节点本地搜索算法。仿真结果表明该算法能提高节点的平均密钥连通度。

关键词: 对偶密钥, 无线传感器网络, 密钥连通图

Abstract: Key pre-distribution schemes based on regular network such as hypercube have several advantages in Wireless Sensor Networks(WSN). Examples are lower storage cost and able to find a proper key path more quickly. However, the probabillity to establish direct keys is fairly low in hypercube-based key pre-distribution. Based on available connected components, the framework of hierarchical connectivity is presented in key-sharing graph of sensor networks. The definition of node’s hierarchical degree is included, and also localized searching algorithm is proposed. Experiments show that presented algorithm do improve node’s average key-sharing degree.

Key words: pairwise key, Wireless Sensor Networks(WSN), key-sharing graph

中图分类号: