Abstract
This brief investigates the distributed state estimation problem for networked systems. Based on the coupled measurements and information exchanged with neighboring nodes, we propose a distributed estimation algorithm for each node to obtain the state estimate, which is equivalent to the centralized weighted least-squares (WLS) one. When the communication network of the system consists of an acyclic graph, the distributed state estimation algorithm converges in finite iterations. Then we demonstrate that the size of the abstract graph determines the number of iterations. Furthermore, we propose an algorithm for detecting false data attacks by distributed calculation. Finally, the numerical results verify the effectiveness of developed algorithms.
Sign-in/Register to access full text options 
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 callMore From: IEEE Transactions on Circuits and Systems II: Express Briefs
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
