PERFORMANCE ANALYSIS OF A DISTRIBUTED ROBBINS-MONRO ALGORITHM FOR SENSOR NETWORKS

被引:0
|
作者
Bianchi, Pascal [1 ]
Fort, Gersende [1 ]
Hachem, Walid [1 ]
Jakabowicz, Jeremie [1 ]
机构
[1] TELECOM ParisTech, CNRS, LTC, 46 Rue Barrault, F-75634 Paris 13, France
关键词
STOCHASTIC-APPROXIMATION; CONVERGENCE;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper investigates the rate of convergence of a distributed Robbins-Morro algorithm for sensor networks. The algorithm under study consists of two steps: a local Robbins-Morro 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.
引用
收藏
页码:1030 / 1034
页数:5
相关论文
共 50 条