Dynamic Resilient Network Games With Applications to Multiagent Consensus

A cyber security problem in a networked system formulated as a resilient graph problem based on a game-theoretic approach is considered. The connectivity of the underlying graph of the network system is reduced by an attacker who removes some of the edges, whereas the defender attempts to recover them. Both players are subject to energy constraints so that their actions are restricted and cannot be performed continuously. For this two-stage game, we characterize the optimal strategies for the attacker and the defender in terms of edge connectivity and the number of connected components of the graph. The resilient graph game is then applied to a multiagent consensus problem, where the game is played repeatedly over time. In this article, we study how the attacks and the recovery on the edges affect the consensus process. Finally, we also provide numerical simulation to illustrate the results.

[1]  Quanyan Zhu,et al.  A Dynamic Game Approach to Strategic Design of Secure and Resilient Infrastructure Network , 2019, IEEE Transactions on Information Forensics and Security.

[2]  Tomohisa Hayakawa,et al.  Randomized Transmission Protocols for Protection against Jamming Attacks in Multi-Agent Consensus , 2018, Autom..

[3]  H. Ishii,et al.  Dynamic Resilient Graph Games for State-Dependent Jamming Attacks Analysis on Multi-Agent Systems , 2020 .

[4]  Tamer Basar,et al.  Dynamic Games in Cyber-Physical Security: An Overview , 2019, Dyn. Games Appl..

[5]  Quanyan Zhu,et al.  Subgame Perfect Equilibrium Analysis for Jamming Attacks on Resilient Graphs , 2019, 2019 American Control Conference (ACC).

[6]  Bruno Sinopoli,et al.  Attack Resilient Interconnected Second Order Systems: A Game-Theoretic Approach , 2019, 2019 IEEE 58th Conference on Decision and Control (CDC).

[7]  Tomohisa Hayakawa,et al.  The Effect of Time-Varying Jamming Interference on Networked Stabilization , 2018, SIAM J. Control. Optim..

[8]  Danial Senejohnny,et al.  A Jamming-Resilient Algorithm for Self-Triggered Network Coordination , 2016, IEEE Transactions on Control of Network Systems.

[9]  Tomohisa Hayakawa,et al.  Stochastic communication protocols for multi-agent consensus under jamming attacks , 2017, 2017 IEEE 56th Annual Conference on Decision and Control (CDC).

[10]  Ling Shi,et al.  SINR-Based DoS Attack on Remote State Estimation: A Game-Theoretic Approach , 2017, IEEE Transactions on Control of Network Systems.

[11]  Vijay Kumar,et al.  Formations for Resilient Robot Teams , 2017, IEEE Robotics and Automation Letters.

[12]  Tomohisa Hayakawa,et al.  Networked Control Under Random and Malicious Packet Losses , 2016, IEEE Transactions on Automatic Control.

[13]  Roberto Tempo,et al.  Resilient randomized quantized consensus , 2016, 2016 American Control Conference (ACC).

[14]  Pietro Tesi,et al.  Resilient control under Denial-of-Service: Robust design , 2016, 2016 American Control Conference (ACC).

[15]  Ling Shi,et al.  Jamming Attacks on Remote State Estimation in Cyber-Physical Systems: A Game-Theoretic Approach , 2015, IEEE Transactions on Automatic Control.

[16]  Pietro Tesi,et al.  Input-to-State Stabilizing Control Under Denial-of-Service , 2015, IEEE Transactions on Automatic Control.

[17]  Quanyan Zhu,et al.  Game-Theoretic Methods for Robustness, Security, and Resilience of Cyberphysical Control Systems: Games-in-Games Principle for Optimal Cross-Layer Resilient Control Systems , 2015, IEEE Control Systems.

[18]  Liang Xiao,et al.  Power control Stackelberg game in cooperative anti-jamming communications , 2014, The 2014 5th International Conference on Game Theory for Networks.

[19]  Pietro Tesi,et al.  Resilient Control under Denial-of-Service , 2013, ArXiv.

[20]  Xi Fang,et al.  Coping with a Smart Jammer in Wireless Networks: A Stackelberg Game Approach , 2013, IEEE Transactions on Wireless Communications.

[21]  Shreyas Sundaram,et al.  Resilient Asymptotic Consensus in Robust Networks , 2013, IEEE Journal on Selected Areas in Communications.

[22]  Abhishek Gupta,et al.  Jamming in mobile networks: A game-theoretic approach , 2013 .

[23]  Tamer Basar,et al.  A dynamic transmitter-jammer game with asymmetric information , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[24]  Behrouz Touri,et al.  Consensus in the Presence of an Adversary , 2012 .

[25]  Lewis Tseng,et al.  Iterative approximate byzantine consensus in arbitrary directed graphs , 2012, PODC '12.

[26]  Ruggero Carli,et al.  Distributed averaging on digital erasure networks , 2011, Autom..

[27]  Tansu Alpcan,et al.  Network Security , 2010 .

[28]  Subhrakanti Dey,et al.  Stochastic consensus over noisy networks with Markovian and arbitrary switches , 2010, Autom..

[29]  Magnus Egerstedt,et al.  Graph Theoretic Methods in Multiagent Networks , 2010, Princeton Series in Applied Mathematics.

[30]  Randal W. Beard,et al.  Consensus seeking in multiagent systems under dynamically changing interaction topologies , 2005, IEEE Transactions on Automatic Control.

[31]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[32]  Dorit S. Hochbaum,et al.  A Polynomial Algorithm for the k-cut Problem for Fixed k , 1994, Math. Oper. Res..

[33]  Dorit S. Hochbaum,et al.  Polynomial algorithm for the k-cut problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.