By Topic

Fast packet scheduling algorithm based on instantaneous SIR with constraint condition assuring minimum throughput in forward link

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
$33 $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

3 Author(s)
Y. Ofuji ; Wireless Labs., Kanagawa, Japan ; S. Abeta ; M. Sawahashi

This paper proposes a new fast packet-scheduling algorithm based on instantaneous received signal-to-inference power ratio (SIR) with a constraint condition that assures a minimum throughput (minimum throughput assured instantaneous SIR (MTA-ISIR) method hereafter) and investigates its throughput performance in high-speed downlink packet access (HSDPA). In the proposed algorithm, packet transmission is assigned with priority based on the instantaneous received SIR for users with a larger average received SIR than the prescribed threshold value, and packet transmission is fairly assigned to users who have smaller average SIR than the threshold value by raising the instantaneous SIR corresponding to the threshold value. Computer simulation results elucidate that the number of high-rate users with a user throughput more than 2-Mbps employing the proposed MTA-ISIR method is increased by approximately 1.9 (1.5) times that using the proportional fairness method while maintaining a similar level of fairness for low-rate users when the threshold value is 18 dB in a 2(1)-path Rayleigh fading channel.

Published in:

Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE  (Volume:2 )

Date of Conference:

20-20 March 2003