Distributed Computing

, Volume 18, Issue 2, pp 125–155 | Cite as

GeoQuorums: implementing atomic memory in mobile ad hoc networks

  • Shlomi Dolev
  • Seth Gilbert
  • Nancy A. Lynch
  • Alexander A. Shvartsman
  • Jennifer L. Welch
Spec Issue DISC 03

Abstract

We present a new approach, the GeoQuorums approach, for implementing atomic read/write shared memory in mobile ad hoc networks. Our approach is based on associating abstract atomic objects with certain geographic locations. We assume the existence of focal points, geographic areas that are normally “populated” by mobile nodes. For example, a focal point may be a road junction, a scenic observation point, or a water resource in the desert. Mobile nodes that happen to populate a focal point participate in implementing a shared atomic object, using a replicated state machine approach. These objects, which we call focal point objects, are prone to occasional failures when the corresponding geographic areas are depopulated. The GeoQuorums algorithm uses the fault-prone focal point objects to implement atomic read/write operations on a fault-tolerant virtual shared object. The GeoQuorums algorithm uses a quorum-based strategy in which each quorum consists of a set of focal point objects. The quorums are used to maintain the consistency of the shared memory and to tolerate limited failures of the focal point objects, which may be caused by depopulation of the corresponding geographic areas. We present a mechanism for changing the set of quorums on the fly, thus improving efficiency. Overall, the new GeoQuorums algorithm efficiently implements read and write operations in a highly dynamic, mobile network.

Keywords

Mobile networks Ad hoc networks Dynamic distributed algorithms Fault-tolerance Location-aware 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Attie, P., Lynch, N.A., Rajsbaum, S.: Boosting fault-tolerance in asynchronous message passing systems is impossible. Technical Report LCS-TR-877, MIT (2002)Google Scholar
  2. 2.
    Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message-passing systems. Journal of the ACM 42(1), 124–142 (1995)CrossRefMATHGoogle Scholar
  3. 3.
    Bhattacharya, S.: Randomized location service in mobile ad hoc networks. In: Proceedings of the 8th International ACM Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pp. 66–73 (2003)Google Scholar
  4. 4.
    Camp, T., Liu, Y.: An adaptive mesh-based protocol for geocast routing. Journal of Parallel and Distributed Computing: Special Issue on Mobile Ad-hoc Networking and Computing 196–213 (2002)Google Scholar
  5. 5.
    de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications 2nd edn. Springer-Verlag (2000)Google Scholar
  6. 6.
    Dolev, D., Keidar, I., Lotem, E.Y.: Dynamic voting for consistent primary components. In: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 63–71. ACM Press (1997)Google Scholar
  7. 7.
    Dolev, S., Gilbert, S., Lynch, N.A., Schiller, E., Shvartsman, A.A., Welch, J.L.: Virtual mobile nodes for mobile adhoc networks. In: Proceeding of the 18th International Conference on Distributed Computing, pp. 230–244 (2004)Google Scholar
  8. 8.
    Dolev, S., Gilbert, S., Lynch, N.A., Shvartsman, A.A., Welch, J.L.: Geoquorums: Implementing atomic memory in mobile ad hoc networks. In: Proceeding of the 17th International Conference on Distributed Computing, pp. 306–320 (2003)Google Scholar
  9. 9.
    Dolev, S., Pradhan, D.K., Welch, J.L.: Modified tree structure for location management in mobile environments. Computer Communications: Special Issue on Mobile Computing 19(4), 335–345 (1996)Google Scholar
  10. 10.
    Dolev, S., Schiller, E., Welch, J.L.: Random walk for self-stabilizing group communication in ad-hoc networks. In: Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems, pp. 70–79 (2002)Google Scholar
  11. 11.
    El Abbadi, A., Skeen, D., Cristian, F.: An efficient fault-tolerant protocol for replicated data management. In: Proceedings of the 4th Symposium on Principles of Databases, pp. 215–228. ACM Press (1985)Google Scholar
  12. 12.
    Englert, B., Shvartsman, A.A.: Graceful quorum reconfiguration in a robust emulation of shared memory. In: Proceedings of the International Conference on Distributed Computer Systems (ICDCS'2000), pp. 454–463 (2000)Google Scholar
  13. 13.
    Garcia-Molina, H., Barbara, D.: How to assign votes in a distributed system. Journal of the ACM 32(4), 841–860 (1985)CrossRefMathSciNetMATHGoogle Scholar
  14. 14.
    Gifford, D.K.: Weighted voting for replicated data. In: Proceedings of the Seventh Symposium on Operating Systems Principles, pp. 150–162 (1979)Google Scholar
  15. 15.
    Gilbert, S., Lynch, N.A., Shvartsman, A.A.: RAMBO II: Rapidly reconfigurable atomic memory for dynamic networks. In: Proceedings of the International Conference on Dependable Systems and Networks, pp. 259–269 (2003)Google Scholar
  16. 16.
    Haas, Z.J., Liang, B.: Ad hoc mobile management with uniform quorum systems. IEEE/ACM Transactions on Networking 7(2), 228–240 (1999)CrossRefGoogle Scholar
  17. 17.
    Herlihy, M.P.: Dynamic quorum adjustment for partitioned data. Transactions on DB Systems 12(2), 170–194 (1987)Google Scholar
  18. 18.
    Herlihy, M.P., Wing, J.M.: Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12(3), 463–492 (1990)CrossRefGoogle Scholar
  19. 19.
    Karumanchi, G., Muralidharan, S., Prakash, R.: Information dissemination in partitionable mobile ad hoc networks. In: Proceedings of IEEE Symposium on Reliable Distributed Systems pp. 4–13 (1999)Google Scholar
  20. 20.
    Kaynar, D.K., Lynch, N.A., Segala, R., Vaandrager, F.: The theory of timed I/O automata. Technical Report MIT-LCS-TR-917a, MIT (2004)Google Scholar
  21. 21.
    Ko, Y.B., Vaidya, N.: Geotora: A protocol for geocasting in mobile ad hoc networks. In: Proceedings of the IEEE International Conference on Network Protocols, pp. 240–249 (2000)Google Scholar
  22. 22.
    Lamport, L.: On interprocess communication – parts I and II. Distributed Computing 1(2), 77–101 (1986)MATHGoogle Scholar
  23. 23.
    Lee, H., Vaidya, N., Welch, J.L.: Location tracking using quorums in mobile ad-hoc networks. Ad Hoc Networks 1(4), 371–381 (2003)CrossRefGoogle Scholar
  24. 24.
    Lynch, N.A.: Distributed Algorithms. Morgan Kaufman (1996)Google Scholar
  25. 25.
    Lynch, N.A., Segala, R., Vaandraager, F.: Hybrid I/O automata. Information and Computation 185(1) (2003)Google Scholar
  26. 26.
    Lynch, N.A., Segala, R., Vaandraager, F.: Hybrid I/O automata. Technical Report LCS-TR-827d, MIT (2003)Google Scholar
  27. 27.
    Lynch, N.A., Shvartsman, A.A.: RAMBO: A reconfigurable atomic memory service for dynamic networks. In: Proceedings of the 16th International Symposium on Distributed Computing, pp. 173–190 (2002)Google Scholar
  28. 28.
    Navas, J.C., Imielinski, T.: Geocast – geographic addressing and routing. In: ACM/IEEE International Conference on Mobile Computing and Networking, pp. 66–76 (1997)Google Scholar
  29. 29.
    Prisco, R.D., Fekete, A., Lynch, N.A., Shvartsman, A.A.: A dynamic primary configuration group communication service. In: Proceedings of the 13th International Symposium on Distributed Computing, pp. 64–78 (1999)Google Scholar
  30. 30.
    Priyantha, N.B., Chakraborty, A., Balakrishnan, H.: The cricket location-support system. In: Proceedings of the 6th ACM MOBICOM, pp. 32–43 (2000)Google Scholar
  31. 31.
    Stojmenovic, I., Pena, P.E.V.: A scalable quorum based location update scheme for routing in ad hoc wireless networks. Technical Report TR-99-09, Computer Science, SITE, University of Ottawa (1999)Google Scholar
  32. 32.
    Thomas, R.H.: A majority consensus approach to concurrency control for multiple copy databases. Transactions on Database Systems 4(2), 180–209 (1979)CrossRefGoogle Scholar
  33. 33.
    Upfal, E., Wigderson, A.: How to share memory in a distributed system. J. ACM 34(1), 116–127 (1987)CrossRefMathSciNetMATHGoogle Scholar

Copyright information

© Springer-Verlag 2005

Authors and Affiliations

  • Shlomi Dolev
    • 1
  • Seth Gilbert
    • 2
  • Nancy A. Lynch
    • 2
  • Alexander A. Shvartsman
    • 3
  • Jennifer L. Welch
    • 4
  1. 1.Department of Computer ScienceBen-Gurion UniversityIsrael
  2. 2.MIT Computer Science and Artificial Intelligence LaboratoryUSA
  3. 3.Department of Computer Science and EngineeringUniversity of ConnecticutUSA
  4. 4.Department of Computer ScienceTexas A&M UniversityUSA

Personalised recommendations