Quiescent consensus in mobile ad-hoc networks using eventually storage-free broadcasts

Authors:
François Bonnet;Paul Ezhilchelvan;Einar Vollset
Affiliations:
École Normale Supérieure de, Cachan, France;University of Newcastle, UK;University of Newcastle, UK
Venue:
Proceedings of the 2006 ACM symposium on Applied computing
Year:
2006

Citing 5
Cited 0

Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
On Quiescent Reliable Communication

SIAM Journal on Computing
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
Randomized Multivalued Consensus

ISORC '01 Proceedings of the Fourth International Symposium on Object-Oriented Real-Time Distributed Computing
Design and Performance-Study of Crash-Tolerant Protocols for Broadcasting and Reaching Consensus in MANETs

SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We solve the consensus problem using a new class of broadcasts that are very appropriate to ad-hoc networking: every broadcast message is eventually ensured to be garbage-collected, thus freeing buffers in the resource-constrained mobile devices. We identify an impossibility result, the conditions in which a consensus protocol that assumes normal, message-keeping broadcasts can work using the new broadcast, and the adaptation such a protocol would require when these conditions do not hold. The cost of achieving quiescent consensus, estimated through simulations, is shown to be affordable for hosting practical dependable applications.