Abstract
Networked systems often relies on distributed algorithms to achieve a global computation/statistic goal with iterative local information exchanges between neighbor nodes. Due to the concerns of privacy, one node usually adds a random noise to its original data for information exchange at each iteration to preserve the privacy. But a neighbor node can still infer/estimate the node's state based on the information it received, no matter what type of noises is used. However, how to obtain the optimal state estimation is a critical and open issue. Therefore, in this paper, we investigate how to obtain the optimal estimation of each node's state based on the information outputs of the node and its neighbors. Firstly, we introduce two novel definitions on the estimation, named eaccurate estimation and optimal state estimation, to depict the optimal state estimation problem. Then, we obtain the optimal state estimation and its closed-form of expression, followed with some important properties considering different available information sets for the estimation.
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 callDisclaimer: 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.
