| Hi-index | 0.00 |
We present a new definition of a dynamic quorum system with weaker properties than the standard intersection property of quorum systems. We describe a simplification of a mobile ad-hoc network and show how it can be simulated in the mobile ad-hoc network, given explicit bounds on the speed of processors. We show how to implement the new quorum system in this simplified model efficiently. Although our quorum system has weaker properties, it is still useful. In particular, we show that it can be used to solve the mutual exclusion problem and implement atomic read/write objects.