Robustness of Systems with Undirected Graph Under Jamming Attack: A Game-theoretic Approach

Abstract

In this aper, based on game theory, a cyber security problem, formulated as a network robustness problem is considered. The H <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> norm of the consensus dynamics with undirected communication graph, is related to the effective resistance of the graph, which is used as the objective function of the game. The defender protects single edge from being removed whereas the attacker attempts to remove it. Due to the computational complexity of exhaustive search, an approximate search strategy is introduced. Some numerical examples are presented to illustrate the results.