一种基于优先级的加权公平队列调度算法  

A Priority-based Weighted Fair Queue Scheduling Algorithm

作　　者：闵捷[1] 周红琼[1] 王晓东[1] 

机构地区：[1]宁波大学信息科学与工程学院,浙江宁波315211

出　　处：《宁波大学学报（理工版）》2012年第2期42-46,共5页Journal of Ningbo University：Natural Science and Engineering Edition

基　　金：国家自然科学基金(61071198);浙江省大学生创新创业孵化项目(2010R405064;2010R405066)

摘　　要：根据在无线传感器网络上传输实时业务的要求,深入研究了加权公平队列调度算法.在分析其无法保证实时业务的QoS的原因后,提出一种基于优先级的加权公平队列调度算法P-WFQ.这种算法利用滑动窗口将WFQ和基于优先级的机制结合起来,通过有效的优先级划分策略,在带宽受限的情况下,保证高优先级数据的QoS要求.仿真结果表明:P-WFQ在实时业务的时延性能上比WFQ有明显的改善,而且能够将实时业务的最大时延控制在允许范围之内.Based on the requirements of the transmission in real-time service in wireless sensor networks,the WFQ algorithm is studied in this paper.Having analyzed the reason why WFQ cannot ensure the quality of real-time service,it proposes P-WFQ,which is a priority-based Weighted Fair Queuing algorithm.With sliding windows,the P-WFQ combines both the WFQ and the priority-based mechanism.Under the condition of limited bandwidth in the link,using the proposed method to assign priority,the quality of high-priority data is ensured.Simulation shows that the P-WFQ can solve the delay problem in real-time service,and confine the worst-case within the bound as required by the real-time service.

关 键 词：无线传感器网络 调度算法 加权公平队列 优先级 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]