Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich.
mehr Informationen...
MR-FQ: A Fair Scheduling Algorithm for Wireless Networks with Variable Transmission Rates
Ist Teil von
Simulation (San Diego, Calif.), 2005-08, Vol.81 (8), p.587-608
Ort / Verlag
Thousand Oaks, CA: Sage Publications
Erscheinungsjahr
2005
Link zum Volltext
Quelle
Alma/SFX Local Collection
Beschreibungen/Notizen
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.