Wireless packet fair queueing algorithms with link level retransmission

Abstract

In order to provide quality of service to wireless networks, a number of wireless fair queueing algorithms have recently been proposed. They, however, require perfect channel prediction before transmission and rarely consider algorithms under the link layer. Instead of perfect channel prediction, most wireless systems adopt the Link Level Retransmission (LLR) algorithm within the link layer for recovering channel errors. However, the LLR algorithm does not work well with the previous prediction-based wireless fair queueing algorithms. Therefore, we propose a new wireless fair queueing algorithm, Wireless Fair Queueing with Retransmission (WFQ-R), which is well matched with the LLR algorithm and does not require channel prediction. In the WFQ-R algorithm, the share consumed by retransmission is regarded as a debt of the retransmitted flow to the other flows. So, the WFQ-R algorithm achieves wireless fairness with the LLR algorithm by penalizing flows that use wireless resources without permission in the link layer. Through analyses, we proved that the WFQ-R algorithm guarantees throughput and delay fairness. Through simulations, we showed that our WFQ-R algorithm maintains fairness adaptively. Furthermore, our WFQ-R algorithm is able to achieve flow separation and compensation.