A confidential and DoS-resistant multi-hop code dissemination protocol for wireless sensor networks
A confidential and DoS-resistant multi-hop code dissemination protocol for wireless sensor networks
复制标题
DOI：
10.1016/j.cose.2012.09.012
复制
发表时间：
2013-02-01
影响因子：
5.6
通讯作者：
Jha, Sanjay
中科院分区：
文献类型：
--
作者：
Tan, Hailun;Ostry, Diethelm;Jha, Sanjay
由于无线传感器网络（WSNs）通常部署在开放环境中，因此能够对传输的数据进行身份验证非常重要。在某些应用中，尽管有信息截获，也要求数据保密。认证和机密性通常通过加密操作来实现，这可能在功耗上是昂贵的，使得具有这些特征的协议容易受到传输伪造数据的对手的攻击，因此迫使节点浪费能量将其识别为无效。此外，在多跳代码传播协议中，传感器节点被要求在其邻居请求时广播其程序图像。对手可以反复向其邻居发送虚假的程序图像请求，使它们耗尽能量储备。在本文中，我们提出了一种新的方法来实现多跳代码分发的机密性。我们提出了针对这两种类型的攻击的对策。我们的方法是基于WSNs，一个开源的，最先进的代码传播协议。我们提供的理论分析和模拟/实验结果表明，我们的方法优于早期的尝试时，存在恶意代码注入器，以及延迟，能耗，传播率和其他因素的性能评估（刘宁，2006年11月）。(c)2012爱思唯尔有限公司版权所有。
Due to the open environment in which Wireless Sensor Networks (WSNs) are typically deployed, it is important to be able to authenticate transmitted data. In some applications it is also required that the data be kept confidential in spite of message interception. Authentication and confidentiality are typically implemented through cryptographic operations which may be expensive in power consumption, making a protocol with these features vulnerable to attack by an adversary who transmits forged data, so forcing nodes to waste energy in identifying it as invalid. Additionally, in multi-hop code dissemination protocols, a sensor node is required to broadcast its program image when requested by its neighbors. An adversary could repeatedly send spurious program image requests to its neighbors, making them exhaust their energy reserves. In this paper, we present a new approach to achieve confidentiality in multi-hop code dissemination. We propose countermeasures against both these types of attack. Our approach is based on Deluge, an open source, state-of-the-art code dissemination protocol for WSNs. We provide theoretical analysis and simulation/experimental results which show that our approach outperforms earlier attempts when a malicious code injector is present, as well as a performance evaluation of latency, energy consumption, dissemination rate, and other factors (Liu and Ning, November 2006). (c) 2012 Elsevier Ltd. All rights reserved.