Secure Distributed State Estimation of an LTI System Over Time-Varying Networks and Analog Erasure Channels

Abstract

We study the problem of collaboratively estimating the state of an LTI system monitored by a network of sensors, subject to the following important practical considerations: (i) certain sensors might be arbitrarily compromised by an adversary and (ii) the underlying communication graph governing the flow of information across sensors might be time-varying. We first analyze a scenario involving intermittent communication losses that preserve certain information flow patterns over bounded intervals of time. By equipping the sensors with adequate memory, we show that one can obtain a fully distributed, provably correct state estimation algorithm that accounts for arbitrary adversarial behavior, provided certain conditions are met by the network topology. We then argue that our approach can handle bounded communication delays as well. Next, we explore a case where each communication link stochastically drops packets based on an analog erasure channel model. For this setup, we propose state estimate update and information exchange rules, along with conditions on the network topology and packet drop probabilities, that guarantee mean-square stability despite arbitrary adversarial attacks.

Resilient Leader-Follower Consensus to Arbitrary Reference Values in Time-Varying Graphs

“…In [9], the problem of resilient distributed estimation is considered where certain "reliable agents" drive the errors of the remaining normal agents to the static reference value of zero in the presence of misbehaving agents. In [10], [13], the problem of distributed, resilient estimation in the presence of misbehaving nodes is treated. The authors show conditions under which information about the decoupled modes of the system is resiliently transmitted from a group of source nodes to other nodes that cannot observe those modes.…”

Distributed estimation based on multi-hop subspace decomposition

“…. , i } are defined in (13)- (14) (see also (16)), that is, ) is the empty matrix for all ρ ∈ { i + 2, . .…”

Finite-Time Resilient Formation Control with Bounded Inputs

“…Our method employs a graph-theoretical structure which we call a Resilient Directed Acyclic Graph (RDAG). This structure is a special case of a class of graphs called Mode Estimated Directed Acyclic Graphs (MEDAGs) [20], and is defined as follows:…”