research-article

Probabilistic quorum systems in wireless Ad Hoc networks

Authors:

Chen AvinAuthors Info & Claims

ACM Transactions on Computer Systems (TOCS), Volume 28, Issue 3

Article No.: 7, Pages 1 - 50

https://doi.org/10.1145/1841313.1841315

Published: 30 September 2008 Publication History

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.

References

[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.

Digital Library

[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.

Digital Library

[4]

}}Attiya, H., Bar-Noy, A., and Dolev, D. 1995. Sharing memory robustly in message passing systems. J. ACM 42, 1, 124--142.

Digital Library

[5]

}}Attiya, H. and Welch, J. 1998. Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw Hill.

Digital Library

[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.

Digital Library

[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.

Digital Library

[8]

}}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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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).

Digital Library

[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.

Digital Library

[16]

}}Chockler, G., Keidar, I., and Vitenberg, R. 2001. Group communication specifications: A comprehensive study. ACM Comput. Surv. 33, 4, 427--469.

Digital Library

[17]

}}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).

[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.

Digital Library

[19]

}}Dutta, P., Guerraoui, R., Levy, R. R., and Chakraborty, A. 2004. How fast can a distributed atomic read be&quest; In Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC). 236--245.

Digital Library

[20]

}}Feige, U. 1996. A fast randomized LOGSPACE algorithm for graph connectivity. Theor. Comput. Sci. 169, 2, 147--160.

Digital Library

[21]

}}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.

[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.

Digital Library

[23]

}}Garcia-Molina, H. and Barbara, D. 1985. How to assign votes in a distributed system. J. ACM 32, 4, 841--860.

Digital Library

[24]

}}Gifford, D. K. 1979. Weighted voting for replicated data. In Proceedings of the 7th Symposium on Operating System Principles (SOSP). 150--162.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[32]

}}Herlihy, M. 1986. A quorum-consensus replication method for abstract data types. ACM Trans. Comput. Syst. 4, 1, 32--53.

Digital Library

[33]

}}Herlihy, M. 1987. Dynamic quorum adjustment for partitioned data. ACM Trans. Datab. Syst. 12, 2, 170--194.

Digital Library

[34]

}}Herlihy, M. and Wing, J. 1990. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12, 3, 463--492.

Digital Library

[35]

}}hoc Networks Working 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.

Digital Library

[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 Networks Working Group. 2008. MANET neighborhood discovery protocol. http://tools.ietf.org/html/draft-ietf-manet-nhdp-07.txt.

[39]

}}IETF Mobile ad-hoc Networks Working 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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[50]

}}Lynch, N. 1996. Distributed Algorithms. Morgan Kaufman.

Digital Library

[51]

}}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.

Digital Library

[52]

}}Madras, N. and Slade, G. 1993. The Self-Avoiding Walk. Birkhauser, Boston, MA.

[53]

}}Malkhi, D., Reiter, M., Wool, A., and Wright, R. 2001. Probabilistic quorum systems. The Inform. Comput. J. 170, 2, 184--206.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[60]

}}Motwani, R. and Raghavan, P. 1995. Randomized Algorithms. Cambridge University Press.

Digital Library

[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).

Digital Library

[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.

Digital Library

[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.

Digital Library

[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).

Digital Library

[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-09.

[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.

Digital Library

[71]

}}Toh, C. 2002. Ad Hoc Mobile Wireless Networks. Prentice Hall.

Cited By

Yuan YLi FYu DYu JWu YLv WCheng X(2019)Fast Fault-Tolerant Sampling via Random Walk in Dynamic Networks2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS.2019.00060(536-544)Online publication date: Jul-2019
https://doi.org/10.1109/ICDCS.2019.00060
Romaszko SMähönen P(2015)Asynchronous Channel Allocation in Opportunistic Cognitive Radio NetworksHandbook of Research on Software-Defined and Cognitive Radio Technologies for Dynamic Spectrum Management10.4018/978-1-4666-6571-2.ch015(388-426)Online publication date: 2015
https://doi.org/10.4018/978-1-4666-6571-2.ch015
Khan WAalsalem MSaad N(2015)Distributed Clone Detection in Static Wireless Sensor Networks: Random Walk with Network DivisionPLOS ONE10.1371/journal.pone.012306910:5(e0123069)Online publication date: 18-May-2015
https://doi.org/10.1371/journal.pone.0123069
Show More Cited By

Index Terms

Probabilistic quorum systems in wireless Ad Hoc networks
1. Networks
  1. Network types
    1. Mobile networks
    2. Wireless access networks
2. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles
        Organizing principles for web applications

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

Information & Contributors

Information

Published In

cover image ACM Transactions on Computer Systems

ACM Transactions on Computer Systems Volume 28, Issue 3

September 2010

99 pages

ISSN:0734-2071

EISSN:1557-7333

DOI:10.1145/1841313

Issue’s Table of Contents

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Accepted: 01 July 2010

Revised: 01 June 2010

Received: 01 February 2009

Published: 30 September 2008

Published in TOCS Volume 28, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
636
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)1

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Yuan YLi FYu DYu JWu YLv WCheng X(2019)Fast Fault-Tolerant Sampling via Random Walk in Dynamic Networks2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS.2019.00060(536-544)Online publication date: Jul-2019
https://doi.org/10.1109/ICDCS.2019.00060
Romaszko SMähönen P(2015)Asynchronous Channel Allocation in Opportunistic Cognitive Radio NetworksHandbook of Research on Software-Defined and Cognitive Radio Technologies for Dynamic Spectrum Management10.4018/978-1-4666-6571-2.ch015(388-426)Online publication date: 2015
https://doi.org/10.4018/978-1-4666-6571-2.ch015
Khan WAalsalem MSaad N(2015)Distributed Clone Detection in Static Wireless Sensor Networks: Random Walk with Network DivisionPLOS ONE10.1371/journal.pone.012306910:5(e0123069)Online publication date: 18-May-2015
https://doi.org/10.1371/journal.pone.0123069
Zhang XJamin SYeung K(2015)Overlay Topology as Random-Walk Cache2015 IEEE 23rd International Conference on Network Protocols (ICNP)10.1109/ICNP.2015.38(366-375)Online publication date: Dec-2015
https://doi.org/10.1109/ICNP.2015.38
Klappenecker ALee H(2015)Probabilistic BiquorumsProceedings of the 2015 2nd International Conference on Information Science and Security (ICISS)10.1109/ICISSEC.2015.7371025(1-4)Online publication date: 14-Dec-2015
https://dl.acm.org/doi/10.1109/ICISSEC.2015.7371025
Sun YQiao XTan WCheng BShi RChen J(2013)A Low-Delay, Light-Weight Publish/Subscribe Architecture for Delay-Sensitive IOT ServicesInternational Journal of Web Services Research10.4018/ijwsr.201307010410:3(60-81)Online publication date: Jul-2013
https://doi.org/10.4018/ijwsr.2013070104
Guo DJin HChen TWu JLu LLi DZhou X(2013)Partial Probing for Scaling Overlay RoutingIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2012.32624:11(2261-2272)Online publication date: 1-Nov-2013
https://dl.acm.org/doi/10.1109/TPDS.2012.326
Sun YQiao XCheng BChen J(2013)A Low-Delay, Lightweight Publish/Subscribe Architecture for Delay-Sensitive IOT ServicesProceedings of the 2013 IEEE 20th International Conference on Web Services10.1109/ICWS.2013.33(179-186)Online publication date: 28-Jun-2013
https://dl.acm.org/doi/10.1109/ICWS.2013.33
Bonnin DTravers C(2013)α-RegisterProceedings of the 17th International Conference on Principles of Distributed Systems - Volume 830410.1007/978-3-319-03850-6_5(53-67)Online publication date: 16-Dec-2013
https://dl.acm.org/doi/10.1007/978-3-319-03850-6_5
Romaszko SMähönen P(2012)Quorum Systems towards an Asynchronous Communication in Cognitive Radio NetworksJournal of Electrical and Computer Engineering10.1155/2012/7535412012:1Online publication date: 30-Dec-2012
https://doi.org/10.1155/2012/753541
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents