首页> 外文会议>IEEE Military Communications Conference >On the smallest pseudo target set identification problem for targeted attack on interdependent power-communication networks
【24h】

On the smallest pseudo target set identification problem for targeted attack on interdependent power-communication networks

机译:关于相互依存电力通信网络的目标攻击的最小伪目标集识别问题

获取原文

摘要

Recognizing the need for a deeper understanding of the interdependence between critical infrastructures, such as the power grid and the communication network, a number of models have been proposed and analyzed in the last few years. However, most of these proposed models are over simplified and fail to capture complex interdependencies that may exist between these critical infrastructures. The recently proposed Implicative Interdependency Model is able to capture these complex interdependencies involving conjunctive and disjunctive relationships to overcome most of these limitations. Due to the existing interdependencies between the power and communication networks, a failure involving a small set of power and/or communication network entities can trigger a cascading event, resulting in the failure of a much larger set of entities through the cascading failure process. This implies that an adversary with an intent of destroying a specific set of entities E' (real targets), no longer needs to make an effort to destroy E' directly, but instead identify a set of smaller entities E" (pseudo targets), whose destruction eventually leads to the destruction of the real target set E' due to the cascading failure process. A clever adversary will thus try to identify the smallest set of pseudo target entities E00, whose destruction eventually destroys E'. We refer to this problem as the Smallest Pseudo Target Set Identification Problem (SPTSIP). We divide the problem into four classes, and show that it is solvable in polynomial time for one class, and is NP-complete for others. We provide an approximation algorithm for the second class, and for the most general class, we provide an optimal solution using ILP, and a heuristic solution. We evaluate the efficacy of our heuristic using power and communication network data of Maricopa County, Arizona. The experiments show that our heuristic almost always produces near optimal results.
机译:认识到需要更深入地了解关键基础设施之间的相互依存,例如电网和通信网络,在过去几年中已经提出并分析了许多模型。然而,大多数这些提出的模型已经过于简化并且无法捕获这些关键基础架构之间可能存在的复杂相互依赖性。最近提出的潜在相互依存模型能够捕捉这些复杂的相互依赖性,涉及联合和析出关系,以克服大部分这些限制。由于电力和通信网络之间的现有相互依存性,涉及一小集电源和/或通信网络实体的故障可以触发级联事件,从而通过级联故障过程导致大量更大的实体发生故障。这意味着对摧毁特定实体E'(真实目标)的意图的对手不再需要努力直接摧毁E',而是识别一组较小的实体E“(伪目标),由于级联失败过程,其毁灭最终导致真实目标集的破坏。因此,聪明的对手将尝试识别最小的伪目标实体E00,其破坏最终摧毁了E'。我们指的是这个问题作为最小的伪目标集识别问题(SPTSIP)。我们将问题分为四个类,并显示它在一个类的多项式时间中可解决,并且对于其他类是NP-Complete。我们为第二类提供了近似算法以及对于最普遍的类,我们使用ILP和启发式解决方案提供最佳解决方案。我们使用亚利桑那州马里科帕县的电力和通信网络数据评估我们的启发式网络数据。实验S表明我们的启发式几乎总是在最佳结果附近产生。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号