Routing sensitive priority scheduling
Fadi Tirkawi, Stefan Fischer · 2007
In this paper, we demonstrate a new CPU-scheduling algorithm which especially takes routing issues into account. In the priority scheduling [1], an approach known for solving the overloading problem of simple FIFO CPU-scheduling, it is not guaranteed that nodes close to the base station will get fair chance to send their own packets if forwarding operations will be prioritized over local operations. We introduced the concept of priority switching in the priority scheduling approach so that such nodes can perform local tasks also. Our proposal increases the fairness of the distributed sensing and actuation.