To enhance the downlink performance for packet data services in WCDMA a High Speed Downlink Shared Channel is being developed. This channel is divided between users in time and a scheduling algorithm controls the allocation of the channel among the users. The choice of scheduling algorithm will have a large impact on the system behaviour.
The aim of this study is to evaluate some fundamentally different scheduling algorithms from system and user point of view. The possibility to guarantee user quality by adding a Quality of Service requirement to a scheduling algorithm is investigated, as well as the possibility to differentiate user quality by means of scheduling.
Results and conclusions are based on simulations for a macro cell environment. They show that there is a trade-off between system throughput and user fairness. Scheduling algorithms that use information on channel conditions are more efficient than those who don’t.
Setting absolute Quality of Service requirements is only achievable through the use of admission control. Without admission control, service differentiation is therefore only possible through relative differences of Quality of Service demands. It is shown that such a differentiation is achievable, however it costs in terms of system throughput.
Author: Oberg, Jonas
Source: Luleå University of Technology
Download Link: Click Here To Download This Project Report (PDF)
Reference URL: Visit Now