Robust Gossiping for Distributed Average Consensus in IoT Environments
نویسندگان
چکیده
منابع مشابه
Robust gossiping with an application to consensus
We study deterministic gossiping in synchronous systems with dynamic crash failures. Each processor is initialized with an input value called rumor. In the standard gossip problem, the goal of every processor is to learn all the rumors. When processors may crash, then this goal needs to be revised, since it is possible, at a point in an execution, that certain rumors are known only to processor...
متن کاملDistributed Consensus Formation Through Unconstrained Gossiping
Gossip algorithms are widely used to solve the distributed consensus problem, but issues can arise when nodes receive multiple signals either at the same time or before they are able to finish processing their current work load. Specifically, a node may assume a new state that represents a linear combination of all received signals; even if such a state makes no sense in the problem domain. As ...
متن کاملDistributed Stopping for Average Consensus in Digraphs
We consider how iterative strategies for asymptotic average consensus in directed graphs (digraphs) can be adapted so that the nodes can determine, in a distributed fashion, a stopping criterion that allows them to terminate the execution of the iteration when approximate average consensus has been reached. The nodes are said to have reached approximate average consensus when each of them has a...
متن کاملSource Coding Optimization for Distributed Average Consensus
PILGRIM, RYAN ZACHARY. Source Coding Optimization for Distributed Average Consensus. (Under the direction of Dror Baron.) Consensus is a common method for computing a function of the data distributed among the nodes of a network. Of particular interest is distributed average consensus, whereby the nodes iteratively compute the sample average of the data stored at all the nodes of the network us...
متن کاملEntropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2018.2886130