Probabilistic quorum systems in wireless ad hoc networks

ACM Transactions on Computer Systems

Volumn 28, Issue 3, 2010, Pages

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

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b MICROSOFT RESEARCH   (United States)

^c BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Distributed middleware; Location service; Quorums systems; Random walks; Wireless ad hoc networks

Indexed keywords

BIQUORUM; COMMUNICATION OVERHEADS; DISTRIBUTED COMPUTING; DISTRIBUTED MIDDLEWARE; EXTENSIVE SIMULATIONS; FORMAL ANALYSIS; LOCATION SERVICE; NETWORK DENSITY; NETWORK SIZE; NON-UNIFORM ACCESS; PEER-TO-PEER NETWORKS; PROBABILISTIC QUORUM SYSTEM; PROBABILISTIC QUORUMS; QUORUMS SYSTEMS; RANDOM WALK;

MIDDLEWARE; RANDOM PROCESSES; WIRELESS AD HOC NETWORKS;

AD HOC NETWORKS;

EID: 77957555574     PISSN: 07342071     EISSN: 15577333     Source Type: Journal    
DOI: 10.1145/1841313.1841315     Document Type: Article

References (71)

1. ABRAHAM, I., DOLEV, D., AND MALKHI, D. 2004. LLS: A locality aware location service for mobile ad hoc networks. In Proceedings of the Joint Workshop on Foundations of Mobile Computing (DIALM-POMC). 75-84.
2. ABRAHAM, I. AND MALKHI, D. 2003. Probabilistic quorums for dynamic systems. In Proceedings of the 16th International Symposium on Distributed Computing (DISC). 60-74.
3. ALVISI, L., PIERCE, E. T.,MALKHI, D., REITER, M. K., AND WRIGHT, R. N. 2000. Dynamic Byzantine quorum systems. In Proceedings of the International Conference on Dependable Systems and Networks (DSN). 283.
4. ATTIYA, H., BAR-NOY, A., AND DOLEV, D. 1995. Sharing memory robustly in message passing systems. J. ACM 42, 1, 124-142.
5. ATTIYA, H. AND WELCH, J. 1998. Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw Hill.
6. AVIN, C. AND BRITO, C. 2004. Efficient and robust query processing in dynamic environments using random walk techniques. In Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN). 277-286.
7. AVIN, C. AND ERCAL, G. 2007. On the cover time and mixing time of random geometric graphs. Theor. Comput. Sci. 380, 1-2, 2-22.
8. BALDONI, R., MARCHETTI, C., VIRGILLITO, A., AND VITENBERG, R. 2005. Content-Based publishsubscribe over structured overlay networks. In Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS). 437-446.
9. BAR-YOSSEF, Z., FRIEDMAN, R., AND KLIOT, G. 2008. RaWMS-Random walk based lightweight membership service for wireless ad hoc networks. ACM Trans. Comput. Syst. 26, 2, 1-66.
10. BARR, R., HAAS, Z. J., AND VAN RENESSE, R. 2005. JiST/SWANS Java in simulation time/scalable wireless ad hoc network simulator. http://jist.ece. cornell.edu/.
11. BETTSTETTER, C., RESTA, G. AND SANTI, P. 2003. The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Trans. Mobile Comput. 2, 3, 257-269.
12. BHATTACHARYA, S. 2003. Randomized location service in mobile ad hoc networks. In Proceedings of the 6th ACM International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems (MSWIM). 66-73.
13. BROCH, J.,MALTZ, D. A., JOHNSON, D. B.,HU, Y.-C., AND JETCHEVA, J. 1998. A performance comparison of multi-hop wireless ad hoc network routing protocols. In Proceedings of the 4th ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom). 85-97.
14. CHOCKLER, G.,DEMIRBAS, M.,GILBERT, S.,NEWPORT, C., AND NOLTE, T. 2005. Consensus and collision detectors in wireless ad hoc networks. In Proceedings of the 24th Symposium on the Principles of Distributed Computing (PODC).
15. CHOCKLER, G., GILBERT, S., AND PATT-SHAMIR, B. 2006. Communication- Efficient probabilistic quorum systems for sensor networks. In Proceedings of the 4th International Conference on Pervasive Computing and Communication Workshops (PERCOMW). 111.
16. CHOCKLER, G., KEIDAR, I., AND VITENBERG, R. 2001. Group communication specifications: A comprehensive study. ACM Comput. Surv. 33, 4, 427-469.
17. DOLEV, S.,GILBERT, S.,LYNCH, N.,SHVARTSMAN, A., ANDWELCH, J. 2003. Geoquorums: Implementing atomic memory in mobile ad hoc networks. In Proceedings of the 17th International Symposium on Distributed Computing (DISC).
18. DOLEV, S., SCHILLER, E., AND WELCH, J. 2002. Random walk for self-stabilizing group communication in ad hoc networks. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC). 259-259
19. DUTTA, P.,GUERRAOUI, R.,LEVY, R. R., AND CHAKRABORTY, A. 2004. How fast can a distributed atomic read be? In Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC). 236-245.
20. FEIGE, U. 1996. A fast randomized LOGSPACE algorithm for graph connectivity. Theor. Comput. Sci. 169, 2, 147-160.
21. FRIEDMAN, R. AND KLIOT, G. 2006. Location services in wireless ad hoc and hybrid networks: A survey. Tech. rep. CS-2006-2010, Technion, Haifa, Israel. http://www.cs.technion.ac.il/users/ wwwb/cgi-bin/tr-info.cgi?2006/CS/CS-2006-10.
22. FRIEDMAN, R.,RAYNAL,M., AND TRAVERS,C. 2005. Two abstractions for implementing atomic objects in dynamic systems. In Proceedings of the International Conference on Principles of Distributed Systems (OPODIS). 73-87.
23. GARCIA-MOLINA, H. AND BARBARA, D. 1985. How to assign votes in a distributed system. J. ACM 32, 4, 841-860.
24. GIFFORD, D. K. 1979. Weighted voting for replicated data. In Proceedings of the 7th Symposium on Operating System Principles (SOSP). 150-162.
25. GKANTSIDIS, C., MIHAIL, M., AND SABERI, A. 2004. Random walks in peer-to-peer networks. In Proceedings of the 23rd Conference of the IEEE Communications Society (InfoCom). 259-259
26. GRAMOLI, V. 2007. Distributed shared memory for large-scale dynamic systems. Ph.D. thesis, University of Rennes 1.
27. GUERRAOUI, R. AND RAYNAL, M. 2004. The information structure of indulgent consensus. IEEE Trans. Comput. 53, 4, 453-466.
28. GUPTA, P. AND KUMAR, P. 1998. Critical power for asymptotic connectivity in wireless networks. In Stochastic Analysis, Control, Optimization and Applications. 547-566.
29. GUPTA, P. AND KUMAR, P. 2000. The capacity of wireless networks. IEEE Trans. Inf. Theory 46, 2, 388-404.
30. HAAS, Z. AND LIANG, B. 1999a. Ad hoc mobility management with randomized database groups. In Proceedings of IEEE International Conference on Communications (ICC).
31. HAAS, Z. AND LIANG, B. 1999b. Ad hoc mobility management with uniform quorum systems. IEEE/ACM Trans. Netw. 7, 2, 228-240.
32. HERLIHY, M. 1986. A quorum-consensus replication method for abstract data types. ACM Trans. Comput. Syst. 4, 1, 32-53.
33. HERLIHY, M. 1987. Dynamic quorum adjustment for partitioned data. ACM Trans. Datab. Syst. 12, 2, 170-194.
34. HERLIHY, M. AND WING, J. 1990. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12, 3, 463-492.
35. HOC NETWORKSWORKING GROUP, I. M. A. 2007. MANET neighborhood discovery protocol (NHDP). http://tools.ietf.org/html/draft-ietf-manet-nhdp-07.txt.
36. HUBAUX, J.-P., GROSS, T., BOUDEC, J.-Y. L., AND VETTERLI, M. 2001. Towards self-organizing mobile ad hoc networks: The terminodes project. IEEE Comm. Mag. 39, 1, 118-124.
37. IEEE COMPUTER SOCIETY. 2007. 802.11: Wireless LAN media access control (MAC) and physical layer (PHY) specifications. http://standards.ieee.org/ getieee802/802.11.html.
38. IETF MOBILE AD-HOC NETWORKSWORKING GROUP. 2008. MANET neighborhood discovery protocol. http://tools.ietf.org/html/draft-ietf-manet-nhdp-07.txt.
39. IETF MOBILE AD-HOC NETWORKSWORKING GROUP. 2008. RFC 5148: Jitter considerations in mobile ad hoc networks (MANETs). www.ietf.org/rfc/rfc5148.txt.
40. KARUMANCHI, G.,MURALIDHARAN, S., AND PRAKASH, R. 1999. Information dissemination in partitionable mobile ad hoc networks. In Proceedings of the Symposium on Reliable Distributed Systems. 4-13.
41. KEIDAR, I. AND MELAMED, R. 2006. Evaluating unstructured peer-to-peer lookup overlays. In Proceedings of the ACM Symposium on Applied Computing (SAC). 675-679.
42. KESHAVARZ-HADDAD, A., RIBEIRO, V., AND RIEDI, R. 2006. Broadcast capacity in multihop wireless networks. In Proceedings of the 12th International Conference on Mobile Computing and Networking (MobiCom). 239-250.
43. KLIOT, G. 2008. Wireless signal interference models made simple. www.cs.technion.ac.il/ ~gabik/Jist-Swans/signal-interference.
44. LAMPORT, L. 1986. On interprocess communication. Distrib. Comput. 1, 2, 77-101.
45. LI, J., JANNOTTI, J., DE COUTO, D., KARGER, D., AND MORRIS, R. 2000. A scalable location service for geographic ad-hoc routing. In Proceedings of the 6th International Conference on Mobile Computing and Networking (MobiCom). 120-130.
46. LOVÁSZ, L. 1993. Random walks on graphs: A survey. Combinatorics 2, 1-46.
47. LUO, J., EUGSTER, P., AND HUBAUX, J. 2004. Pilot: Probabilistic lightweight group communication system for ad hoc networks. IEEE Trans. Mobile Comput. 3, 2, 164-179.
48. LUO, J., HUBAUX, J.-P., AND EUGSTER, P. 2003. PAN: Providing reliable storage in mobile ad hoc networks with probabilistic quorum systems. In Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 1-12.
49. LV, C., CAO, P., COHEN, E., LI, K., AND SHENKER, S. 2002. Search and replication in unstructured peer-to-peer networks. In Proceedings of the 16th International Conference on Supercomputing (ICS). 84-95. (Pubitemid 35039987)
50. LYNCH, N. 1996. Distributed Algorithms. Morgan Kaufman.
51. LYNCH, N. A. AND SHVARTSMAN, A. A. 2002. RAMBO: A reconfigurable atomic memory service for dynamic networks. InProceedings of the 16th International Conference on Distributed Computing (DISC). 173-190.
52. MADRAS, N. AND SLADE, G. 1993. The Self-Avoiding Walk. Birkhauser, Boston, MA.
53. MALKHI, D.,REITER,M.,WOOL, A., ANDWRIGHT, R. 2001. Probabilistic quorum systems. The Inform. Comput. J. 170, 2, 184-206.
54. MALKHI, D. AND REITER, M. K. 1998. Secure and scalable replication in phalanx. In Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems (SRDS). 51.
55. MARTIN, J.-P. AND ALVISI, L. 2004. A framework for dynamic byzantine storage. In Proceedings of the 34th International Conference on Dependable Systems and Networks (DSN). 325.
56. MASSOULIE, L., MERRER, E. L., KERMARREC, A.-M., AND GANESH, A. J. 2007. Peer counting and sampling in overlay networks: Random walk methods. Distrib. Comput. 20, 4, 267-278.
57. MELAMED, R.,KEIDAR, I., AND BAREL, Y. 2005. Octopus: A fault-tolerant and efficient ad-hoc routing protocol. In Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (SRDS). 39-49.
58. MITCHELL, N.,MIZUNO, M., AND RAYNAL,M. 1992. A general method to define quorums. In Proceedings of the 12th International Conference on Distributed Computing Systems (ICDCS). 657-664.
59. MIURA, K. AND TAGAWA, T. 2006. A quorum-based protocol for searching objects in peer-to-peer networks. IEEE Trans. Parall. Distrib. Syst. 17, 1, 25-37.
60. MOTWANI, R. AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press.
61. PANCHAPAKESAN, P. AND MANJUNATH, D. 2001. On the transmission range in dense ad hoc radio networks. In Proceedings of IEEE Signal Processing Communication (SPCOM).
62. PENROSE, M. D. 2003. Random Geometric Graphs. Oxford University Press.
63. RATNASAMY, S., KARP, B., YIN, L., YU, F., ESTRIN, D., GOVINDAN, R., AND SHENKER, S. 2002. GHT: A geographic hash table for data-centric storage in sensornets. In Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications (WSNA).
64. ROWSTRON, A. AND DRUSCHEL, P. 2001. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proceedings of the ACM Symposium on Operating Systems Principles (SOSP'01). 188-201.
65. SALTZER, J. H.,REED, D. P., AND CLARK, D. D. 1984. End-to-End arguments in system design. ACM Trans. Comput. Syst. 2, 4, 277-288.
66. SEADA, K. AND HELMY, A. 2003. Rendezvous regions: A scalable architecture for service provisioning in large-scale mobile ad hoc networks. In Proceedings of ACM SIGCOMM. (Refereed poster.)
67. SERVETTO, S. AND BARRENECHEA, G. 2002. Constrained random walks on random graphs: Routing algorithms for large scale wireless sensor networks. In Proceedings of the ACM International Workshop on Wireless Sensor Networks and Application (WSNA).
68. STOJMENOVIC, I. 1999. A routing strategy and quorum based location update scheme for ad hoc wireless networks. Computer Science, SITE, University of Ottawa, TR-99-109
69. TCHAKAROV, J. AND VAIDYA, N. 2004. Efficient content location in wireless ad hoc networks. In Proceedings of the IEEE International Conference on Mobile Data Management (MDM).
70. THOMAS, R. H. 1979. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Datab. Syst. 4, 2, 180-209.
71. TOH, C. 2002. Ad Hoc Mobile Wireless Networks. Prentice Hall.