Mean and Maximum Task Waiting Times of Edge-Enabled Fair Scheduling in Smart Cities

In this work, we propose an IoT-based edge-enabled smart city architecture which supports applications in several domains like healthcare and transportation. We propose a priority-based task scheduling algorithm that handles the tasks depending on their importance, while applying novel fairness procedures. Tasks are categorized as emergency or normal tasks, with the normal class of tasks having several sub-classes, with different priority levels. System performance has been evaluated via extensive simulations. It has been found that the proposed algorithm considerably reduces the mean and maximum waiting times for higher-priority tasks without making other task types suffer high waiting times.