A Rearrangement Algorithm for Scheduled Automatic Power Save Delivery of Wireless LANs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
2035 | en_US |
dc.citation.spage |
2030 | en_US |
dc.contributor.author |
Lee, Tsern-Huei | en_US |
dc.contributor.author |
Hsieh, Jing-Rong | en_US |
dc.contributor.author |
Chen, Hsiao-Wei | en_US |
dc.contributor.department |
傳播研究所 | zh_TW |
dc.contributor.department |
Institute of Communication Studies | en_US |
dc.date.accessioned |
2014-12-08T15:36:32Z | |
dc.date.available |
2014-12-08T15:36:32Z | |
dc.date.issued |
2010 | en_US |
dc.description.abstract |
One of the major challenges to integrate the wireless LAN technology into portable devices is the limited battery life. The IEEE 802.11e introduced an advanced architecture to improve 802.11 power saving mechanism, named Scheduled Automatic Power Save Delivery (S-APSD). In S-APSD, the access point negotiates periodical schedules with wireless Stations (STA) to deliver buffered traffic and thus prevents the need to poll for each frame by STAs. In S-APSD, in order to reduce wastage of energy, the AP has to avoid overlapping of Service Periods (SPs). Based on existing scheduled events (SEs), the OAS-APSD (Overlapping Aware S-APSD) and LCS-APSD (Low Complexity S-APSD) were proposed to incrementally select the Service Start Times (SSTs) for the new joining traffic streams (TSs) to minimize the chance of SP overlapping. However, in this scheduling fashion, the resulted power saving performance depends on the joining order of TSs and thus may be unsatisfactory. Therefore, our idea is to rearrange the relative offsets of existing SEs to enlarge the system minimum distance. From numerical results, we find that the proposed scheduling algorithms can provide better power saving. | en_US |
dc.identifier.isbn |
978-1-4244-6890-4 | en_US |
dc.identifier.issn |
0886-1420 | en_US |
dc.identifier.journal |
TENCON 2010: 2010 IEEE REGION 10 CONFERENCE | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/24878 | |
dc.identifier.wosnumber |
WOS:000287978600348 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Power Saving | en_US |
dc.subject |
Wireless LAN | en_US |
dc.subject |
Scheduling | en_US |
dc.title |
A Rearrangement Algorithm for Scheduled Automatic Power Save Delivery of Wireless LANs | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 會議論文
引用此條目
Lee, T.-H., Hsieh, J.-R., & Chen, H.-W. (2010). A Rearrangement Algorithm for Scheduled Automatic Power Save Delivery of Wireless LANs. TENCON 2010: 2010 IEEE REGION 10 CONFERENCE, 2030–2035. https://ir.lib.nycu.edu.tw/handle/11536/24878
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/24878