Convergence of a distributed parameter estimator for sensor networks with local averaging of the estimates

P. Bianchi, G. Fort, W. Hachem, J. Jakubowicz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The paper addresses the convergence of a decentralized Robbins-Monro algorithm for networks of agents. This algorithm combines local stochastic approximation steps for finding the root of an objective function, and a gossip step for consensus seeking between agents. We provide verifiable sufficient conditions on the stochastic approximation procedure and on the network so that the decentralized Robbins-Monro algorithm converges to a consensus. We also prove that the limit points of the algorithm correspond to the roots of the objective function. We apply our results to Maximum Likelihood estimation in sensor networks.

Original languageEnglish
Title of host publication2011 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011 - Proceedings
Pages3764-3767
Number of pages4
DOIs
Publication statusPublished - 18 Aug 2011
Externally publishedYes
Event36th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011 - Prague, Czech Republic
Duration: 22 May 201127 May 2011

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN (Print)1520-6149

Conference

Conference36th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011
Country/TerritoryCzech Republic
CityPrague
Period22/05/1127/05/11

Fingerprint

Dive into the research topics of 'Convergence of a distributed parameter estimator for sensor networks with local averaging of the estimates'. Together they form a unique fingerprint.

Cite this