Název:	On Comparative Study of Deterministic Linear Consensus-based Algorithms for Distributed Summing
Autoři:	Kenyeres, Martin Kenyeres, Jozef
Citace zdrojového dokumentu:	2019 International Conference on Applied Electronics: Pilsen, 10th – 11th September 2019, Czech Republic, p.89-94.
Datum vydání:	2019
Nakladatel:	Západočeská univerzita v Plzni
Typ dokumentu:	konferenční příspěvek conferenceObject
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)
Klíčová slova:	distribuované výpočty;bezdrátové senzorové sítě;distribuované sčítání
Klíčová slova v dalším jazyce:	distributed computing;wireless sensor networks;distributed summing
Abstrakt v dalším jazyce:	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
Práva:	© Západočeská univerzita v Plzni
Vyskytuje se v kolekcích:	Applied Electronics 2019 Applied Electronics 2019

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.