摘要
无线传感器网络中基于规则网络的密钥预置方案具有预置开销小、寻径快等特点,但这类方案直接对偶密钥建立的概率较低。该文基于已经存在的节点连通集团,针对传感器网络对偶密钥连通图,提出层次连通框架,定义节点层次连通度,给出节点本地搜索算法。仿真结果表明该算法能提高节点的平均密钥连通度。
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.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第21期150-152,共3页
Computer Engineering
基金
国家自然科学基金资助项目(60773047)
湖南省教育厅基金资助项目(06B005)
关键词
对偶密钥
无线传感器网络
密钥连通图
pairwise key
Wireless Sensor Networks(WSN)
key-sharing graph