Extending earliest-due-date scheduling algorithms for wireless networks with location-dependent errors

Abstract

Generalized processor sharing (GPS) and earliest-due-date (EDD) algorithms are two work conserving service disciplines to provide bounded delay and fair queuing for packet data network. Unfortunately, these algorithms can not apply to a wireless network directly due to the location-dependent errors in mobile environment. A number of studies enhanced GPS-like algorithms to facilitate the wireless environment, but the studies of EDD scheduling algorithms on a wireless network are almost ignored. Unlike GPS-like algorithms which guarantee a delay bound based on the weight that is tightly coupled to a reserved service rate, EDD and its extensions such as delay-EDD and jitter-EDD policies allow the separation of delay, delay-jitters and throughput guarantees for a particular data flow. In this paper, we explore EDD and delay-EDD policies, and present their extensions. Simulation results show that our proposed algorithms can achieve short term, long term fairness, and QoS guarantees on wireless networks.