A Priority-Based Weighted Fair Queueing Algorithm in Wireless Sensor Network

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.