Distributed parameter estimation over unreliable networks with markovian switching topologies

102Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Due to the existence of various uncertainties, the design of distributed estimation algorithms with robustness and high accuracy is an urgent demand for sensor network applications. This paper is aimed at investigating the design of distributed parameter estimation algorithms and the analysis of their convergence properties in uncertain sensing and communication environments. Consensus-based distributed parameter estimation algorithms for both discrete-time and continuous-time cases are established, which are suitable for unreliable communication networks with stochastic communication noises, random link gains and Markovian signal losses. Under mild conditions on stochastic noises, gain function and topology-switching Markov chain, we establish both the mean square and almost sure convergence of the designed algorithms by use of probability limit theory, algebraic graph theory, stochastic differential equation theory and Markov chain theory. The effect of sensor-dependent gain functions on the convergence of the algorithm is also analyzed. © 2012 IEEE.

Cite

CITATION STYLE

APA

Zhang, Q., & Zhang, J. F. (2012). Distributed parameter estimation over unreliable networks with markovian switching topologies. IEEE Transactions on Automatic Control, 57(10), 2545–2560. https://doi.org/10.1109/TAC.2012.2188353

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free