Papers
Topics
Authors
Recent
Search
2000 character limit reached

Secure Analysis of Dynamic Networks under Pinning Attacks against Synchronization

Published 2 Sep 2019 in eess.SY, cs.SI, cs.SY, and math.DS | (1909.00582v1)

Abstract: In this paper, we first consider a pinning node selection and control gain co-design problem for complex networks. A necessary and sufficient condition for the synchronization of the pinning controlled networks at a homogeneous state is provided. A quantitative model is built to describe the pinning costs and to formulate the pinning node selection and control gain design problem for different scenarios into the corresponding optimization problems. Algorithms to solve these problems efficiently are presented. Based on the developed results, we take the existence of a malicious attacker into consideration and a resource allocation model for the defender and the malicious attacker is described. We set up a leader-follower Stackelberg game framework to study the behaviour of both sides and the equilibrium of this security game is investigated. Numerical examples and simulations are presented to demonstrate the main results.

Citations (18)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.