Finite-time Guarantees for Byzantine-Resilient Distributed State Estimation with Noisy Measurements

M. Pease, R. Shostak, and L. Lamport, “Reaching agreement in the presence of faults,” Journal of the ACM (JACM) , vol. 27, no. 2, pp. 228–234, 1980

1980

Earlier work this paper cites.

L. Lamport, R. Shostak, and M. Pease, “The byzantine generals problem,” ACM Transactions on Programming Languages and Systems (TOPLAS) , vol. 4, no. 3, pp. 382–401, 1982

1982

Earlier work this paper cites.

N. A. Lynch, Distributed Algorithms . San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1996

1996

Earlier work this paper cites.

B. Sinopoli, C. Sharp, L. Schenato, S. Schaffert, and S. S. Sastry, “Distributed control applications within sensor networks,” Proceedings of the IEEE , vol. 91, no. 8, pp. 1235–1246, 2003

2003

Earlier work this paper cites.

A. Speranzon, C. Fischione, and K. H. Johansson, “Distributed and collaborative estimation over wireless sensor networks,” in IEEE Conference on Decision and Control (CDC) , 2006, pp. 1025–1030

2006

Earlier work this paper cites.

R. Olfati-Saber, “Distributed kalman filtering for sensor networks,” in IEEE Conference on Decision and Control (CDC) , 2007, pp. 5492–5498

2007

Earlier work this paper cites.

F. Bullo, J. Cortes, and S. Martinez, Distributed control of robotic networks: a mathematical approach to motion coordination algorithms . Princeton University Press, 2009, vol. 27

2009

Earlier work this paper cites.

S. Kar and J. M. Moura, “Distributed consensus algorithms in sensor networks with imperfect communication: Link failures and channel noise,” IEEE Transactions on Signal Processing , vol. 57, no. 1, pp. 355–369, 2009

2009

Earlier work this paper cites.

J. Mattingley and S. Boyd, “Real-time convex optimization in signal processing,” IEEE Signal processing magazine , vol. 27, no. 3, pp. 50–61, 2010

2010

Earlier work this paper cites.

S. S. Stankovic, M. S. Stankovic, and D. M. Stipanovic, “Decentralized parameter estimation by consensus based stochastic approximation,” IEEE Transactions on Automatic Control , vol. 56, no. 3, pp. 531–543, 2011

2011

Earlier work this paper cites.

O. Kosut, L. Jia, R. J. Thomas, and L. Tong, “Malicious data attacks on the smart grid,” IEEE Transactions on Smart Grid , vol. 2, no. 4, pp. 645–658, 2011

2011

Earlier work this paper cites.

T. T. Kim and H. V. Poor, “Strategic protection against data injection attacks on power grids,” IEEE Transactions on Smart Grid , vol. 2, no. 2, pp. 326–333, 2011

2011

Cited alongside, same era.

S. Sundaram and C. N. Hadjicostis, “Distributed function calculation via linear iterative strategies in the presence of malicious agents,” IEEE Transactions on Automatic Control , vol. 56, no. 7, pp. 1495–1508, 2011

2011

Cited alongside, same era.

L. Xie, D.-H. Choi, S. Kar, and H. V. Poor, “Fully distributed state estimation for wide-area monitoring systems,” IEEE Transactions on Smart Grid , vol. 3, no. 3, pp. 1154–1169, 2012

2012

Cited alongside, same era.

S. Kar, J. M. Moura, and K. Ramanan, “Distributed parameter estimation in sensor networks: Nonlinear observation models and imperfect communication,” IEEE Transactions on Information Theory , vol. 58, no. 6, pp. 3575–3605, 2012

2012

Cited alongside, same era.

Y. Shoukry and P. Tabuada, “Event-triggered state observers for sparse sensor noise/attacks,” IEEE Transactions on Automatic Control , vol. 61, no. 8, pp. 2079–2091, 2016

2016

Later among the works it cites.

L. Su and N. H. Vaidya, “Non-bayesian learning in the presence of byzantine agents,” in International Symposium on Distributed Computing . Springer, 2016, pp. 414–427

2016

Later among the works it cites.

L. Su and N. H. Vaidya, “Fault-tolerant multi-agent optimization: optimal iterative distributed algorithms,” in Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing . ACM, 2016, pp. 425–434

2016

Later among the works it cites.

Y. Chen, L. Su, and J. Xu, “Distributed statistical machine learning in adversarial settings: Byzantine gradient descent,” Proceedings of the ACM on Measurement and Analysis of Computing Systems , vol. 1, no. 2, p. 44, 2017

2017

Later among the works it cites.