Fair scheduling with QoS support in wireless ad hoc networks

Authors:
Hsi-Lu Chao;Wanjiun Liao
Affiliations:
Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan;-
Venue:
IEEE Transactions on Wireless Communications
Year:
2004

Citing 0
Cited 9

A slot allocation strategy for clustered ad hoc networks

International Journal of Ad Hoc and Ubiquitous Computing
Performance comparison of scheduling algorithms in network mobility environment

Computer Communications
A Search Space Reduction Algorithm for Improving the Performance of a GA-based QoS Routing Method in Ad-Hoc Networks

International Journal of Distributed Sensor Networks - Heterogenous Wireless Ad Hoc and Sensor Networks
Flow rank based probabilistic fair scheduling for wireless ad hoc networks

Wireless Networks
Cross-layer distributed joint power control and scheduling for delay-constrained applications over CDMA-based wireless ad-hoc networks

IEEE Transactions on Communications
Distributed power and scheduling management for mobile ad hoc networks with delay constraints

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
QoS-Aware fair scheduling in wireless ad hoc networks with link errors

APNOMS'06 Proceedings of the 9th Asia-Pacific international conference on Network Operations and Management: management of Convergence Networks and Services
Distributed coordination and qos-aware fair queueing in wireless ad hoc networks

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
A distributed fairness support scheduling algorithm in wireless ad hoc networks

UIC'06 Proceedings of the Third international conference on Ubiquitous Intelligence and Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study fair scheduling with quality of service (QoS) support for wireless ad hoc networks. Two types of flows are considered: best effort and guaranteed flows. The goal is to satisfy the minimum bandwidth requirements of guaranteed flows and to provide a fair share of residual bandwidth to all flows. We compare timestamp-based and credit-based mechanisms, and evaluate the feasibility of all existing fair scheduling schemes of these two types of mechanisms for multimedia wireless multihop networks. We suggest a flow weight calculation scheme for existing timestamp-based mechanisms to support both best effort and guaranteed flows, and propose a credit-based mechanism called credit-based slot allocation protocol (CSAP) for fair scheduling with QoS support. For comparison purposes, several metrics are defined to evaluate the performances of these two kinds of mechanisms. The simulation results show that CSAP outperforms the other approaches in terms of meeting the minimum requirements of guaranteed flows, fairly sharing the residual bandwidth among all flows, and improving overall system throughput.