For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Fair Scheduling Algorithm for Wireless Packet Networks
Mooryong JEONG Hiroyuki MORIKAWA Tomonori AOYAMA
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/07/01
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Multi-dimensional Mobile Information Networks)
wireless, fairness, scheduling, compensation, QoS,
Full Text: PDF(713.8KB)>>
Fairness as defined in wireline network cannot be achieved in wireless packet networks due to the bursty and location-dependent channel errors of wireless link. Channel-state dependent scheduling and compensation mechanism for errored flows are generally employed to improve the fairness in wireless packet scheduling algorithms. Most of the wireless scheduling algorithms, however, have two common significant problems. One problem is that they operate incorrectly unless all flows have the same packet size. This is due to the incorrect lead-and-lag model and the swapping-based rough compensation mechanism of the algorithms. The other problem is the degradation of error-free flow during compensation. The root of the degradation is that the bandwidth for compensation cannot be reserved since it is very difficult to predict. In this paper, we introduce WGPS (Wireless General Processor Sharing) to define fairness in wireless networks and present PWGPS as a packetized algorithm of WGPS. In our method, lead and lag of all flows are defined in terms of virtual time which is flexible enough to deal with packet size differences. Further, compensation is done by increasing the service share of the errored flow to a predetermined amount Δ. This enables the maximum bandwidth for compensation can be estimated and thus reserved. Our method can be proved to achieve improved fairness as compared with the previous scheduling algorithms.