无线调度算法  

Wireless Scheduling Algorithms

作　　者：任艳颖[1] 张文军[1] 王彬[1] 

机构地区：[1]上海交通大学图像通信与信息处理研究所,上海200030

出　　处：《计算机工程》2004年第15期92-93,116,共3页Computer Engineering

基　　金：国家"863"计划基金资助项目(2003AA103810)

摘　　要：为满足无线应用中的QoS要求,调度算法是很重要的。由于无线网络变化的链路错误率和容量,因此为其设计调度算法非常有挑战性。近来提出了多种适合无线网络的调度算法。该文分析了3种基于TDD的调度算法,讨论了各种算法的实现过程和优缺点,最后对它们的性能进行比较,得出了有意义的结论。Scheduling algorithms are important components in the provision of guaranteed quality of service (QoS) in wireless applications. The design of scheduling algorithms for wireless networks is especially challenging because of the highly variable link error rates and capacities. Recently, several scheduling algorithms are proposed for wireless networks. This paper studies three scheduling techniques applicable to TDD, discusses algorithms realizations and compares their performance, finally draws a conclusion.

关 键 词：调度算法 QOS 无线网络 

分 类 号：TN951.2[电子电信—信号与信息处理]