On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Distributed agreement in the presence of processor and communication faults
IEEE Transactions on Software Engineering
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
A tradeoff between safety and liveness for randomized coordinated attack
Information and Computation
Failure detectors in omission failure environments
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Algorithms
STACS '89 Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey)
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Some constraints and tradeoffs in the design of network communications
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
An asynchronous [(n - 1)/3]-resilient consensus protocol
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Consensus in Asynchronous Systems Where Processes Can Crash and Recover
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Failure detection and consensus in the crash-recovery model
Distributed Computing
Solving Vector Consensus with a Wormhole
IEEE Transactions on Parallel and Distributed Systems
A Note on a Simple Equivalence between Round-based Synchronous and Asynchronous Models
PRDC '05 Proceedings of the 11th Pacific Rim International Symposium on Dependable Computing
Experimental Comparison of Local and Shared Coin Randomized Consensus Protocols
SRDS '06 Proceedings of the 25th IEEE Symposium on Reliable Distributed Systems
Tolerating corrupted communication
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Agreement in synchronous networks with ubiquitous faults
Theoretical Computer Science
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Impossibility Results and Lower Bounds for Consensus under Link Failures
SIAM Journal on Computing
Timeout-based adaptive consensus: improving performance through adaptation
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Hi-index | 0.01 |
Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model these networks as distributed systems prone to dynamic communication failures. This captures transitory disconnections in communication due to phenomena like interference and collisions, and permits an efficient use of the wireless broadcasting medium. This model, however, is bound by the impossibility result of Santoro and Widmayer, which states that, even with strong synchrony assumptions, there is no deterministic solution to any non-trivial form of agreement if n - 1 or more messages can be lost per communication round in a system with n processes. In this paper we propose a novel way to circumvent this impossibility result by employing randomization. We present a consensus protocol that ensures safety in the presence of an unrestricted number of omission faults, and guarantees progress in rounds where such faults are bounded by f ≤ ⌈n/2⌉(n-k)+k - 2, where k is the number of processes required to decide, eventually assuring termination with probability 1.