A Priority-Based Weighted Fair Queueing Algorithm in Wireless Sensor Network
A Priority-Based Weighted Fair Queueing Algorithm in Wireless Sensor Network
复制标题
DOI：
10.1109/wicom.2012.6478361
复制
发表时间：
2012-09
期刊：
影响因子：
--
通讯作者：
Xiaodong Wang-;Xiao Chen;Jie Min;Yu Zhou
中科院分区：
文献类型：
--
作者：
Xiaodong Wang-;Xiao Chen;Jie Min;Yu Zhou
本文针对无线传感器网络中实时业务传输的需求，对加权公平重传（WFQ）算法进行了深入的研究。分析了WFQ不能保证实时服务质量的原因，提出了一种基于优先级的加权公平排序（P-WFQ）算法。通过滑动窗口，P-WFQ结合了WFQ和基于优先级的机制。在链路带宽有限的情况下，采用有效的优先级分配方法保证了高优先级数据的传输质量。仿真结果表明，P-WFQ不仅提高了实时业务的带宽和时延，而且满足实时业务的最坏情况界。
Based on the requirement of the transmission of real-time service in wireless sensor networks, the paper studies Weighted Fair Queuing (WFQ) algorithm profoundly. Having analyzed the reason why WFQ can't ensure the quality of real-time service, it proposes P-WFQ, which is a priority-based Weighted Fair Queuing (P-WFQ) algorithm. With sliding windows, P-WFQ combines WFQ and the priority-based mechanism. Under the condition of limited bandwidth in the link, using an effective method to assign priority ensures quality of high-priority data. Simulation shows that P-WFQ not only improves bandwidth and delay of real-time service, but meets the worst-case bound of real-time service.