A Re-arrangement Algorithm for Scheduled Automatic Power Save Delivery of Wireless LANs
| Autor: | 陳曉薇 |
|---|---|
| Rok vydání: | 2010 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 98 One of the major challenges to integrate the wireless LAN technology into portable devices is the limited battery life. Power consumption minimization is a critical issue since the size of mobile devices also limits its power resources. The IEEE 802.11e introduced an advanced architecture to improve 802.11 power saving management, named Scheduled Automatic Power Save Delivery (S-APSD). In S-APSD, the access point (AP) periodically delivers buffered traffic to PS Stations (STA) and therefore prevents the need to poll for each frame by STAs. It is clear that the AP has to avoid the overlapping of Service Periods (SPs) to increase the power saving performance. The OAS-APSD [3] and our previous work, LCS-APSD [4] select the Service Start Times (SSTs) of the Scheduled Events (SEs) in a greedy fashion for the S-APSD. However, to achieve the global optimum for power saving, it may require another method to obtain a better solution. Our idea is to rearrange the existing SEs to further minimize the chance of SP overlapping. From the numerical results, we find that the proposed scheduling algorithms provide better power saving performance. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|