Abstract

In order to support diverse communication-intensive realtime and non real-time data flows over a scarce, varying and shared wireless channel with location-dependent and bursty errors, we define a service model that has the following characteristics: short-term fairness among flows which perceive a clean channel, worst-case delay bounds for packets, short-term throughput bounds for flows with clean channels and long-term throughput bounds for all flows with bounded channel error, optimal schedulable region, and support for both delay sensitive and error sensitive data flows. We present a wireless fair service algorithm, and show that it achieves the requirements of the service model through both analysis and simulation. The key aspects of the algorithm are the following: (a) an enhanced fair queueing based service scheme that supports decoupling of delay and bandwidth, (b) graceful service compensation for lagging flows and graceful service degradation for leading flows, (c) support f...