A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Cohorts Structures for Fault-Tolerant k Entries to a Critical Section
IEEE Transactions on Computers
The Load, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing
Optimal availability quorum systems: theory and practice
Information Processing Letters
Ad Hoc mobility management with uniform quorum systems
IEEE/ACM Transactions on Networking (TON)
Wake on wireless: an event driven energy saving strategy for battery operated devices
Proceedings of the 8th annual international conference on Mobile computing and networking
A New Quorum-Based Scheme for Managing Replicated Data in Distributed Systems
IEEE Transactions on Computers
Two New Quorum Based Algorithms for Distributed Mutual Exclusion
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Quorum-based asynchronous power-saving protocols for IEEE 802.11 ad hoc networks
Mobile Networks and Applications
A Quorum-Based Group Mutual Exclusion Algorithm for a Distributed System with Dynamic Group Set
IEEE Transactions on Parallel and Distributed Systems
Energy efficient protocols for information dissemination in wireless sensor networks
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Quorum systems satisfying the rotation closure property can be used to realize asynchronous power-saving algorithms for mobile ad hoc networks. The FPP, grid, cyclic, torus and e-torus quorum systems can provide the algorithms with the lowest or near lowest active ratios since they have the optimal or near optimal quorum sizes. The algorithms guarantee that a node can sense the status of every neighbor by receiving one or more beacons from it within a round of beacon intervals. Traditionally, the smallest quorum overlap size (SQOS) and the maximum quorum overlap separation (MQOS) are used to measure the neighbor sensibility. However, it is difficult to differentiate the quorum systems by SQOS and MQOS since most of them have the same SQOS and MQOS values. In this paper, the expected quorum overlap size (EQOS) is proposed as an average-case neighbor sensibility measurement. We can easily judge the goodness of quorum systems by EQOS since they have different EQOS values. Larger than one EQOS values are desirable. Observing quorum systems are of EQOS values far larger than one, we are inspired to devise a new quorum system, called the fraction torus (f-torus) quorum system, for the construction of flexible mobility-adaptive power-saving algorithms. The f-torus quorum system can further reduce the active ratio to save energy by shrinking the quorum size, while still keeping the EQOS larger than one. We derive EQOS values for all the above-mentioned quorum systems by analysis and simulation experiments. As we will show, the EQOS analysis and simulation results coincide very closely.