检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京邮电大学电信工程学院,北京100876 [2]吉林大学计算机科学与技术学院,吉林长春130012
出 处:《电路与系统学报》2006年第6期129-132,64,共5页Journal of Circuits and Systems
摘 要:研究了码分多址反向链路数据传输采用不同的调度算法受系统处理时延影响的程度,这种影响与信道估计误差有关,也与传输速率的更新时间有关。通过对CDMA2000的动态系统级仿真,其结果显示反向链路上的最大速率与轮询结合的算法、最小路径损耗算法、以及轮询算法在有处理时延时吞吐量性能都会降低,其中最大速率与轮询结合的算法降低的程度最小,轮询算法降低程度最大,最小路径损耗算法介于中间。性能降低也与快衰信道类型相关,信道变化越快算法性能受到的影响越大。提出了一种对调度算法的改进方法,即根据移动台处理时延的变化,为近期处理时延较小的移动台分配更多的资源,结果表明该方法改善了系统吞吐量。The degree of impact of system processing delay on different scheduling algorithms for data transmission on CDMA reverse link is studied, which is related to channel estimation error and the update time of transmission rate. Through dynamic system level simulation for CDMA2000, the results show that on the reverse link the throughput performances of maximum rate combined with Round Robin algorithm, minimum pathloss algorithm, and Round Robin algorithm decrease due to processing delay, while the amount of decrease of maximum rate combined with Round Robin algorithm is the smallest, that of Round Robin algorithm is the largest, and that of minimum pathloss algorithm lies between them. The performance degradation is also corresponding to the fast fading type, the faster the variation of the channel, the greater impact on the performances. An improvement method for scheduling algorithms is proposed, which takes advantage of the variations of processing delay, and allocates more resources to those mobile stations with shorter processing delay recently. The results show that the improvement method can enhance system throughput.
分 类 号:TN924.2[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15