Roy Friedman
Skip Abstract Section
Abstract
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their intersection guarantee to being probabilistic. This article explores several access strategies for implementing probabilistic quorums in ad hoc networks. In particular, we present the first detailed study of asymmetric probabilistic biquorum systems, that allow to mix different access strategies and different quorums sizes, while guaranteeing the desired intersection probability. We show the advantages of asymmetric probabilistic biquorum systems in ad hoc networks. Such an asymmetric construction is also useful for other types of networks with nonuniform access costs (e.g, peer-to-peer networks). The article includes a formal analysis of these approaches backed up by an extensive simulation-based study. The study explores the impact of various parameters such as network size, network density, mobility speed, and churn. In particular, we show that one of the strategies that uses random walks exhibits the smallest communication overhead, thus being very attractive for ad hoc networks.
- }}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. Google Scholar
Digital Library
- }}Abraham, I. and Malkhi, D. 2003. Probabilistic quorums for dynamic systems. In Proceedings of the 16th International Symposium on Distributed Computing (DISC). 60--74.Google Scholar
- }}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. Google ScholarDigital Library
- }}Attiya, H., Bar-Noy, A., and Dolev, D. 1995. Sharing memory robustly in message passing systems. J. ACM 42, 1, 124--142. Google ScholarDigital Library
- }}Attiya, H. and Welch, J. 1998. Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw Hill. Google ScholarDigital Library
- }}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. Google ScholarDigital Library
- }}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. Google ScholarDigital Library
- }}Baldoni, R., Marchetti, C., Virgillito, A., and Vitenberg, R. 2005. Content-Based publish-subscribe over structured overlay networks. In Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS). 437--446. Google ScholarDigital Library
- }}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. Google ScholarDigital Library
- }}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/.Google Scholar
- }}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. Google ScholarDigital Library
- }}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. Google ScholarDigital Library
- }}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. Google ScholarDigital Library
- }}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). Google ScholarDigital Library
- }}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. Google ScholarDigital Library
- }}Chockler, G., Keidar, I., and Vitenberg, R. 2001. Group communication specifications: A comprehensive study. ACM Comput. Surv. 33, 4, 427--469. Google ScholarDigital Library
- }}Dolev, S., Gilbert, S., Lynch, N., Shvartsman, A., and Welch, J. 2003. Geoquorums: Implementing atomic memory in mobile ad hoc networks. In Proceedings of the 17th International Symposium on Distributed Computing (DISC).Google Scholar
- }}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. Google ScholarDigital Library
- }}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. Google ScholarDigital Library
- }}Feige, U. 1996. A fast randomized LOGSPACE algorithm for graph connectivity. Theor. Comput. Sci. 169, 2, 147--160. Google ScholarDigital Library
- }}Friedman, R. and Kliot, G. 2006. Location services in wireless ad hoc and hybrid networks: A survey. Tech. rep. CS-2006-10, Technion, Haifa, Israel. http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi?2006/CS/CS-2006-10.Google Scholar
- }}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. Google ScholarDigital Library
- }}Garcia-Molina, H. and Barbara, D. 1985. How to assign votes in a distributed system. J. ACM 32, 4, 841--860. Google ScholarDigital Library
- }}Gifford, D. K. 1979. Weighted voting for replicated data. In Proceedings of the 7th Symposium on Operating System Principles (SOSP). 150--162. Google ScholarDigital Library
- }}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.Google Scholar
- }}Gramoli, V. 2007. Distributed shared memory for large-scale dynamic systems. Ph.D. thesis, University of Rennes 1.Google Scholar
- }}Guerraoui, R. and Raynal, M. 2004. The information structure of indulgent consensus. IEEE Trans. Comput. 53, 4, 453--466. Google ScholarDigital Library
- }}Gupta, P. and Kumar, P. 1998. Critical power for asymptotic connectivity in wireless networks. In Stochastic Analysis, Control, Optimization and Applications. 547--566.Google Scholar
- }}Gupta, P. and Kumar, P. 2000. The capacity of wireless networks. IEEE Trans. Inf. Theory 46, 2, 388--404. Google ScholarDigital Library
- }}Haas, Z. and Liang, B. 1999a. Ad hoc mobility management with randomized database groups. In Proceedings of IEEE International Conference on Communications (ICC).Google Scholar
- }}Haas, Z. and Liang, B. 1999b. Ad hoc mobility management with uniform quorum systems. IEEE/ACM Trans. Netw. 7, 2, 228--240. Google ScholarDigital Library
- }}Herlihy, M. 1986. A quorum-consensus replication method for abstract data types. ACM Trans. Comput. Syst. 4, 1, 32--53. Google ScholarDigital Library
- }}Herlihy, M. 1987. Dynamic quorum adjustment for partitioned data. ACM Trans. Datab. Syst. 12, 2, 170--194. Google ScholarDigital Library
- }}Herlihy, M. and Wing, J. 1990. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12, 3, 463--492. Google ScholarDigital Library
- }}hoc Networks Working Group, I. M. A. 2007. MANET neighborhood discovery protocol (NHDP). http://tools.ietf.org/html/draft-ietf-manet-nhdp-07.txt.Google Scholar
- }}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. Google ScholarDigital Library
- }}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.Google Scholar
- }}IETF Mobile ad-hoc Networks Working Group. 2008. MANET neighborhood discovery protocol. http://tools.ietf.org/html/draft-ietf-manet-nhdp-07.txt.Google Scholar
- }}IETF Mobile ad-hoc Networks Working Group. 2008. RFC 5148: Jitter considerations in mobile ad hoc networks (MANETs). www.ietf.org/rfc/rfc5148.txt.Google Scholar
- }}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. Google ScholarDigital Library
- }}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. Google ScholarDigital Library
- }}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. Google ScholarDigital Library
- }}Kliot, G. 2008. Wireless signal interference models made simple. www.cs.technion.ac.il/~gabik/Jist-Swans/signal_interference.Google Scholar
- }}Lamport, L. 1986. On interprocess communication. Distrib. Comput. 1, 2, 77--101.Google ScholarCross Ref
- }}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. Google ScholarDigital Library
- }}Lovász, L. 1993. Random walks on graphs: A survey. Combinatorics 2, 1--46.Google Scholar
- }}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. Google ScholarDigital Library
- }}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. Google ScholarDigital Library
- }}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. Google ScholarDigital Library
- }}Lynch, N. 1996. Distributed Algorithms. Morgan Kaufman. Google ScholarDigital Library
- }}Lynch, N. A. and Shvartsman, A. A. 2002. RAMBO: A reconfigurable atomic memory service for dynamic networks. In Proceedings of the 16th International Conference on Distributed Computing (DISC). 173--190. Google ScholarDigital Library
- }}Madras, N. and Slade, G. 1993. The Self-Avoiding Walk. Birkhauser, Boston, MA.Google Scholar
- }}Malkhi, D., Reiter, M., Wool, A., and Wright, R. 2001. Probabilistic quorum systems. The Inform. Comput. J. 170, 2, 184--206. Google ScholarDigital Library
- }}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. Google ScholarDigital Library
- }}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. Google ScholarDigital Library
- }}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.Google ScholarDigital Library
- }}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. Google ScholarDigital Library
- }}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.Google Scholar
- }}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. Google ScholarDigital Library
- }}Motwani, R. and Raghavan, P. 1995. Randomized Algorithms. Cambridge University Press. Google ScholarDigital Library
- }}Panchapakesan, P. and Manjunath, D. 2001. On the transmission range in dense ad hoc radio networks. In Proceedings of IEEE Signal Processing Communication (SPCOM).Google Scholar
- }}Penrose, M. D. 2003. Random Geometric Graphs. Oxford University Press.Google Scholar
- }}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). Google ScholarDigital Library
- }}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. Google ScholarDigital Library
- }}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. Google ScholarDigital Library
- }}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.)Google Scholar
- }}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). Google ScholarDigital Library
- }}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-09.Google Scholar
- }}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).Google Scholar
- }}Thomas, R. H. 1979. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Datab. Syst. 4, 2, 180--209. Google ScholarDigital Library
- }}Toh, C. 2002. Ad Hoc Mobile Wireless Networks. Prentice Hall.Google Scholar
Index Terms
- Probabilistic quorum systems in wireless Ad Hoc networks
Recommendations
A survey on probabilistic broadcast schemes for wireless ad hoc networks
Broadcast or flooding is a dissemination technique of paramount importance in wireless ad hoc networks. The broadcast scheme is widely used within routing protocols by a wide range of wireless ad hoc networks such as mobile ad hoc networks, vehicular ad ...
Adaptive Quorum-Based Power-Saving Protocol for Asynchronous Wireless Ad Hoc Networks
Efficient power-saving schemes are essential in extending the battery life of the portable devices in wireless communication systems. Accordingly, this study proposes an adaptive power-saving protocol for asynchronous wireless ad hoc networks in which ...
Robust position-based routing for wireless ad hoc networks
We consider a wireless ad hoc network composed of a set of wireless nodes distributed in a two dimensional plane. Several routing protocols based on the positions of the mobile hosts have been proposed in the literature. A typical assumption in these ...
Comments