Expander Graph based Key Distribution Mechanisms in Wireless Sensor Networks
Expander Graph based Key Distribution Mechanisms in Wireless Sensor Networks
复制标题
无线传感器网络中基于扩展图的密钥分发机制
DOI：
10.1109/icc.2006.255107
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
M. Yung
中科院分区：
文献类型：
--
作者：
S. Çamtepe;B. Yener;M. Yung
大量随机分布在敌方区域的传感器节点之间的安全通信，需要高效的密钥分发方案。然而，由于传感器节点的资源有限，这样的方案不能基于部署后的计算。相反，成对(对称)密钥需要通过分配密钥列表(也称为密钥链)发送到每个传感器节点。如果一对节点在部署后没有公共密钥，则它们必须找到具有安全链接的密钥路径。其目标是最小化密钥链的大小，同时(I)最大化成对密钥共享概率和弹性，(Ii)最小化平均密钥路径长度。提出了一种基于扩展图的确定性密钥分发方案。它展示了如何将Ramanujan Expander图的参数(例如，度、扩展和直径)映射到物理网络拓扑的密钥分发方案的所需属性。
Secure communications between large number of sensor nodes that are randomly scattered over a hostile territory, necessitate efficient key distribution schemes. However, due to limited resources at sensor nodes such schemes cannot be based on post deployment computations. Instead, pairwise (symmetric) keys are required to be pre-distributed by assigning a list of keys, (a.k.a. key-chain), to each sensor node. If a pair of nodes does not have a common key after deployment then they must find a key-path with secured links. The objective is to minimize the keychain size while (i) maximizing pairwise key sharing probability and resilience, and (ii) minimizing average key-path length. This paper presents a deterministic key distribution scheme based on Expander Graphs. It shows how to map the parameters (e.g., degree, expansion, and diameter) of a Ramanujan Expander Graph to the desired properties of a key distribution scheme for a physical network topology.