Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Application-driven power management for mobile communication
Wireless Networks
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Two New Quorum Based Algorithms for Distributed Mutual Exclusion
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice
ACM Transactions on Computer Systems (TOCS)
Assessing the quality of voice communications over internet backbones
IEEE/ACM Transactions on Networking (TON)
Medium access control with coordinated adaptive sleeping for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Quorum-based asynchronous power-saving protocols for IEEE 802.11 ad hoc networks
Mobile Networks and Applications
An Adaptive Quorum-Based Energy Conserving Protocol for IEEE 802.11 Ad Hoc Networks
IEEE Transactions on Mobile Computing
Self-tuning wireless network power management
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
IEEE Transactions on Mobile Computing
Minimizing energy for wireless web access with bounded slowdown
Wireless Networks
Adaptive Asynchronous Sleep Scheduling Protocols for Delay Tolerant Networks
IEEE Transactions on Mobile Computing
Performance analysis of power management policies in wireless networks
IEEE Transactions on Wireless Communications
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Quorum-based power-saving (QPS) protocols have been proposed for ad hoc networks (e.g., IEEE 802.11 ad hoc mode) to increase energy efficiency and prolong the operational time of mobile stations. These protocols assign to each station a cycle pattern that specifies when the station should wake up (to transmit/receive data) and sleep (to save battery power). In all existing QPS protocols, the cycle length is either identical for all stations or is restricted to certain numbers (e.g., squares or primes). These restrictions on cycle length severely limit the practical use of QPS protocols as each individual station may want to select a cycle length that is best suited for its own need (in terms of remaining battery power, tolerable packet delay, and drop ratio). In this paper, we propose the notion of hyper quorum system (HQS)—a generalization of QPS that allows for arbitrary cycle lengths. We describe algorithms to generate two different classes of HQS given any set of arbitrary cycle lengths as input. We also describe how to find the optimal cycle length for a station to maximize energy efficiency, subject to certain performance constraints. We then present analytical and simulation results that show the benefits of HQS-based power-saving protocols over the existing QPS protocols. The HQS protocols yield up to 41% improvement in energy efficiency under heavy traffic loads while eliminating more than 90% delay drops under light traffic loads.