Sciweavers

Share
SAC
2006
ACM

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

9 years 1 months ago
Quiescent consensus in mobile ad-hoc networks using eventually storage-free broadcasts
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 garbagecollected, 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. Keywords Ad-hoc networking, crash-tolerance, group communication, consensus, quiescence, simulations.
François Bonnet, Paul D. Ezhilchelvan, Eina
Added 14 Jun 2010
Updated 14 Jun 2010
Type Conference
Year 2006
Where SAC
Authors François Bonnet, Paul D. Ezhilchelvan, Einar Vollset
Comments (0)
books