How to assign votes in a distributed system
Journal of the ACM (JACM)
How to share memory in a distributed system
Journal of the ACM (JACM)
Dynamic quorum adjustment for partitioned data
ACM Transactions on Database Systems (TODS)
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Dynamic voting for consistent primary components
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
GeoCast—geographic addressing and routing
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Ad Hoc mobility management with uniform quorum systems
IEEE/ACM Transactions on Networking (TON)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
An efficient, fault-tolerant protocol for replicated data management
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Distributed Algorithms
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
An adaptive mesh-based protocol for geocast routing
Journal of Parallel and Distributed Computing - Special issue on Routing in mobile and wireless ad hoc networks
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Information Dissemination in Partitionable Mobile Ad Hoc Networks
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Random Walk for Self-Stabilizing Group Communication in Ad-Hoc Networks
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
GeoTORA: a protocol for geocasting in mobile ad hoc networks
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Randomized location service in mobile ad hoc networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Information and Computation
Brief announcement: virtual mobile nodes for mobile ad hoc networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Modified tree structure for location management in mobile environments
Computer Communications
Probabilistic quorums for dynamic systems
Distributed Computing - Special issue: DISC 03
A critical evaluation of location based services and their potential
Journal of Location Based Services
Virtual infrastructure for collision-prone wireless networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Self-stabilizing and self-orgenizing mobile networks
Proceedings of the fifth international workshop on Foundations of mobile computing
Fault-tolerant semifast implementations of atomic read/write registers
Journal of Parallel and Distributed Computing
Self-stabilizing Mobile Robot Formations with Virtual Nodes
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Tutorial Abstract Virtual Infrastructure
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Self-stabilizing robot formations over unreliable networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Brief announcement: a platform for experimenting with mobile algorithms in a laboratory
Proceedings of the 28th ACM symposium on Principles of distributed computing
On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Secret swarm unit: reactive k-secret sharing
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Ad Hoc Networks
Dagstuhl seminar review: consistency in distributed systems
ACM SIGACT News
| Hi-index | 0.00 |
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.