2016 · 60 citations · 20 references
ComputingComputer ScienceSystems EngineeringDistributed SystemsDynamical SystemsSystem DynamicsDirected Acyclic GraphsDistributed AlgorithmsDistributed ComputingDistributed SecurityDistributed Sensor NetworksNetworked Systems ModelingAdversarial RobustnessAdversary ModelDistributed EstimationDistributed ObserversDistributed State EstimationLinear Time-invariant SystemsMeasurementSecure State Estimation
We study the problem of distributed state estimation of a linear time-invariant system by a network of nodes, some of which are subject to adversarial attacks. We develop a secure distributed estimation strategy subject to an f-locally bounded Byzantine adversary model, where a compromised node can arbitrarily deviate from the rules of any prescribed algorithm. Under such a threat model, we provide sufficient conditions guaranteeing the success of our estimation strategy. Our method relies on the construction of a subgraph, which we call a Mode Estimation Directed Acyclic Graph (MEDAG), for each unstable and marginally stable eigenvalue of the plant. We provide a distributed algorithm for constructing a MEDAG and characterize graph topologies for which the construction algorithm is guaranteed to succeed. Our approach provides fundamental insights into the relationship between the dynamics of the system, the measurement structure of the nodes, and the underlying graph topology.
20
Distributed Kalman filtering for sensor networks
Reza Olfati‐Saber · 2007 · 1.6K citations
Distributed Kalman Filter with Embedded Consensus Filters
Reza Olfati‐Saber · 2006 · 1K citations
Reaching approximate agreement in the presence of faults
Danny Dolev, Nancy Lynch, Shlomit S. Pinter et al. · Journal of the ACM · 1986 · 522 citations · Full text
Distributed fault detection for interconnected second-order systems
Iman Shames, André Teixeira, Henrik Sandberg et al. · Automatica · 2011 · 399 citations · Full text