Priority EDF Scheduling Scheme for MANETs

Analytical EDF Priority schedulers are not common in Mobile Ad-hoc Networks (MANETs). Some researchers like Abhaya et al. have proposed a classical preemptive Earliest Deadline First (EDF) scheduler. The goal of this EDF scheduler was to favor higher priority packets thereby reducing their waiting times. Accordingly, favoring higher priority queues end up increasing the waiting times of lower priority queues. We improve Abhaya’s approach and adopt it to the MANETs environment. We numerically study the performance of the Adopted and Improved Adopted Abhaya Earliest Deadline First (IEDF) models for different packet queues. Our analytical results show that the IEDF model shortens the waiting times of packets of the different queues at various system loads in comparison to the Adopted Abhaya EDF model.