Packet Scheduling Algorithms for Throughput Fairness and Coverage Enhancement in TDD-OFDMA Downlink Network 


Vol. 30,  No. 7, pp. 611-619, Jul.  2005


PDF
  Abstract

The present paper proposes two different packet scheduling algorithms in the IEEE 802.16e type TDDOFDMA downlink, which are the weighted fair scheduling(WFS) and the throughput guarantee scheduling(TGS). The performance of proposed scheduling algorithms are compared to some of conventional schedulers such as round robin(RR), proportional fair(PF), fast fair throughput(FFTH), and fair throughput(FTH) in terms of service coverage, effective throughput and fairness at 64 kbps and 128 kbps minimum user throughput requirements. For a relatively smaller throughput(64 kbps) requirement, the proposed algorithms provide higher improvement in the number of users per sector within 95% service coverage while satisfying the 1xEV-DV fairness criterion. For a relatively larger throughput(128 kbps) requirement, the proposed algorithms provide higher coverage enhancement while maintaining the same effective aggregate throughput over PF scheduler.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

Y. M. Ki and D. K. Kim, "Packet Scheduling Algorithms for Throughput Fairness and Coverage Enhancement in TDD-OFDMA Downlink Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 7, pp. 611-619, 2005. DOI: .

[ACM Style]

Young Min Ki and Dong Ku Kim. 2005. Packet Scheduling Algorithms for Throughput Fairness and Coverage Enhancement in TDD-OFDMA Downlink Network. The Journal of Korean Institute of Communications and Information Sciences, 30, 7, (2005), 611-619. DOI: .

[KICS Style]

Young Min Ki and Dong Ku Kim, "Packet Scheduling Algorithms for Throughput Fairness and Coverage Enhancement in TDD-OFDMA Downlink Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 7, pp. 611-619, 7. 2005.