Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorWang, H-
dc.contributor.authorLiao, X-
dc.contributor.authorWang, Z-
dc.contributor.authorHuang, T-
dc.contributor.authorChen, G-
dc.identifier.citationNeural Networks, 73: pp. 1 - 9, (2016)en_US
dc.description.abstractIn this paper, we present an asynchronous algorithm to estimate the unknown parameter under an unreliable network which allows new sensors to join and old sensors to leave, and can tolerate link failures. Each sensor has access to partially informative measurements when it is awakened. In addition, the proposed algorithm can avoid the interference among messages and effectively reduce the accumulated measurement and quantization errors. Based on the theory of stochastic approximation, we prove that our proposed algorithm almost surely converges to the unknown parameter. Finally, we present a numerical example to assess the performance and the communication cost of the algorithm.en_US
dc.description.sponsorshipThis work was supported in part by the National Natural Science Foundation of China under Grant 61503308 and Grant 61472331, in part by the Natural Science Foundation Project of Chongqing CSTC 2015jcyjA40043, and in part by Fundamental Research Funds for the Central Universities under Grant SWU114036. This publication was made possible by NPRP grant #4-1162-1-181 from the Qatar National Research Fund (a member of Qatar Foundation).en_US
dc.format.extent1 - 9-
dc.subjectBroadcast gossip algorithmen_US
dc.subjectDistributed parameter estimationen_US
dc.subjectQuantized communicationen_US
dc.subjectUnreliable sensor networksen_US
dc.titleDistributed parameter estimation in unreliable sensor networks via broadcast gossip algorithmsen_US
dc.relation.isPartOfNeural Networks-
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf359.66 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.