MR-FQ: A Fair Scheduling Algorithm for Wireless Networks with Variable Transmission Rates
MR-FQ: A Fair Scheduling Algorithm for Wireless Networks with Variable Transmission Rates
复制标题
MR-FQ：一种可变传输速率无线网络公平调度算法
DOI：
--
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
Wen
中科院分区：
文献类型：
--
作者：
You;Yu;Wen
无线网络的特点是突发性错误和位置相关错误。尽管已经提出了许多公平调度算法来解决这些问题，但大多数算法都假设一个简单的二状态信道模型，其中信道可以是好是坏。事实上，情况并没有那么悲观，因为可以采用不同的调制技术来适应不同的信道条件。多速率传输是当今无线网络的常见技术。这就导致了一个困境：公平性应该基于用户使用媒介的时间量还是用户接受的服务量来建立？在这项工作中，作者提出了一种多速率无线公平排队（MR-FQ）算法，该算法允许流根据其信道条件和滞后程度以不同的速率进行传输。 MR-FQ同时考虑了时间和服务公平性。他们通过数学建模和分析证明了 MR-FQ 可以保证数据包流的公平性和有界延迟。此外，仿真结果表明，与其他调度方法相比，MR-FQ还可以提高系统的整体吞吐量。
Wireless networks are characterized by bursty and location-dependent errors. Although many fair scheduling algorithms have been proposed to address these issues, most of them assume a simple two-state channel model, where a channel can be either good or bad. In fact, the situation is not so pessimistic because different modulation techniques can be used to adapt to different channel conditions. Multirate transmission is a common technique for wireless networks now a days. This leads to a dilemma: should fairness be built based on the amount of time that a user utilizes the medium or the amount of services that a user receives? In this work, the authors propose a multirate wireless fair queueing (MR-FQ) algorithm that allows a flow to transmit at different rates according to its channel condition and lagging degree. MR-FQ takes both time and service fairness into account. They demonstrate that MR-FQ can guarantee fairness and bounded delays for packet flows by mathematical modeling and analyses. Besides, simulation results show that MR-FQ can also increase the overall system throughput compared to other scheduling methods.