Shortest-remaining time packet scheduling for non-real-time services in DS-CDMA systems

Abstract

In this thesis, we have investigated the downlink packet scheduling for the non-real-time data services in the CDMA-HDR system. Our goal is to consider a scheduling algorithm that maximizes the sum of utilities that users in the system attain from the service. This approach is somewhat different from the existing works that are mainly focused on the total throughput in the base station. The throughput maximization may deviate from actual user satisfaction. Assuming the utility of a user is dependent on the average data rate, we have adopted a scheduling algorithm from the job-shop scheduling area into the CDMA-HDR system. The algorithm put high priority to the user with a short remaining time in finishing his/her transmission. Simulation results are encouraging so that the algorithm significantly improves the average data rates of users, thus increasing the utility, compared to the conventional proportional fairness algorithm.