A minimum-bandwidth guaranteed scheduling algorithm for data services in CDMA/HDR system

Authors:
Seong-Il Hahm;Hee-Jin Lee;Jong-Won Lee
Affiliations:
School of Electrical Engineering and Computer Science, Seoul National University, Seoul, Republic of Korea;School of Electrical Engineering and Computer Science, Seoul National University, Seoul, Republic of Korea;School of Computer Science and Electrical Engineering, Handong Global University, Pohang, Republic of Korea
Venue:
HSI'03 Proceedings of the 2nd international conference on Human.society@internet
Year:
2003

Citing 1
Cited 1

CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users

IEEE Communications Magazine

A flexible resource allocation and scheduling framework for non-real-time polling service in IEEE 802.16 networks

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

CDMA/HDR system is designed to provide High Data Rate services in the cellular networks compatible with IS-95B CDMA network. It uses a PF (Proportional Fairness) scheduler that improves total throughput by using multi-user diversity in a forward link while supporting user's average throughput proportional to channel conditions. Therefore, PFS does not guarantee the minimum data rate to the users with poor channel conditions. We propose a new scheduling algorithm, which bounds the throughput ratio (Rmax/Rmin) between the best-channel user and the worst-channel user and maximizes the total throughput. Thus, it can guarantees minimum bandwidth by adapting the throughput ratio (Rmax/Rmin). Furthermore, if the user data in the queue is less than the accommodation size of the assigned slot, there will be a loss of efficiency. We add a function to the scheduler to protect the system from this performance degradation.