Distributed Joint Attack Detection and Secure State Estimation

Forti, Nicola; Battistelli, Giorgio; Chisci, Luigi; Li, Suqi; Wang, Bailu; Sinopoli, Bruno

doi:10.1109/tsipn.2017.2760804

Cited by 62 publications

(41 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some recent related work on resilient distributed parameter estimation and resilient decentralized hypothesis testing are reported in [23] and [24], respectively. The authors in [25] consider the problem of joint attack detection and state estimation. However, the attack model, the system model, and the assumptions on the communication graph in [25] differ considerably from the ones considered in this paper.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Byzantine-resilient distributed observers for LTI systems

Mitra

Sundaram

2019

Automatica

View full text Add to dashboard Cite

Consider a linear time-invariant (LTI) dynamical system monitored by a network of sensors, modeled as nodes of an underlying directed communication graph. We study the problem of collaboratively estimating the state of the system when certain nodes are compromised by adversaries. Specifically, we consider a Byzantine adversary model, where a compromised node possesses complete knowledge of the system dynamics and the network, and can deviate arbitrarily from the rules of any prescribed algorithm. We first characterize certain fundamental limitations of any distributed state estimation algorithm in terms of the measurement and communication structure of the nodes. We then develop an attack-resilient, provably correct state estimation algorithm that admits a fully distributed implementation. To characterize feasible network topologies that guarantee success of our proposed technique, we introduce a notion of 'strong-robustness' that captures both measurement and communication redundancy. Finally, by drawing connections to bootstrap percolation theory, we argue that given an LTI system and an associated sensor network, the 'strong-robustness' property can be checked in polynomial time.

show abstract

Section: Introductionmentioning

confidence: 99%

“…The authors in [25] consider the problem of joint attack detection and state estimation. However, the attack model, the system model, and the assumptions on the communication graph in [25] differ considerably from the ones considered in this paper.…”

Section: Introductionmentioning

confidence: 99%

Byzantine-resilient distributed observers for LTI systems

Mitra

Sundaram

2019

Automatica

View full text Add to dashboard Cite

show abstract

“…A study on attack detection and identification for CPSs was given in [1], where the design methods and analysis techniques for centralized and distributed monitors were discussed as well. In [2], the joint distributed attack detection and state estimation was investigated in a Bayesian framework. To obtain attack-resilient state estimates, in the centralized framework, some state estimators or observers were proposed based on optimization techniques [3]- [7], recursive implementation [8], and probabilistic approach [9].…”

Section: Introductionmentioning

confidence: 99%

Secure Distributed Filtering for Unstable Dynamics Under Compromised Observations

Ren

Johansson

2019

2019 IEEE 58th Conference on Decision and Control (CDC)

View full text Add to dashboard Cite

In this paper, we consider a secure distributed filtering problem for linear time-invariant systems with bounded noises and unstable dynamics under compromised observations. A malicious attacker is able to compromise a subset of the agents and manipulate the observations arbitrarily. We first propose a recursive distributed filter consisting of two parts at each time. The first part employs a saturationlike scheme, which gives a small gain if the innovation is too large. The second part is a consensus operation of state estimates among neighboring agents. A sufficient condition is then established for the boundedness of estimation error, which is with respect to network topology, system structure, and the maximal compromised agent subset. We further provide an equivalent statement, which connects to 2s-sparse observability in the centralized framework in certain scenarios, such that the sufficient condition is feasible. Numerical simulations are finally provided to illustrate the developed results.

show abstract

“…We find the minimal conditions to guarantee observability/controllability of the composite network and provide sufficient conditions on the structure of the network G 1 and the observation/input matrix H C . First, similar to [35], we find 3 The constrained bipartite matching is defined over bipartite representation of the network. In the bipartite representation, define a t-matching as a set of t links such that no two of them share a node.…”

Section: Introductionmentioning

confidence: 99%

Minimal Sufficient Conditions for Structural Observability/Controllability of Composite Networks via Kronecker Product

Doostmohammadian

Khan

2020

IEEE Trans. on Signal and Inf. Process. over Networks

View full text Add to dashboard Cite

In this paper, we consider composite networks formed from the Kronecker product of smaller networks. We find the observability and controllability properties of the product network from those of its constituent smaller networks. The overall network is modeled as a Linear-Structure-Invariant (LSI) dynamical system where the underlying matrices have a fixed zero/non-zero structure but the non-zero elements are potentially time-varying. This approach allows to model the system parameters as free variables whose values may only be known within a certain tolerance. We particularly look for minimal sufficient conditions 1 on the observability and controllability of the composite network, which have a direct application in distributed estimation and in the design of networked control systems. The methodology in this paper is based on the structured systems analysis and graph theory, and therefore, the results are generic, i.e., they apply to almost all non-zero choices of free parameters. We show the controllability/observability results for composite product networks resulting from full structural-rank systems and self-damped networks. We provide an illustrative example of estimation based on Kalman filtering over a composite network to verify our results.

show abstract

Distributed Joint Attack Detection and Secure State Estimation

Cited by 62 publications

References 39 publications

Byzantine-resilient distributed observers for LTI systems

Byzantine-resilient distributed observers for LTI systems

Secure Distributed Filtering for Unstable Dynamics Under Compromised Observations

Minimal Sufficient Conditions for Structural Observability/Controllability of Composite Networks via Kronecker Product

Contact Info

Product

Resources

About