Distributed Parameter Estimation With Quantized Communication via Running Average

From MaRDI portal
Publication:4580776

DOI10.1109/TSP.2015.2441034zbMATH Open1394.94707arXiv1412.7281MaRDI QIDQ4580776FDOQ4580776

Yeng Chai Soh, Shanying Zhu, Lihua Xie

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: In this paper, we consider the parameter estimation problem over sensor networks in the presence of quantized data and directed communication links. We propose a two-stage algorithm aiming at achieving the centralized sample mean estimate in a distributed manner. Different from the existing algorithms, a running average technique is utilized in the proposed algorithm to smear out the randomness caused by the probabilistic quantization scheme. With the running average technique, it is shown that the centralized sample mean estimate can be achieved both in the mean square and almost sure senses, which is not observed in the conventional consensus algorithms. In addition, the rates of convergence are given to quantify the mean square and almost sure performances. Finally, simulation results are presented to illustrate the effectiveness of the proposed algorithm and highlight the improvements by using running average technique.


Full work available at URL: https://arxiv.org/abs/1412.7281







Cited In (4)





This page was built for publication: Distributed Parameter Estimation With Quantized Communication via Running Average

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580776)