Proactive earliest due-date scheduling in wireless packet networks

Providing deadline-based scheduling In wireless networks is a challenging problem because the medium suffers from locatio dependent errors. In this paper, we propose a new scheduling poll called Proactive Earliest Due-Date (PEDD) that proactively modifies the packets' deadlines depending on the upcoming changes In the chan states. This policy gives a higher priority to packets that will see bad channel states so that they can be scheduled before their channels tu bad. Simulation results using OPNET show that our scheme can achieve lower average packet drop ratio and higher average system throughput compared to Feasible Earliest Due-Date (FEDD). Although its average system delay is higher, It still provides delay bound guarantee which vital for scheduling real-time traffic. The performance improvements of PEDD over FEDD will depend on how well the channel knowledge obtained.