Low-complexity class-based scheduling algorithm for scheduled automatic power-save delivery for wireless LANs

Tsern-Huei Lee*, Jing Rong Hsieh

*Corresponding author for this work

Research output: Contribution to journalArticle

5 Scopus citations

Abstract

Power saving is an important issue when integrating the wireless LAN technology into mobile devices. Besides Quality of Service (QoS) guarantee, the IEEE 802.11e introduces an architecture called Scheduled Automatic Power-Save Delivery (S-APSD) aiming at delivering buffered frames to power save stations. In S-APSD, the Access Point (AP) schedules the Service Period (SP) of stations. To increase power efficiency, SPs should be scheduled to minimize the chance of overlapping. In a recent paper, an algorithm named Overlapping Aware S-APSD (OAS-APSD) was proposed to find the wake-up time schedule for a new Traffic Stream (TS) to minimize the chance of SP overlapping. The combination of OAS-APSD and HCF Controlled Channel Access (HCCA) was proved to outperform 802.11 Power Save Mode (PSM) with Enhanced Distributed Channel Access (EDCA) in power saving efficiency and QoS support. However, the OAS-APSD algorithm requires high online computational complexity which could make it infeasible for real systems. Without harming the optimality, this paper presents an efficient algorithm with much less complexity by exploiting the periodicity of service schedule. Because of largely reduced online computational complexity, the proposed algorithm is much more feasible than OAS-APSD.

Original languageEnglish
Article number6200278
Pages (from-to)571-580
Number of pages10
JournalIEEE Transactions on Mobile Computing
Volume12
Issue number3
DOIs
StatePublished - 29 Jan 2013

Keywords

  • power saving
  • scheduling
  • Wireless LAN

Fingerprint Dive into the research topics of 'Low-complexity class-based scheduling algorithm for scheduled automatic power-save delivery for wireless LANs'. Together they form a unique fingerprint.

  • Cite this