Abstract

This paper examines the distributed filtering and fixed-point smoothing problems for networked systems, considering random parameter matrices, time-correlated additive noises and random deception attacks. The proposed distributed estimation algorithms consist of two stages: the first stage creates intermediate estimators based on local and adjacent node measurements, while the second stage combines the intermediate estimators from neighboring sensors using least-squares matrix-weighted linear combinations. The major contributions and challenges lie in simultaneously considering various network-induced phenomena and providing a unified framework for systems with incomplete information. The algorithms are designed without specific structure assumptions and use a covariance-based estimation technique, which does not require knowledge of the evolution model of the signal being estimated. A numerical experiment demonstrates the applicability and effectiveness of the proposed algorithms, highlighting the impact of observation uncertainties and deception attacks on estimation accuracy.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call