Robustness of interdependent geometric networks under inhomogeneous failures
© 2018 IFIP. 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 componen...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2020
|
| Online Access: | https://hdl.handle.net/1721.1/126310 |
| _version_ | 1811092415347425280 |
|---|---|
| author | Kamran, Khashayar Zhang, Jianan Yeh, Edmund M Modiano, Eytan H |
| author2 | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems |
| author_facet | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems Kamran, Khashayar Zhang, Jianan Yeh, Edmund M Modiano, Eytan H |
| author_sort | Kamran, Khashayar |
| collection | MIT |
| description | © 2018 IFIP. 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. |
| first_indexed | 2024-09-23T15:17:48Z |
| format | Article |
| id | mit-1721.1/126310 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T15:17:48Z |
| publishDate | 2020 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/1263102022-09-29T14:01:17Z Robustness of interdependent geometric networks under inhomogeneous failures Kamran, Khashayar Zhang, Jianan Yeh, Edmund M Modiano, Eytan H Massachusetts Institute of Technology. Laboratory for Information and Decision Systems Massachusetts Institute of Technology. Department of Aeronautics and Astronautics © 2018 IFIP. 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. 2020-07-22T16:16:56Z 2020-07-22T16:16:56Z 2018-05 2019-10-30T15:44:03Z Article http://purl.org/eprint/type/ConferencePaper 9781538646212 9783903176003 https://hdl.handle.net/1721.1/126310 Kamran, Khashayar, Zhang, Jianan, Yeh, Edmund M and Modiano, Eytan H. 2018. "Robustness of interdependent geometric networks under inhomogeneous failures." 2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), 2018. en 10.23919/WIOPT.2018.8362877 2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) MIT web domain |
| spellingShingle | Kamran, Khashayar Zhang, Jianan Yeh, Edmund M Modiano, Eytan H Robustness of interdependent geometric networks under inhomogeneous failures |
| title | Robustness of interdependent geometric networks under inhomogeneous failures |
| title_full | Robustness of interdependent geometric networks under inhomogeneous failures |
| title_fullStr | Robustness of interdependent geometric networks under inhomogeneous failures |
| title_full_unstemmed | Robustness of interdependent geometric networks under inhomogeneous failures |
| title_short | Robustness of interdependent geometric networks under inhomogeneous failures |
| title_sort | robustness of interdependent geometric networks under inhomogeneous failures |
| url | https://hdl.handle.net/1721.1/126310 |
| work_keys_str_mv | AT kamrankhashayar robustnessofinterdependentgeometricnetworksunderinhomogeneousfailures AT zhangjianan robustnessofinterdependentgeometricnetworksunderinhomogeneousfailures AT yehedmundm robustnessofinterdependentgeometricnetworksunderinhomogeneousfailures AT modianoeytanh robustnessofinterdependentgeometricnetworksunderinhomogeneousfailures |