Fair scheduling with QoS support in wireless Ad hoc networks

Hsi-Lu Chao*, Wanjiun Liao

*Corresponding author for this work

研究成果: Article同行評審

18 引文 斯高帕斯(Scopus)

摘要

In this paper, 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.

原文English
頁(從 - 到)2119-2128
頁數10
期刊IEEE Transactions on Wireless Communications
3
發行號6
DOIs
出版狀態Published - 1 十一月 2004

指紋 深入研究「Fair scheduling with QoS support in wireless Ad hoc networks」主題。共同形成了獨特的指紋。

引用此