A Minimum Spanning Tree Based Optimization Scheme of Collusion Restraining in Heterogeneous Sensor Networks
-
摘要: 基于EBS (Exclusion Basis Systems)的密钥管理协议,以安全性高、动态性和扩展性好,较适用于异构传感器网络,但却存在共谋问题。该文提出了一种基于MST (Minimum Spanning Tree)的密钥共谋问题优化方案。该方案利用Prim算法对由簇内感知节点所构成的无向连通图进行最小生成树求解,并对该树进行遍历,根据所得节点遍历顺序进行密钥的指派与分配,使得相邻节点间所含的密钥重叠程度增大,发生共谋的可能性得到降低。实验结果表明:同比于密钥随机分配方案与SHELL方案,所提方案有效提高了网络的抗捕获能力。
-
关键词:
- 异构传感器网络 /
- 密钥管理 /
- 共谋问题 /
- 最小生成树(MST) /
- EBS
Abstract: Owing to the better security, dynamic and extensibility, Exclusion Basis Systems (EBS) based key management applies to security of heterogeneous sensor networks, but it suffers from the collusion. This paper introduces a Minimum Spanning Tree (MST) based optimization scheme of key collusion restraining, which uses Prim algorithm to create MST from undirected graph constituted by nodes in cluster. Traversing the tree gets a sequence of nodes. The sequence is used to design and distribute keys in the scheme. It improves the repeated degrees of keys in adjacent nodes and reduces the possibility of key collusion. The experimental results show that the optimization scheme effectively improves the resistant of networks capture, comparing with SHELL and random distribution method.
计量
- 文章访问数: 2707
- HTML全文浏览量: 98
- PDF下载量: 618
- 被引次数: 0