Title :
Performance analysis of a distributed Robbins-Monro algorithm for sensor networks
Author :
Bianchi, Pascal ; Fort, Gersende ; Hachem, Walid ; Jakubowicz, Jeremie
Author_Institution :
LTCI, TELECOM ParisTech, Barrault, France
fDate :
Aug. 29 2011-Sept. 2 2011
Abstract :
This paper investigates the rate of convergence of a distributed Robbins-Monro algorithm for sensor networks. The algorithm under study consists of two steps: a local Robbins-Monro step at each sensor and a gossip step that drives the network to a consensus. Under verifiable sufficient conditions, we give an explicit rate of convergence for this algorithm and provide a conditional Central Limit Theorem. Our results are applied to distributed source localization.
Keywords :
distributed algorithms; iterative methods; sensor placement; wireless sensor networks; Central Limit Theorem; distributed Robbins-Monro algorithm performance analysis; distributed source localization; gossip step; sensor network; Abstracts; Algorithm design and analysis; Approximation algorithms; Approximation methods; Artificial neural networks; Convergence; Performance analysis;
Conference_Titel :
Signal Processing Conference, 2011 19th European
Conference_Location :
Barcelona
