• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Dependable and Secure Computing, IEEE Transactions on >ZoneTrust: Fast Zone-Based Node Compromise Detection and Revocation in Wireless Sensor Networks Using Sequential Hypothesis Testing
【24h】

ZoneTrust: Fast Zone-Based Node Compromise Detection and Revocation in Wireless Sensor Networks Using Sequential Hypothesis Testing

机译：ZoneTrust：使用顺序假设测试的无线传感器网络中基于区域的快速节点损坏检测和吊销

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Due to the unattended nature of wireless sensor networks, an adversary can physically capture and compromise sensor nodes and then mount a variety of attacks with the compromised nodes. To minimize the damage incurred by the compromised nodes, the system should detect and revoke them as soon as possible. To meet this need, researchers have recently proposed a variety of node compromise detection schemes in wireless ad hoc and sensor networks. For example, reputation-based trust management schemes identify malicious nodes but do not revoke them due to the risk of false positives. Similarly, software-attestation schemes detect the subverted software modules of compromised nodes. However, they require each sensor node to be attested periodically, thus incurring substantial overhead. To mitigate the limitations of the existing schemes, we propose a zone-based node compromise detection and revocation scheme in wireless sensor networks. The main idea behind our scheme is to use sequential hypothesis testing to detect suspect regions in which compromised nodes are likely placed. In these suspect regions, the network operator performs software attestation against sensor nodes, leading to the detection and revocation of the compromised nodes. Through quantitative analysis and simulation experiments, we show that the proposed scheme detects the compromised nodes with a small number of samples while reducing false positive and negative rates, even if a substantial fraction of the nodes in the zone are compromised. Additionally, we model the detection problem using a game theoretic analysis, derive the optimal strategies for the attacker and the defender, and show that the attacker's gain from node compromise is greatly limited by the defender when both the attacker and the defender follow their optimal strategies.
机译：由于无线传感器网络的无人值守性质，攻击者可以物理捕获并破坏传感器节点，然后对受到感染的节点进行各种攻击。为了最大程度地减少损坏的节点所造成的损害，系统应尽快检测并撤消它们。为了满足这一需求，研究人员最近提出了无线自组织和传感器网络中的各种节点危害检测方案。例如，基于信誉的信任管理方案可识别恶意节点，但由于误报的风险而不会将其撤消。同样，软件证明方案可以检测受破坏节点的颠覆性软件模块。但是，它们要求定期对每个传感器节点进行检验，因此会产生大量开销。为了减轻现有方案的局限性，我们提出了一种在无线传感器网络中基于区域的节点危害检测和撤销方案。我们的方案背后的主要思想是使用顺序假设检验来检测可疑区域，在这些区域中可能存在受感染的节点。在这些可疑区域中，网络运营商针对传感器节点执行软件认证，从而导致受到感染的节点的检测和撤销。通过定量分析和模拟实验，我们表明，即使该区域中相当大一部分的节点都受到了损害，该提议的方案也能够以少量样本检测出受损的节点，同时降低了假阳性和阴性率。此外，我们使用博弈论分析对检测问题进行建模，得出攻击者和防御者的最佳策略，并表明当攻击者和防御者都遵循其最佳策略时，防御者极大地限制了攻击者从节点妥协中获得的收益。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号