Communication-efficient probabilistic quorum systems for sensor networks

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

Volumn 2006, Issue , 2006, Pages 111-115

  Chockler, Gregory ^a   Gilbert, Seth ^b   Patt Shamir, Boaz ^c  

^a IBM RESEARCH   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH ENVIRONMENTS; COMMUNICATION FAILURES; NODE TRANSMITS; PROBABILISTIC QUORUM SYSTEMS;

BANDWIDTH; DISTRIBUTED COMPUTER SYSTEMS; ROBUSTNESS (CONTROL SYSTEMS); TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS;

SENSORS;

EID: 33750341041     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PERCOMW.2006.30     Document Type: Conference Paper

References (17)

1. D. Agrawal and A. E. Abbadi. Resilient logical structures for efficient management of replicated data. Technical report, University of California Santa Barbara, 1992.
2. H. Attiya, A. Bar-Noy, and D. Dolev. Sharing memory robustly in message-passing systems. Journal of the ACM, 42(1): 124-142, 1995.
3. M. Bearden and R. P. B. Jr. A fault-tolerant algorithm for decentralized on-line quorum adaptation. In Proceedings of the 28th International Symposium on Fault-Tolerant Computing Systems, Munich, Germany, 1998.
4. A. El Abbadi, D. Skeen, and F. Cristian. An efficient fault-tolerant protocol for replicated data management. In Proc. of the 4th Symp. on Principles of Databases, pages 215-228. ACM Press, 1985.
5. A. El Abbadi and S. Toueg. Maintaining availability in partitioned replicated databases. Transactions on Database Systems, 14(2):264-290, 1989.
6. R. Fan and N. Lynch. Efficient replication of large data objects. In Proceeding of the 17th International Conference on Distributed Computing, October 2003.
7. H. Garcia-Molina and D. Barbara. How to assign votes in a distributed system. Journal of the ACM, 32(4):841-860, 1985.
8. D. K. Gifford. Weighted voting for replicated data. In Proceedings of the seventh symposium on operating systems principles, pages 150-162, 1979.
9. S. Gilbert, N. Lynch, and A. Shvartsman. RAMBO II:: Rapidly reconfigurable atomic memory for dynamic networks. In Proc. of the Intl. Conference on Dependable Systems and Networks, pages 259-269, June 2003.
10. M. Herlihy. A quorum-consensus replication method for abstract data types. ACM Transactions on Computer Systems, 4(1):32-53, feb 1986.
11. N. Lynch and A. Shvartsman. RAMBO: A reconfigurable atomic memory service for dynamic networks. In Proc. of the 16th Intl. Symp. on Distributed Computing, pages 173-190, 2002.
12. M. Maekawa. A √N algorithm for mutual exclusion in decentralized systems. ACM Tranactions on Computer Systems, 3(2): 145-159, 1985.
13. D. Malkhi, M. Reiter, and R. Wright. Probabilistic quorum systems. In Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, pages 267-273, 1997.
14. M. Naor and U. Wieder. Access control and signatures via quorum secret sharing. IEEE Transactions on Parallel and Distributed Systems, 9(9):909-922, 1998.
15. D. Peleg and A. Wool. How to be an efficient snoop, or the probe complexity of quorum systems. SIAM Journal of Discrete Mathematics, 15(3):416-433, 2002.
16. S. Ratnasamy, B. Karp, S. Shenker, D. Estrin, R. Gvoindan, L. Yin, and F. Yu. Data-centric storage in sensornets with GHT, a geographic hash table. In ACM MONET, 2003.
17. R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. Transactions on Database Systems, 4(2): 180-209, 1979.