1 / 26

Channel Quality Dependent Rate-limited Scheduling Algorithm for IEEE 802.16 Wireless Networks

Channel Quality Dependent Rate-limited Scheduling Algorithm for IEEE 802.16 Wireless Networks. Cuicui Zhao 1 , Jinlong Hu 2 , Jihua Zhou 2 , Jinglin Shi 2 , Eryk Dutkiewicz 3 1 Graduate University of Chinese Academy of Sciences, Beijing, China

bonner
Download Presentation

Channel Quality Dependent Rate-limited Scheduling Algorithm for IEEE 802.16 Wireless Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Channel Quality Dependent Rate-limited Scheduling Algorithm for IEEE 802.16 Wireless Networks Cuicui Zhao1, Jinlong Hu2, Jihua Zhou2, Jinglin Shi2, Eryk Dutkiewicz3 1Graduate University of Chinese Academy of Sciences, Beijing, China 2Institute of Computing Technology, Chinese Academy of Sciences, China 3Wireless Technologies Laboratory, University of Wollonggong IEEE CMC 2009

  2. Outline • Introduction • Related Works • Goal • Channel quality dependent rate-limited Scheduling • Basic scheduler • Extened scheduler • Order changing in CD-RL • Simulation Results • Conclusions

  3. Introduction • In IEEE 802.16, five data delivery services are defined • unsolicited grant service (UGS) • real-time variable-rate (RT-VR) • extended real-time variable-rate (ERT-VR) • non-real-time variable-rate (NRT-VR) • best effort (BE) • The standard does not recommend any particular scheme in detail

  4. Background • IEEE 802.16 service classes n

  5. Introduction • Related Works • Deficit round-robin (DRR) [8] • To allow handling variable packet sizes in a fair manner • Low complexity • Channel-quality dependent earliest deadline due (CDEDD) [12] • guarantees the targeted delay bounds and ensures that the number of packets dropped is fairly distributed among users • High complexity

  6. Introduction • Problem • How to satisfy the basic QoS requirements, such as the minimum reserved traffic rate and the maximum latency • How to allocate the rest bandwidth • Goal • To satisfy the basic QoS requirements • To enhance throughput • Low complexity • Based on fairness (BE is exclude)

  7. Channel quality dependent rate-limited Scheduling ( CD-RL ) Basic scheduler Extended scheduler Order changing in CD-RL

  8. Scheduler structure

  9. Basic scheduler • In priority class Fk, service flows are served in descending order of starvation(i,n), which is defined as how long service flow ihasn’t been satisfied withminimum reserved traffic rate till the nth frame

  10. Basic scheduler • Tstart(i) is introduced as a timestamp to record the first time service flow ireceives data from upper layer Quantity of data that have been sent from Tstart(i) to the nth frame Sending data in the nth frame

  11. Basic scheduler minimum data quantity minimum reserved traffic rate maximum data quantity the time in frame n

  12. Basic scheduler • Real-time scheduler Data transmission size for service flow iwith s slotsremaining in frame n real-time data expiring in next frame real data quantity of service flow i maximum data transmission size for service flow iin frame n with s slots remaining

  13. Basic scheduler • Non-real-time scheduler real data quantity of service flow i maximum data transmission size for service flow iin frame n with s slots remaining

  14. Extended scheduler • priorities from highest to lowest are ERT-VR, RT-VR, NRT-VR, and BE. • To allocates bandwidth to service flows of class Fkin descending order of c(i,n)

  15. Order changing in CD-RL Q1,k Q2,k

  16. Order changing in CD-RL Q1,k Q2,k

  17. Order changing in CD-RL Q1,k Starvation flag Q2,k

  18. Order changing in CD-RL Q1,k Starvation flag Full flag Half-full flag Sorting by channel quality Q2,k Full flag：satisfied with maximum sustained traffic rates

  19. Order changing in CD-RL Q1,k Starvation flag Full flag Half-full flag Q2,k Full flag：satisfied with maximum sustained traffic rates

  20. Simulation Results • number of slot S for data transmission is assumed to be 300 per frame • Frame duration is 5 ms

  21. Simulation Results • Throughput of RT-VR service

  22. Simulation Results • Fairness of RT-VR service

  23. Simulation Results • User satisfied rate of RT-VR service

  24. Simulation Results • Average Packet Delay of RT-VR servic

  25. Conclusions • CD-RL provides service in class priority with guaranteed data rate while taking throughput enhancement into accoun • CD-RL can be implemented with low complexity • Simulation results show that CD-RL has good performances in fairness, minimum reserved traffic rate and average packet delay

  26. Thank you

More Related