Metraipolis › archive › dc_d892d2f9a0fb

Cyber War Game in Temporal Networks — Europe PMC PMID:26859840

Source
Europe PMC (en)
Original
https://europepmc.org/article/MED/26859840
DOI
10.1371/journal.pone.0148674
License (as archived)
CC0-1.0
Archived
2026-10-07T17:13:37.986Z
SHA-256 of the archived text
3dfb4a2839a54079fc6e416538f3f318209aa090f1462316d83eb460858a742b
Stable URL of this page
https://metraipolis.com/documento/dc_d892d2f9a0fb

How to cite

Cyber War Game in Temporal Networks — Europe PMC PMID:26859840 — Europe PMC (en), https://europepmc.org/article/MED/26859840 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d892d2f9a0fb (Metraipolis archive dc_d892d2f9a0fb, sha256 3dfb4a2839a54079fc6e416538f3f318209aa090f1462316d83eb460858a742b)
BibTeX
@misc{dcd892d2f9a0fb,
  title = {Cyber War Game in Temporal Networks — Europe PMC PMID:26859840},
  howpublished = {Europe PMC (en)},
  url = {https://europepmc.org/article/MED/26859840},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d892d2f9a0fb; sha256 3dfb4a2839a54079fc6e416538f3f318209aa090f1462316d83eb460858a742b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: Europe PMC (en), https://europepmc.org/article/MED/26859840. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (ricerca Europe PMC «number theory», solo open access).
Pubblicazione: PloS one, 2016 (prima pubblicazione 2016-02-09).
Identificativi: PMID 26859840 · PMCID PMC4747583 · DOI 10.1371/journal.pone.0148674.
Descrittori MeSH principali: Video Games; Warfare.
Pagina: https://europepmc.org/article/MED/26859840 — https://doi.org/10.1371/journal.pone.0148674. Autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza dell'articolo dichiarata da Europe PMC: CC0 (la versione è indicata dall'editore sulla pagina). Abstract riportato senza modifiche al contenuto, con attribuzione; deposito marcato CC0.
Letto il 2026-10-07T16:44:35.519Z tramite l'API REST ufficiale di Europe PMC (EMBL-EBI), nel rispetto del robots.txt e del crawl-delay.