返回
A Scheduling Algorithm with Dynamic Priority Assignment for WCDMA Systems
DOI:10.1109/TMC.2008.106.png)
摘要
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.
Keyword:
3G
quality of service
scheduling
WCDMA
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.2
论文数:
5.8K
被引数:
1.8W
机构
引用论文
Dynamic fair scheduling with QoS constraints in multimedia wideband CDMA cellular networks多媒体宽带CDMA蜂窝网络中具有QoS约束的动态公平调度

