Wireless packet fair queueing algorithms with link level retransmission

Authors:
Namgi Kim;Hyunsoo Yoon
Affiliations:
Division of Computer Science, Department of EECS, 373-1 Kuseong, Yuseong, EECS, KAIST, Daejeon 305-701, South Korea;Division of Computer Science, Department of EECS, 373-1 Kuseong, Yuseong, EECS, KAIST, Daejeon 305-701, South Korea
Venue:
Computer Communications
Year:
2005

Citing 9
Cited 1

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Hierarchical packet fair queueing algorithms

IEEE/ACM Transactions on Networking (TON)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

IEEE/ACM Transactions on Networking (TON)
Adapting packet fair queueing algorithms to wireless networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Fair scheduling in wireless packet networks

IEEE/ACM Transactions on Networking (TON)
Design and analysis of an algorithm for fair service in error-prone wireless channels

Wireless Networks
Error Control Coding, Second Edition

Error Control Coding, Second Edition
Automatic-repeat-request error-control schemes

IEEE Communications Magazine

Technical Communication: Performance analysis of multi-service wireless network: An approach integrating CAC, scheduling, and buffer management

Computers and Electrical Engineering

Quantified Score

Hi-index	0.24

Visualization

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.