{"title":"广义Metropolis-Hastings算法在无线传感器网络中的适用性","authors":"M. Kenyeres, J. Kenyeres","doi":"10.1109/EUROCON.2019.8861554","DOIUrl":null,"url":null,"abstract":"The Metropolis-Hastings algorithm has found wide application in various areas since its definition. In this paper, the applicability of its generalized variant for distributed averaging in the wireless sensor networks is analyzed. Hence, its execution is bounded by a stopping criterion proposed for these networks to analyze which initial configuration of the implemented stopping criterion and the mixing parameter ensure the highest performance in terms of the mean square error and the convergence rate expressed as the number of the iterations necessary for the consensus achievement. The performance of the algorithm and the implemented stopping criterion is analyzed over 100 random geometric graphs and the obtained results are compared.","PeriodicalId":232097,"journal":{"name":"IEEE EUROCON 2019 -18th International Conference on Smart Technologies","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Applicability of Generalized Metropolis-Hastings Algorithm in Wireless Sensor Networks\",\"authors\":\"M. Kenyeres, J. Kenyeres\",\"doi\":\"10.1109/EUROCON.2019.8861554\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Metropolis-Hastings algorithm has found wide application in various areas since its definition. In this paper, the applicability of its generalized variant for distributed averaging in the wireless sensor networks is analyzed. Hence, its execution is bounded by a stopping criterion proposed for these networks to analyze which initial configuration of the implemented stopping criterion and the mixing parameter ensure the highest performance in terms of the mean square error and the convergence rate expressed as the number of the iterations necessary for the consensus achievement. The performance of the algorithm and the implemented stopping criterion is analyzed over 100 random geometric graphs and the obtained results are compared.\",\"PeriodicalId\":232097,\"journal\":{\"name\":\"IEEE EUROCON 2019 -18th International Conference on Smart Technologies\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE EUROCON 2019 -18th International Conference on Smart Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EUROCON.2019.8861554\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE EUROCON 2019 -18th International Conference on Smart Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EUROCON.2019.8861554","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Applicability of Generalized Metropolis-Hastings Algorithm in Wireless Sensor Networks
The Metropolis-Hastings algorithm has found wide application in various areas since its definition. In this paper, the applicability of its generalized variant for distributed averaging in the wireless sensor networks is analyzed. Hence, its execution is bounded by a stopping criterion proposed for these networks to analyze which initial configuration of the implemented stopping criterion and the mixing parameter ensure the highest performance in terms of the mean square error and the convergence rate expressed as the number of the iterations necessary for the consensus achievement. The performance of the algorithm and the implemented stopping criterion is analyzed over 100 random geometric graphs and the obtained results are compared.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
