Probabilistic quorum systems in wireless ad hoc networks

Roy Friedman, Gabriel Kliot, Chen Avin

Research output: Contribution to conferencePaperpeer-review

12 Scopus citations

Abstract

Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their intersection guarantee to being probabilistic. This paper explores several access strategies for implementing probabilistic quorums in ad hoc networks. In particular, we present the first detailed study of asymmetric probabilistic bi-quorum systems and show its advantages in ad hoc networks. The paper includes both a formal analysis of these approaches backed by a simulation based study. In particular, we show that one of the strategies, based on Random Walks, exhibits the smallest communication overhead.

Original languageEnglish
Pages277-286
Number of pages10
DOIs
StatePublished - 13 Oct 2008
Event2008 International Conference on Dependable Systems and Networks, DSN-2008 - Anchorage, AK, United States
Duration: 24 Jun 200827 Jun 2008

Conference

Conference2008 International Conference on Dependable Systems and Networks, DSN-2008
Country/TerritoryUnited States
CityAnchorage, AK
Period24/06/0827/06/08

Fingerprint

Dive into the research topics of 'Probabilistic quorum systems in wireless ad hoc networks'. Together they form a unique fingerprint.

Cite this