Eric Rozner, Vishnu Navda, Ramachandran Ramjee, and Shravan Rayanchu
15 June 2010
WiFi radios in smart-phones consume a significant amount of power when active. The 802.11 standard allows these devices to save power through an energy-conserving Power Save Mode (PSM). However, depending on the PSM implementation strategies used by the clients/Access Points (APs), we find through controlled experiments that competing background traffic results in one or more of the following negative consequences: a significant increase, up to 300%, in a client’s energy consumption, a decrease in wireless network capacity due to unnecessary retransmissions, and unfairness. In this paper, we propose NAPman: Network-Assisted Power Management that addresses the above issues. NAPman leverages AP virtualization and a new energy-aware fair scheduling algorithm to minimize client energy consumption and unnecessary retransmissions, while ensuring fairness among competing traffic. NAPman is incrementally deployable via software updates to the AP and does not require any changes to the 802.11 protocol or the mobile clients. Our prototype implementation improves the energy savings on a smart-phone by up to 70%under varied settings of background traffic.
|Publisher||Association for Computing Machinery, Inc.|
Copyright © 2007 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or firstname.lastname@example.org. The definitive version of this paper can be found at ACM’s Digital Library --http://www.acm.org/dl/.