Understanding Multi-Task Schedulabilityin Duty-Cycling Sensor Networks

TLDR: This work investigates a fundamental scheduling problem of both theoretical and practical importance, called multi-task schedulability problem, to determine the maximum number of tasks that can be scheduled within their deadlines and work out such a schedule.

Abstract: In many sensor network applications, multiple data forwarding tasks usually exist with different source-destination node pairs. Due to limitations of the duty-cycling operation and interference, however, not all tasks can be guaranteed to be scheduled within their required delay constraints. We investigate a fundamental scheduling problem of both theoretical and practical importance, called multi-task schedulability problem, i.e., given multiple data forwarding tasks, to determine the maximum number of tasks that can be scheduled within their deadlines and work out such a schedule. We formulate the multi-task schedulability problem, prove its NP-Hardness, and propose an approximate algorithm with analysis on the performance bound and complicity. We further extend the proposed algorithm by explicitly altering duty cycles of certain sensor nodes so as to fully support applications with stringent delay requirements to accomplish all tasks. We then design a practical scheduling protocol based on proposed algorithms. We conduct extensive trace-driven simulations to validate the effectiveness and efficiency of our approach with various settings.