Abstract
Distributed estimation over networks has attracted great attention for its wide applicability in source tracking, environmental monitoring, etc. In the problem of distributed estimation, a set of nodes collectively estimates some parameter from noisy measurements. Most distributed algorithms assume that the information shared among nodes has full-precision. However, this assumption is unrealistic as communication channels among nodes have limited bandwidth. Considering this, in this paper, we impose quantization constraints on distributed estimation problem. That is, nodes can only receive quantized information from neighbors. The quantization inevitably brings in errors. Each node has to decide carefully which information provided by the neighbors is more trustworthy since these information could suffer from various degrees of distortion caused by the errors. To make good use of the aggregated information, we propose an adaptive combination strategy for quantized distributed estimation algorithms. We derive sufficient conditions for convergence of the resulting algorithm through mean-square analysis. The advantages of the proposed adaptive combiner over fixed combiners are illustrated experimentally.
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 Signal and Information Processing over Networks
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.
