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

• Published version [.pdf]

Abstract

We solve the consensus problem using a new class of broad-casts 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 whicha 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 PD, Vollset EW

Publication type: Report

Publication status: Published

Series Title: School of Computing Science Technical Report Series

Year: 2005

Pages: 8

Print publication date: 01/11/2005

Source Publication Date: November 2005

Report Number: 933

Institution: School of Computing Science, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne

URL: http://www.cs.ncl.ac.uk/publications/trs/papers/933.pdf

Share