IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0148674.html
   My bibliography  Save this article

Cyber War Game in Temporal Networks

Author

Listed:
  • Jin-Hee Cho
  • Jianxi Gao

Abstract

In a cyber war game where a network is fully distributed and characterized by resource constraints and high dynamics, attackers or defenders often face a situation that may require optimal strategies to win the game with minimum effort. Given the system goal states of attackers and defenders, we study what strategies attackers or defenders can take to reach their respective system goal state (i.e., winning system state) with minimum resource consumption. However, due to the dynamics of a network caused by a node’s mobility, failure or its resource depletion over time or action(s), this optimization problem becomes NP-complete. We propose two heuristic strategies in a greedy manner based on a node’s two characteristics: resource level and influence based on k-hop reachability. We analyze complexity and optimality of each algorithm compared to optimal solutions for a small-scale static network. Further, we conduct a comprehensive experimental study for a large-scale temporal network to investigate best strategies, given a different environmental setting of network temporality and density. We demonstrate the performance of each strategy under various scenarios of attacker/defender strategies in terms of win probability, resource consumption, and system vulnerability.

Suggested Citation

  • Jin-Hee Cho & Jianxi Gao, 2016. "Cyber War Game in Temporal Networks," PLOS ONE, Public Library of Science, vol. 11(2), pages 1-16, February.
    • Handle: RePEc:plo:pone00:0148674
    DOI: 10.1371/journal.pone.0148674
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0148674
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0148674&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0148674?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Réka Albert & Hawoong Jeong & Albert-László Barabási, 2000. "Error and attack tolerance of complex networks," Nature, Nature, vol. 406(6794), pages 378-382, July.
    2. Samir Suweis & Filippo Simini & Jayanth R. Banavar & Amos Maritan, 2013. "Emergence of structural and dynamical properties of ecological mutualistic networks," Nature, Nature, vol. 500(7463), pages 449-452, August.
    3. Sergey V. Buldyrev & Roni Parshani & Gerald Paul & H. Eugene Stanley & Shlomo Havlin, 2010. "Catastrophic cascade of failures in interdependent networks," Nature, Nature, vol. 464(7291), pages 1025-1028, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kashin Sugishita & Yasuo Asakura, 2021. "Vulnerability studies in the fields of transportation and complex networks: a citation network analysis," Public Transport, Springer, vol. 13(1), pages 1-34, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhou, Yaoming & Wang, Junwei, 2018. "Efficiency of complex networks under failures and attacks: A percolation approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 658-664.
    2. Liu, Run-Ran & Chu, Changchang & Meng, Fanyuan, 2023. "Higher-order interdependent percolation on hypergraphs," Chaos, Solitons & Fractals, Elsevier, vol. 177(C).
    3. Zhu, Qian & Zhu, Zhiliang & Wang, Yifan & Yu, Hai, 2016. "Fuzzy-information-based robustness of interconnected networks against attacks and failures," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 458(C), pages 194-203.
    4. Wouter Vermeer & Otto Koppius & Peter Vervest, 2018. "The Radiation-Transmission-Reception (RTR) model of propagation: Implications for the effectiveness of network interventions," PLOS ONE, Public Library of Science, vol. 13(12), pages 1-21, December.
    5. Lu, Qing-Chang & Xu, Peng-Cheng & Zhao, Xiangmo & Zhang, Lei & Li, Xiaoling & Cui, Xin, 2022. "Measuring network interdependency between dependent networks: A supply-demand-based approach," Reliability Engineering and System Safety, Elsevier, vol. 225(C).
    6. Gangwal, Utkarsh & Singh, Mayank & Pandey, Pradumn Kumar & Kamboj, Deepak & Chatterjee, Samrat & Bhatia, Udit, 2022. "Identifying early-warning indicators of onset of sudden collapse in networked infrastructure systems against sequential disruptions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 591(C).
    7. Wang, Jianwei & Jiang, Chen & Qian, Jianfei, 2014. "Robustness of interdependent networks with different link patterns against cascading failures," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 535-541.
    8. Hayato Goto & Hideki Takayasu & Misako Takayasu, 2017. "Estimating risk propagation between interacting firms on inter-firm complex network," PLOS ONE, Public Library of Science, vol. 12(10), pages 1-12, October.
    9. Walter Quattrociocchi & Guido Caldarelli & Antonio Scala, 2014. "Self-Healing Networks: Redundancy and Structure," PLOS ONE, Public Library of Science, vol. 9(2), pages 1-7, February.
    10. Liu, Hao & Chen, Xin & Huo, Long & Zhang, Yadong & Niu, Chunming, 2022. "Impact of inter-network assortativity on robustness against cascading failures in cyber–physical power systems," Reliability Engineering and System Safety, Elsevier, vol. 217(C).
    11. Jiang, Zhong-Yuan & Zeng, Yong & Liu, Zhi-Hong & Ma, Jian-Feng, 2019. "Identifying critical nodes’ group in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 121-132.
    12. Jordán, Ferenc, 2022. "The network perspective: Vertical connections linking organizational levels," Ecological Modelling, Elsevier, vol. 473(C).
    13. Zhang, Hai-Feng & Wang, Hao-Ren & Xiang, Bing-Bing & Wang, Huan, 2024. "Robustness study of hybrid hypergraphs," Reliability Engineering and System Safety, Elsevier, vol. 252(C).
    14. Kashyap, G. & Ambika, G., 2019. "Link deletion in directed complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 631-643.
    15. Nguyen, Win P.V. & Nof, Shimon Y., 2020. "Strategic lines of collaboration in response to disruption propagation (CRDP) through cyber-physical systems," International Journal of Production Economics, Elsevier, vol. 230(C).
    16. Kashin Sugishita & Yasuo Asakura, 2021. "Vulnerability studies in the fields of transportation and complex networks: a citation network analysis," Public Transport, Springer, vol. 13(1), pages 1-34, March.
    17. Cui, Pengshuai & Zhu, Peidong & Wang, Ke & Xun, Peng & Xia, Zhuoqun, 2018. "Enhancing robustness of interdependent network by adding connectivity and dependence links," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 497(C), pages 185-197.
    18. Liu, Xiaoxiao & Sun, Shiwen & Wang, Jiawei & Xia, Chengyi, 2019. "Onion structure optimizes attack robustness of interdependent networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 535(C).
    19. Zhang, Dayong & Men, Hao & Zhang, Zhaoxin, 2024. "Assessing the stability of collaboration networks: A structural cohesion analysis perspective," Journal of Informetrics, Elsevier, vol. 18(1).
    20. Zhang, Tianqiao & Zhang, Yang & Zhu, Xuzhen & Chen, Junliang, 2019. "Cascading failures on interdependent networks with star dependent links," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 535(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0148674. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.