By Topic

Comparisons of link adaptation based scheduling algorithms for the WCDMA system with high speed downlink packet access

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Li-Chun Wang ; Dept. of Commun. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Ming-Chi Chen

The wideband code division multiple access (WCDMA,) system with high speed downlink packet access (HSDPA) is an important next generation wireless system. By adopting adaptive modulation, efficient scheduling, and hybrid automatic repeat request technologies, it can support data rates up to 10 Mbit/s in the mobile cellular environment. Among these techniques, the scheduling algorithm plays a key role in realizing the HSDPA concept A good scheduling algorithm should consider all the important factors including channel impact, delay issue, and fairness. In this paper, we suggest a fairness index to examine the fairness performance of current link adaptation based scheduling algorithms, including the maximum C/I, round robin, proportional fair, and exponential rule schedulers. When supporting multi-type services, we find that the fairness performance of current scheduling algorithms, including the round robin scheduler, can be improved further even though the round robin scheduler is viewed as the scheduler of the greatest fairness. Thus, we are motivated to develop a new scheduling algorithm, namely the queue-based exponential rule scheduler. Through simulations, we show that in the context of multi-type services the fairness performance of the queue-based exponential rule scheduler can outperform all the schedulers; in the time-multiplexing fashion, while maintaining good throughput and delay performance.

Published in:

Vehicular Technology Conference, 2004. VTC 2004-Spring. 2004 IEEE 59th  (Volume:5 )

Date of Conference:

17-19 May 2004