CIF: Small: Designing Secure, Reliable, and Resilient Wireless Sensor Networks

无线传感器网络(WSN)是小型传感器节点的分布式集合，在广泛的工业、家庭和商业应用中收集安全敏感数据并控制安全关键操作。它们的众多应用，包括那些关系到国家的应用？S安全、医疗保健系统，以及监测和保护自然景观，显然将无线传感器网络的稳健运行置于对我们的社会至关重要的技术的核心。使用随机图理论中的高级工具，本项目开发了设计无线传感器网络的方法，这些方法i)安全；ii)可靠地抵抗传感器和链路故障；iii)对对手攻击具有弹性。该研究计划得到了几项教育和推广活动的支持，包括开发新课程、K-12推广以及向学术和工业受众传播研究成果。为了确保WSN的安全、可靠和弹性运行，调查人员考虑使用随机密钥预分发方案并开发条件，使网络i)是k-连接的；ii)在不可攻击性和不可分割性意义上对节点捕获攻击具有弹性。这是通过开发安全无线传感器网络的现实模型来实现的，该模型由两个随机图相交而成：由随机密钥预分配方案产生的密码图和由无线通信介质和传感器的随机部署引起的通信图。对于几种经典的随机密钥预分配方案和无线通信模型，研究人员发展了(I)k-连通性的零一定律；(Ii)泊松近似结果以获得k-连通性的渐近概率；(Iii)确保网络不可攻击性和不可分割性的网络参数条件(例如，节点数量、链路故障概率、每节点密钥数量、密钥池大小)。

Wireless sensor networks (WSNs) are distributed collection of small sensor nodes that gather security-sensitive data and control security-critical operations in a wide range of industrial, home, and business applications. Their numerous applications, including those that concern the nation?s security, the health care system, and monitoring and protecting natural landscapes, clearly put the robust operation of WSNs at the core of technologies that are vital to our society. Using advanced tools from the theory of random graphs, this project develops methods for designing WSNs that are i) secure; ii) reliable against sensor and link failures; and iii) resilient against adversarial attacks. The research program is supported by several education and outreach activities including development of new courses, K-12 outreach, and dissemination of research results to academic and industrial audience.In order to ensure a secure, reliable, and resilient WSN operation, investigators consider WSNs that employ a randomized key predistribution scheme and develop conditions so that the network i) is k-connected; and ii) is resilient against node capture attacks in the sense of unassailability and unsplittability. This is done by developing realistic models of secure WSNs constructed by intersecting two random graphs: a cryptographic graph induced by the random key predistribution scheme and a communication graph induced by the wireless communication media and random deployment of sensors. For several classical random key predistribution schemes and wireless communication models, investigators develop (i) zero-one laws for k-connectivity; (ii) Poisson approximation results to obtain the asymptotic probability of k-connectivity; and (iii) conditions on network parameters (e.g., number of nodes, link failure probability, number of keys per node, key pool size) that ensure the unassailability and unsplittability of the network.