分布式robins - monro算法在传感器网络中的性能分析

2011 19th European Signal Processing Conference Pub Date : 2011-08-29 DOI:10.5281/ZENODO.42562

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

{"title":"分布式robins - monro算法在传感器网络中的性能分析","authors":"P. Bianchi, G. Fort, W. Hachem, J. Jakubowicz","doi":"10.5281/ZENODO.42562","DOIUrl":null,"url":null,"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.","PeriodicalId":331889,"journal":{"name":"2011 19th European Signal Processing Conference","volume":"47 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Performance analysis of a distributed Robbins-Monro algorithm for sensor networks\",\"authors\":\"P. Bianchi, G. Fort, W. Hachem, J. Jakubowicz\",\"doi\":\"10.5281/ZENODO.42562\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":331889,\"journal\":{\"name\":\"2011 19th European Signal Processing Conference\",\"volume\":\"47 4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-08-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 19th European Signal Processing Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5281/ZENODO.42562\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 19th European Signal Processing Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5281/ZENODO.42562","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

本文研究了传感器网络的分布式罗宾斯-门罗算法的收敛速度。所研究的算法包括两个步骤:每个传感器的局部罗宾斯-门罗步骤和驱动网络达成共识的八卦步骤。在可验证的充分条件下，给出了该算法的显式收敛速度，并给出了一个条件中心极限定理。我们的结果应用于分布式源定位。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Performance analysis of a distributed Robbins-Monro algorithm for sensor networks

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 19th European Signal Processing Conference

自引率

0.00%

发文量