Downlink packet scheduling with minimum throughput guarantee in TDD-OFDMA cellular network

Authors:
Young Min Ki;Eun Sun Kim;Sung Il Woo;Dong Ku Kim
Affiliations:
Dept. of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea;Dept. of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea;Dept. of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea;Dept. of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea
Venue:
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Year:
2005

Citing 1
Cited 1

Cross-layer design for wireless networks

IEEE Communications Magazine

Continuous state/action reinforcement learning: A growing self-organizing map approach

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a channel scheduler in downlink of IEEE 802.16e TDD-OFDMA cellular network which provides users the minimum throughput for best effort traffic. The proposed scheduler is further developed in the consideration of the case that network might become unfeasible, where extra weight functions are introduced into the proportional fair (PF) scheduler so that the proposed extra weight function provides more resources to users who are easier to achieve the target throughput than those who cannot. It does not guarantee target throughput for all users but eventually increases the number of users being served with the guaranteed minimum throughput. It is investigated for the proposed schedulers and other conventional ones how large the throughput is and how many users are guaranteed the target throughput. Simulation results show that the proposed algorithms have 10 to 20 % more users being served with the minimum guaranteed throughput. The trade-off between the throughput guarantee level and sector throughput is shown in the proposed schedulers.