Open Access Open Access  Restricted Access Subscription Access

IDENTIFYING VULNERABLE NODES IN NETWORKED INFRASTRUCTURES: A METHODOLOGICAL APPROACH TO OPTIMAL COST ATTACKS

Amrutha M, Nethravathi B, Sandhyarani ., Suthoju Girija Rani, Ananya Raju M R, P Kavyasri .

Abstract


Networked infrastructures are vital components of modern society, providing essential services such as power distribution, transportation, and communication. However, these infrastructures are susceptible to various threats and attacks, necessitating the identification of critical nodes to enhance their resilience and security. This paper reviews a methodology for determining critical nodes in optimal cost attacks on networked infrastructures, leveraging graph theory modelling and integer-linear programming. The methodology aims to compute optimal attack strategies considering failure propagation in infrastructure networks, thereby enhancing fault tolerance and resilience. The strengths, limitations, and applicability of the methodology are discussed, along with potential challenges and future research directions.

Full Text:

PDF

References


L. Faramondi, G. Oliva, F. Pascucci, S. Panzieri and R. Setola, "Critical node detection based on attacker preferences," 2016 24th Mediterranean Conference on Control and Automation (MED), Athens, Greece, 2016, pp. 773-778, doi: 10.1109/MED.2016.7535859.

Ahmad, I., Clark, A., Ali, M. et al. Determining critical nodes in optimal cost attacks on networked infrastructures. Discov Internet Things 4, 2 (2024). https://doi.org/10.1007/s43926-023-00054-1

Yang, H.; An, S. Critical Nodes Identification in Complex Networks. Symmetry 2020, 12, 123. https://doi.org/10.3390/sym12010123

M. Di Summa, A. Grosso and M. Locatelli, “Branch and cut algorithms for detecting critical nodes in undirected graphs”, Computational Optimization and Applications, vol. 53, no. 3, pp: 649–680, 2012.

F. Sun and M. A. Shayman, “On pairwise connectivity of wireless multihop networks”, International Journal of Security and Networks, vol. 2, no. 1-2, pp. 37–49, 2007.

W. Pullan, “Heuristic identification of critical nodes in sparse real world graphs.” Journal of Heuristics, vol. 21, no. 5, pp. 1–22, 2015.

M. Ventresca, K.R. Harrison and B.M. Ombuki-Berman, “An Experimental Evaluation of Multi-objective Evolutionary Algorithms for Detecting Critical Nodes in Complex Networks”, Applications of Evolutionary Computation, pp. 164–176, 2015.

M. Lalou, M.A. Tahraoui and H. Kheddouci, “Component-cardinality constrained critical node problem in graphs”, Discrete Applied Mathematics, vol. 9028, pp. 164–176, 2015.

P. Crucitti, V. Latora and M. Marchiori, “Locating critical lines in high-voltage electrical power grids”, Fluctuation and Noise Letters, vol. 5, no. 2, pp. 201–208, 2005.

A. Arulselvan, C. Commander, L. Elefteriadou and P.M. Pardalos, “Detecting critical nodes in sparse graphs”, Computers and Operations Research, vol. 36, no. 7, pp. 2193–2200, 2009.


Refbacks

  • There are currently no refbacks.