Title: On Comparative Study of Deterministic Linear Consensus-based Algorithms for Distributed Summing
Authors: Kenyeres, Martin
Kenyeres, Jozef
Citation: 2019 International Conference on Applied Electronics: Pilsen, 10th – 11th September 2019, Czech Republic, p.89-94.
Issue Date: 2019
Publisher: Západočeská univerzita v Plzni
Document type: konferenční příspěvek
URI: http://hdl.handle.net/11025/35521
ISBN: 978–80–261–0812–2 (Online)
978–80–261–0813–9 (Print)
ISSN: 1803–7232 (Print)
1805-9597 (Online)
Keywords: distribuované výpočty;bezdrátové senzorové sítě;distribuované sčítání
Keywords in different language: distributed computing;wireless sensor networks;distributed summing
Abstract in different language: The exact information about the network size is crucial for the proper functioning of many distributed algorithms. In this paper, we analyze the average consensus algorithm for a distributed network size estimation bounded by the stopping criterion proposed for the wireless sensor networks. We analyze its four initial configurations over random geometric graphs of different connectivity under various parameters of the implemented stopping criterion. The performance is evaluated by the mean square error and the convergence rate expressed as the iteration number for the consensus. Finally, the results obtained under various conditions are compared to find the best performing configuration of both the average consensus algorithm and the implemented stopping criterion. Also, the results are compared to the distributed summing functionality
Rights: © Západočeská univerzita v Plzni
Appears in Collections:Applied Electronics 2019
Applied Electronics 2019

Files in This Item:
File Description SizeFormat 
Kenyeres.pdfPlný text366,72 kBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/35521

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