Resilient Distributed Estimation Through Adversary Detection

From MaRDI portal
Publication:4622136

DOI10.1109/TSP.2018.2813330zbMATH Open1415.94319arXiv1701.00878WikidataQ130150667 ScholiaQ130150667MaRDI QIDQ4622136FDOQ4622136

Soummya Kar, José M. F. Moura, Yuan Chen

Publication date: 12 February 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: This paper studies resilient multi-agent distributed estimation of an unknown vector parameter when a subset of the agents is adversarial. We present and analyze a Flag Raising Distributed Estimator (mathcalFRDE) that allows the agents under attack to perform accurate parameter estimation and detect the adversarial agents. The mathcalFRDE algorithm is a consensus+innovations estimator in which agents combine estimates of neighboring agents (consensus) with local sensing information (innovations). We establish that, under mathcalFRDE, either the uncompromised agents' estimates are almost surely consistent or the uncompromised agents detect compromised agents if and only if the network of uncompromised agents is connected and globally observable. Numerical examples illustrate the performance of mathcalFRDE.


Full work available at URL: https://arxiv.org/abs/1701.00878




Recommendations




Cited In (12)





This page was built for publication: Resilient Distributed Estimation Through Adversary Detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4622136)