PAMAS—power aware multi-access protocol with signalling for ad hoc networks
ACM SIGCOMM Computer Communication Review
A Survey of Energy Efficient Network Protocols for Wireless Networks
Wireless Networks
Minimizing energy for wireless web access with bounded slowdown
Proceedings of the 8th annual international conference on Mobile computing and networking
Adaptive Power Control and Selective Radio Activation for Low-Power Infrastructure-Mode 802.11 LANs
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
A Power-Saving Scheduling for IEEE 802.11 Mobile Ad Hoc Network
ICCNMC '03 Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing
Quorum-based asynchronous power-saving protocols for IEEE 802.11 ad hoc networks
Mobile Networks and Applications
Dynamic power management using on demand paging for networked embedded systems
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Energy efficient scheduling with QoS guarantee for IEEE 802.16e broadband wireless access networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Centralized PSM: an AP-centric power saving mode for 802.11 infrastructure networks
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
NAPman: network-assisted power management for wifi devices
Proceedings of the 8th international conference on Mobile systems, applications, and services
Diadem: Prefetch-Based Traffic Shaping for Energy Saving in Wireless Networks
GREENCOM '11 Proceedings of the 2011 IEEE/ACM International Conference on Green Computing and Communications
Hi-index | 0.24 |
This paper presents a novel method to arrange wakeup schedule for sleeping stations such that the number of wakeup stations in each beacon interval is balanced in IEEE 802.11 wireless local area networks (WLANs). This method reduces the probability of collision and thus the station can save more power. Next, we consider how to poll the wakeup stations to send the PS-Poll frame to get back their buffered data so that the contention can be avoided. Three different access scheduling mechanisms are proposed for the contention avoidance. In the first mechanism, only one of wakeup stations is scheduled to access the buffered data. The second and third mechanisms based on the smallest association ID (AID) first and the smallest queue length first, respectively, arrange a subset of wakeup stations to get back their buffered data within a beacon interval. Simulation results show that the proposed methods are effective in the power-saving.