Packet scheduling algorithms for throughput fairness and coverage enhancement in TDD-OFDMA downlink network

Young Min Ki, Dong Ku Kim

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

This paper proposes two different packet schedulers for IEEE 802.16e type time division duplex - orthogonal frequency division multiple access (TDD-OFDMA), which are the weighted fair scheduling (WFS) and the throughput guarantee scheduling (TGS). The performance of proposed schedulers is compared to those of 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 schedulers increase 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 schedulers provide higher coverage than the PF scheduler while maintaining the same effective aggregate throughput.

Original languageEnglish
Pages (from-to)4402-4405
Number of pages4
JournalIEICE Transactions on Communications
VolumeE88-B
Issue number11
DOIs
Publication statusPublished - 2005 Jan 1

Fingerprint

Frequency division multiple access
Scheduling algorithms
Throughput
Scheduling

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{8d852ba35cd24ee9b30d0eeea74dd17c,
title = "Packet scheduling algorithms for throughput fairness and coverage enhancement in TDD-OFDMA downlink network",
abstract = "This paper proposes two different packet schedulers for IEEE 802.16e type time division duplex - orthogonal frequency division multiple access (TDD-OFDMA), which are the weighted fair scheduling (WFS) and the throughput guarantee scheduling (TGS). The performance of proposed schedulers is compared to those of 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 schedulers increase 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 schedulers provide higher coverage than the PF scheduler while maintaining the same effective aggregate throughput.",
author = "Ki, {Young Min} and Kim, {Dong Ku}",
year = "2005",
month = "1",
day = "1",
doi = "10.1093/ietcom/e88-b.11.4402",
language = "English",
volume = "E88-B",
pages = "4402--4405",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "11",

}

Packet scheduling algorithms for throughput fairness and coverage enhancement in TDD-OFDMA downlink network. / Ki, Young Min; Kim, Dong Ku.

In: IEICE Transactions on Communications, Vol. E88-B, No. 11, 01.01.2005, p. 4402-4405.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Packet scheduling algorithms for throughput fairness and coverage enhancement in TDD-OFDMA downlink network

AU - Ki, Young Min

AU - Kim, Dong Ku

PY - 2005/1/1

Y1 - 2005/1/1

N2 - This paper proposes two different packet schedulers for IEEE 802.16e type time division duplex - orthogonal frequency division multiple access (TDD-OFDMA), which are the weighted fair scheduling (WFS) and the throughput guarantee scheduling (TGS). The performance of proposed schedulers is compared to those of 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 schedulers increase 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 schedulers provide higher coverage than the PF scheduler while maintaining the same effective aggregate throughput.

AB - This paper proposes two different packet schedulers for IEEE 802.16e type time division duplex - orthogonal frequency division multiple access (TDD-OFDMA), which are the weighted fair scheduling (WFS) and the throughput guarantee scheduling (TGS). The performance of proposed schedulers is compared to those of 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 schedulers increase 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 schedulers provide higher coverage than the PF scheduler while maintaining the same effective aggregate throughput.

UR - http://www.scopus.com/inward/record.url?scp=29144443660&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=29144443660&partnerID=8YFLogxK

U2 - 10.1093/ietcom/e88-b.11.4402

DO - 10.1093/ietcom/e88-b.11.4402

M3 - Article

VL - E88-B

SP - 4402

EP - 4405

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 11

ER -