TSP
2010
13 years 7 months ago
2010
The problem of distributed average consensus with quantized data is considered in this correspondence. Conventional consensus algorithms suffer from divergence when quantization er...
SIAMCOMP
2010
13 years 7 months ago
2010
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
CDC
2010
IEEE
13 years 7 months ago
2010
IEEE
Over the past few years, a number of distributed algorithms have been developed for integrating the measurements acquired by a wireless sensor network. Among them, average consensu...
OPODIS
2010
13 years 10 months ago
2010
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
SIAMCOMP
1998
14 years 2 days ago
1998
We present a consensus algorithm that combines unreliable failure detection and randomization, two well-known techniques for solving consensus in asynchronous systems with crash f...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable...
PRDC
2002
IEEE
14 years 5 months ago
2002
IEEE
In this paper, we present a consensus algorithm for synchronous distributed systems using cooperating mobile agents. The algorithm is designed within a framework for mobile agent ...
CISS
2008
IEEE
14 years 7 months ago
2008
IEEE
Abstract—To achieve higher reliability, safety, and faulttolerance, many mission-critical detection and decision systems implement consensus algorithms that force the systems’ ...
CDC
2008
IEEE
14 years 7 months ago
2008
IEEE
— We study the problem of reaching a consensus in the values of a distributed system of agents with time-varying connectivity in the presence of delays. We consider a widely stud...
PODC
2009
ACM
14 years 7 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...