.png){kind=icon}
.png){kind=icon}
Return
A Scheduling Algorithm with Dynamic Priority Assignment for WCDMA Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/TMC.2008.106.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In third generation WCDMA systems, shared channels allow many users to jointly utilize a single Orthogonal Variable Spreading Factor (OVSF) code. In this paper, we propose a Scheduling Algorithm with Dynamic Priority Assignment (DPA), which is designed for the Downlink-Shared Channel (DSCH) of 3G WCDMA systems and operates within a cross-layer framework. The DPA scheduler has low computational complexity and is able to provide QoS differentiation among traffic flows based on their delay sensitivity. Through the cross-layer framework, DPA takes into account the variations of the wireless channel and exploits processing gain to improve transmission quality and enable service provisioning when possible. Additionally, by providing a guaranteed rate per traffic flow at each scheduling period, DPA can offer a deterministic delay bound to each connection when transmissions are reliable. Stochastic delay guarantees under transmission power limitations are also provided when the traffic flows are identical. Simulation results show that DPA outperforms Feasible Earliest Due Date (FEDD), a variation of EDD for wireless environments.
Keywords:
3G
quality of service
scheduling
WCDMA
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.2
Papers:
5.6K
Citations:
1.8W