Communication-efficient probabilistic quorum systems for sensor networks

Gregory Chockler*, Seth Gilbert, Boaz Patt-Shamir

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Communication-efficiency is of key importance when constructing robust services in limited bandwidth environments, such as sensor networks. We focus on communication-efficiency in the context of quorum systems, which are useful primitives for building reliable distributed systems. To this end, we exhibit a new probabilistic quorum construction in which every node transmits at most O(log 2 n) bits per quorum access, where n is the number of nodes in the system. Our implementation, in addition to being communication efficient, is also robust in the face of communicationfailures. In particular, it guarantees consistency (with high probability) in the face of network partitions. To the best of our knowledge, no existing probabilistic quorum systems achieve polylogarithmic communication complexity and are resilient to network partitions.

Original languageEnglish
Title of host publicationProceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006
Pages111-115
Number of pages5
DOIs
StatePublished - 2006
Event4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006 - Pisa, Italy
Duration: 13 Mar 200617 Mar 2006

Publication series

NameProceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006
Volume2006

Conference

Conference4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006
Country/TerritoryItaly
CityPisa
Period13/03/0617/03/06

Fingerprint

Dive into the research topics of 'Communication-efficient probabilistic quorum systems for sensor networks'. Together they form a unique fingerprint.

Cite this