A low‐cost node capture attack algorithm for wireless sensor networks
A low‐cost node capture attack algorithm for wireless sensor networks
复制标题
DOI：
10.1002/dac.3097
复制
发表时间：
2016-05
影响因子：
2.1
通讯作者：
Chi Lin;Guowei Wu;Tie Qiu;Jing Deng
中科院分区：
文献类型：
--
作者：
Chi Lin;Guowei Wu;Tie Qiu;Jing Deng
无线传感器网络（WSNs）具有许多易于捕获的微型设备。在节点捕获攻击中，攻击者物理地捕获传感器并从其记忆中提取包括关键信息在内的所有信息，试图破坏系统的安全保护。然而，许多WSN安全设计的鲁棒性和随机性使得即使捕获一些传感器也很难危及系统。在本文中，我们从对抗的角度来研究WSN的安全性，并研究低成本和高效的算法，以在最短的时间内以最低的成本识别WSN中的传感器。而不是随机捕获传感器，一个聪明的攻击者应该选择下一个目标基于已知的拓扑到目前为止。由于这种识别已经被证明是NP困难的（非确定性多项式时间困难），我们建议将问题转化为集合覆盖问题，并开发一种贪婪最小代价节点捕获攻击算法（MCA）来降低攻击代价。我们进行了大量的仿真来评估MCA的性能，并将其与几种相关方案进行了比较。结果表明，MCA将破坏wsn的成本降低了16%。版权所有©2015 John Wiley & Sons， Ltd
Wireless sensor networks (WSNs) have many micro devices that are easy to capture. In node capture attacks, the adversary physically captures sensors and extracts all information including key information from their memories, trying to compromise the system's security protection. However, the robust and random nature of many WSN security designs makes it difficult to compromise the system even with the capture of some sensors. In this paper, we approach WSN security from an adversarial point of view and investigate low‐cost and efficient algorithms to identify sensors in a WSN in the shortest time with the lowest cost. Instead of randomly capturing sensors, an intelligent attacker should choose the next target based on the known topology so far. Because the identification of such has been proven to be NP‐hard (non‐deterministic polynomial‐time hard), we propose to transform the problem into a set covering problem and develop a greedy minimum cost node capture attack algorithm (MCA) to lower cost of attack. Extensive simulations have been implemented to evaluate the performance of MCA and to compare it with several related schemes. It is shown that MCA lowers the cost of compromising WSNs by 16%. Copyright © 2015 John Wiley & Sons, Ltd.