无线SensorNetworks中密钥预分配优化的图论方法
A Graph Theoretic Approach for Optimizing Key Pre-distribution in Wireless SensorNetworks
摘要：
在无线传感器网络中，为密钥预分配方案找到最优的密钥分配（在给定的约束条件下）是一项困难的任务。因此，大多数实际方案都是基于概率密钥分配，这导致次优方案需要密钥存储在节点总数中是线性的。引入图论框架研究无线传感器网络密钥预分配方案中密钥存储、平均密钥路径长度（与电池消耗直接相关）和弹性（对受损节点）之间的基本权衡。基于所提出的框架，一个下界的密钥存储推导出一个给定的平均密钥路径长度。给出了妥协概率的一个上界。这个框架也导致设计的密钥分配方案的存储复杂性相同的顺序作为下限。
英文摘要：
Finding an optimal key assignment (subject to given constraints) for a key predistribution scheme in wireless sensor networks is a difficult task. Hence, most of the practical schemes are based on probabilistic key assignment, which leads to sub-optimal schemes requiring key storage linear in the total number of nodes. A graph theoretic framework is introduced to study the fundamental tradeoffs between key storage, average key path length (directly related to the battery consumption) and resilience (to compromised nodes) of key predistribution schemes for wireless sensor networks. Based on the proposed framework, a lower bound on key storage is derived for a given average key path length. An upper bound on the compromising probability is also given. This framework also leads to the design of key assignment schemes with a storage complexity of the same order as the lower bound.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
