The Community for Technology Leaders
Pervasive Computing and Communications Workshops, IEEE International Conference on (2006)
Pisa, Italy
Mar. 13, 2006 to Mar. 17, 2006
ISBN: 0-7695-2520-2
pp: 111-117
Gregory Chockler , IBM Research
Seth Gilbert , MIT CSAIL
Boaz Patt-Shamir , Tel Aviv University
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 communication failures. 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.
INDEX TERMS
CITATION

S. Gilbert, G. Chockler and B. Patt-Shamir, "Communication-Efficient Probabilistic Quorum Systems for Sensor Networks," Pervasive Computing and Communications Workshops, IEEE International Conference on(PERCOMW), Pisa, Italy, 2006, pp. 111-117.
doi:10.1109/PERCOMW.2006.30
86 ms
(Ver 3.3 (11022016))