Robustness of interdependent geometric networks under inhomogeneous failures
Robustness of interdependent geometric networks under inhomogeneous failures
复制标题
DOI：
10.23919/wiopt.2018.8362877
复制
发表时间：
2018-05
期刊：
影响因子：
--
通讯作者：
Khashayar Kamran;Jianan Zhang;E. Yeh;E. Modiano
中科院分区：
文献类型：
--
作者：
Khashayar Kamran;Jianan Zhang;E. Yeh;E. Modiano
智能城市和智能电网等复杂系统在很大程度上依赖于其相互依赖的组件。一个网络中的组件的故障可能导致另一个网络中所支持的组件的故障。支持大量相互依赖的组件的组件可能更容易受到攻击和故障。本文研究了两个相互依赖网络在节点失效情况下的鲁棒性。通过使用随机几何图（RGG）对每个网络进行建模，我们研究了非均匀节点故障后两个相互依赖的RGG的渗流条件。我们推导出相互依赖度阈值（k1，k2）的分析界限，使得相互依赖的RGG在移除Gi中支持Gj中的kj个以上节点的节点后渗透（Vi，j <${1，2}，i <$j）。我们使用数值模拟验证的界限，并表明，有一个折衷k1和k2之间的故障后，保持渗流。
Complex systems such as smart cities and smart power grids rely heavily on their interdependent components. The failure of a component in one network may lead to the failure of the supported component in another network. Components which support a large number of interdependent components may be more vulnerable to attacks and failures. In this paper, we study the robustness of two interdependent networks under node failures. By modeling each network using a random geometric graph (RGG), we study conditions for the percolation of two interdependent RGGs after in-homogeneous node failures. We derive analytical bounds on the interdependent degree thresholds (k1,k2), such that the interdependent RGGs percolate after removing nodes in Gi that support more than kj nodes in Gj (Vi, j є {1,2},i ≠ j). We verify the bounds using numerical simulation, and show that there is a tradeoff between k1 and k2 for maintaining percolation after the failures.