University of Groningen A Centrality-Based Security Game for Multi-Hop Networks

We formulate a network security problem as a zero-sum game between an attacker who tries to disrupt a network by disabling one or more nodes, and the nodes of the network who must allocate limited resources in defense of the network. The utility of the zero-sum game can be one of several network performance metrics that correspond to node centrality measures. We first present a fast centralized algorithm that uses a monotone property of the utility function to compute saddle-point equilibrium strategies for the case of single-node attacks and singleor multiple-node defense. We then extend the approach to the distributed setting by computing the necessary quantities using a finite-time distributed averaging algorithm. For simultaneous attacks to multiple nodes the computational complexity becomes quite high, so we propose a method to approximate the saddle-point equilibrium strategies based on a sequential simplification, which performs well in simulations.

[1]  Ming Cao,et al.  Optimal defensive resource allocation for a centrality-based security game on multi-hop networks , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[2]  Andrew L. Liu,et al.  Multi-Agent Decentralized Network Interdiction Games , 2015, 1503.01100.

[3]  S. Goyal,et al.  Attack, Defence, and Contagion in Networks , 2014 .

[4]  Karl Henrik Johansson,et al.  A secure control framework for resource-limited adversaries , 2012, Autom..

[5]  Bruno Sinopoli,et al.  Adversarial detection as a zero-sum game , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[6]  C. F. Larry Heimann,et al.  Simulation and Game-Theoretic Analysis of an Attacker-Defender Game , 2012, GameSec.

[7]  Bernhard Plattner,et al.  Network resilience: a systematic approach , 2011, IEEE Communications Magazine.

[8]  Munther A. Dahleh,et al.  Robust Distributed Routing in Dynamical Networks—Part I: Locally Responsive Policies and Weak Resilience , 2013, IEEE Transactions on Automatic Control.

[9]  Tamer Basar,et al.  Power allocation in team jamming games in wireless ad hoc networks , 2011, VALUETOOLS.

[10]  Y. Venkataramani,et al.  A New Defense Scheme against DDoS Attack in Mobile Ad Hoc Networks , 2011 .

[11]  Maria Domenica Di Benedetto,et al.  Randomized sampling for large zero-sum games , 2010, 49th IEEE Conference on Decision and Control (CDC).

[12]  David Hutchison,et al.  Resilience and survivability in communication networks: Strategies, principles, and survey of disciplines , 2010, Comput. Networks.

[13]  Chase Qishi Wu,et al.  A Survey of Game Theory as Applied to Network Security , 2010, 2010 43rd Hawaii International Conference on System Sciences.

[14]  Eitan Altman,et al.  Jamming in wireless networks: The case of several jammers , 2009, 2009 International Conference on Game Theory for Networks.

[15]  S. Shankar Sastry,et al.  Secure Control: Towards Survivable Cyber-Physical Systems , 2008, 2008 The 28th International Conference on Distributed Computing Systems Workshops.

[16]  Martin Vetterli,et al.  Which Distributed Averaging Algorithm Should I Choose for my Sensor Network? , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[17]  C.N. Hadjicostis,et al.  Finite-Time Distributed Consensus in Graphs with Time-Invariant Topologies , 2007, 2007 American Control Conference.

[18]  Georgios C. Chasparis,et al.  Linear-programming-based multi-vehicle path planning with adversaries , 2005, Proceedings of the 2005, American Control Conference, 2005..

[19]  Richard L. Church,et al.  Identifying Critical Infrastructure: The Median and Covering Facility Interdiction Problems , 2004 .

[20]  R. Srikant,et al.  Correlated jamming on MIMO Gaussian fading channels , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[21]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[23]  Alex Bavelas A Mathematical Model for Group Structures , 1948 .

[24]  Ozan K. Tonguz,et al.  What if Wireless Routers were Social ? Analyzing Wireless Mesh Networks from a Social Networks Perspective , 2015 .

[25]  Churlzu Lim,et al.  Algorithms for Network Interdiction and Fortification Games , 2008 .

[26]  Michael Kaufmann,et al.  Decentralized algorithms for evaluating centrality in complex networks , 2003 .

[27]  Gilbert Strang,et al.  Karmarkar’s algorithm and its place in applied mathematics , 1987 .

[28]  Tamer Basar,et al.  With the Capacity 0.461(bits) and the Optimal Opd Being 'q = , 1998 .

[29]  L. Freeman Centrality in social networks conceptual clarification , 1978 .