ePrints

Quiescent Consensus in Mobile Ad-hoc Networks using Eventually Storage-Free Broadcasts

Lookup NU author(s): Francois Bonnet, Dr Paul EzhilchelvanORCiD, Einar Vollset

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

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.

Publication metadata

Author(s): Bonnet F, Ezhilchelvan P, Vollset E

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: Applied Computing 2006: the 21st annual ACM Symposium on Applied Computing

Year of Conference: 2006

Pages: 670-674

Publisher: ACM

Share