Probabilistic quorum systems in wireless ad hoc networks

Proceedings of the International Conference on Dependable Systems and Networks

Volumn , Issue , 2008, Pages 277-286

  Friedman, Roy ^a   Kliot, Gabriel ^a   Avin, Chen ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK PROTOCOLS; NUMERICAL ANALYSIS; PROBABILITY; SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

ACCESS STRATEGIES; COMMUNICATION OVERHEADS; DEPENDABLE SYSTEMS; DISTRIBUTED COMPUTING; FORMAL ANALYSIS; HOC NETWORKS; INTERNATIONAL CONFERENCES; PROBABILISTIC QUORUMS; QUORUM SYSTEMS; RANDOM WALKS; SIMULATION BASED; WIRELESS AD HOC NETWORKS;

AD HOC NETWORKS;

EID: 53349095728     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSN.2008.4630096     Document Type: Conference Paper

References (32)

1. I. Abraham and D. Malkhi. Probabilistic quorums for dynamic systems. In DISC, pages 60-74, 2003.
2. H. Attiya, A. Bar-Noy, and D. Dolev. Sharing Memory Robustly in Message Passing Systems. J. ACM, 42(1):124-142, 1995.
3. C. Avin and C. Brito. Efficient and robust query processing in dynamic environments using RW techniques. In IPSN, pages 277-286, 2004.
4. C. Avin and G. Ercal. On the cover time and mixing time of random geometric graphs. Theor. Comput. Sci., 380(1-2), 2007.
5. Z. Bar-Yossef, R. Friedman, and G. Kliot. RaWMS - Random Walk based Lightweight Membership Service for Wireless Ad Hoc Networks. In MobiHoc, pages 238-249, June 2006.
6. S. Bhattacharya. Randomized location service in mobile ad hoc networks. In MSWlM, pages 66-73, 2003.
7. G. Chockler, M. Demirbas, S. Gilbert, C. Newport, and T. Nolte. Consensus and Collision Detectors in Wireless Ad Hoc Networks. In PODC, 2005.
8. G. Chockler, S. Gilbert, and B. Patt-Shamir. Communication-Efficient Probabilistic Quorum Systems for Sensor Networks. In PERCOMW, page 111, 2006.
9. G. Chockler, I. Keidar, and R. Vitenberg. Group Communication Specifications: a Comprehensive Study. ACM Computing Surveys, 33(4):427-469, 2001.
10. S. Dolev, S. Gilbert, N. Lynch, A. Shvartsman, and J. Welch. Geoquorums: Implementing atomic memory in mobile ad hoc networks. In DISC, 2003.
11. S. Dolev, E. Schiller, and J. Welch. Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks. In PODC, pages 259-259, 2002.
12. R. Friedman and G. Kliot. Location Services in Wireless Ad Hoc and Hybrid Networks: A Survey. TR CS-2006-10, Technion, January 2006.
13. H. Garcia-Molina and D. Barbara. How to assign votes in a distributed system. J. ACM, 32(4):841-860, 1985.
14. D. K. Gifford. Weighted Voting for Replicated Data. In SOSP, pages 150-162, December 1979.
15. V. Gramoli. Distributed Shared Memory for Large-Scale Dynamic Systems. PhD thesis, 2007.
16. R. Guerraoui and M. Raynal. The Information Structure of Indulgent Consensus. IEEE Trans. on Comput., 53(4):453-466, 2004.
17. P. Gupta and P. Kumar. Critical Power for Asymptotic Connectivity in Wireless Networks. In Stochastic Analysis, Control, Optimization and Applications, pages 547-566, 1998.
18. Z. Haas and B. Liang. Ad Hoc mobility management with randomized database groups. In ICC, June 1999.
19. M. Herlihy. A quorum-consensus replication method for abstract data types. ACM Trans. Comput. Syst.,4(1):32-53, 1986.
20. M. Herlihy. Dynamic quorum adjustment for partitioned data. ACM Trans. Database Syst., 12(2):170-194, 1987.
21. J. Li, J. Jannotti, D. De Couto, D. Karger, and R. Morris. A scalable location service for geographic ad-hoc routing. In MobiCom, pages 120-130, August 2000.
22. L. Lovász. Random Walks on Graphs: A Survey. Combinatorics, 2:1-46, 1993.
23. J. Luo, P. Eugster, and J. Hubaux. Pilot: Probabilistic lightweight group communication system for ad hoc networks. IEEE Transactions on Mobile Computing, 3(2): 164-179, April 2004.
24. J. Luo, J.-P. Hubaux, and P.Th. Eugster. PAN: Providing reliable storage in mobile ad hoc networks with probabilistic quorum systems. In MobiHoc, pages 1-12, 2003.
25. Nancy A. Lynch and Alexander A. Shvartsman. RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks. In DISC, pages 173-190, 2002.
26. N. Madras and G. Slade. The self-avoiding walk. Birkhauser, 1993.
27. D. Malkhi, M. Reiter, A. Wool, and R. Wright. Probabilistic Quorum Systems. The Information and Computation Journal, 170(2):184-206, November 2001.
28. R. Melamed, I. Keidar, and Y. Barel. Octopus: A Fault-Tolerant and Efficient Ad-hoc Routing Protocol. In SRDS, October 2005.
29. N. Mitchell, M. Mizuno, and M. Raynal. A General Method to Define Quorums. In ICDCS, pages 657-664, 1992.
30. S. Servetto and G. Barrenechea. Constrained Random Walks on Random Graphs: Routing Algorithms for Large Scale Wireless Sensor Networks. In WSNA, 2002.
31. I. Stojmenovic. A routing strategy and quorum based location update scheme for ad hoc wireless networks. Computer Science, SITE, University of Ottawa, TR-99-09, September 1999.
32. J. Tchakarov and N.H. Vaidya. Efficient Content Location in Wireless Ad Hoc Networks. In MDM, January 2004.