An efficient centralized scheduling algorithm in IEEE 802.15.4e TSCH networks

IEEE 802.15.4e Time Slotted Channel Hopping (TSCH) standard has gained a lot of attention within the Industrial Internet of Things research community due to its effectiveness in improving reliability and providing ultra-low power consumption for industrial applications, and in which its communication is orchestrated by a schedule. Despite its relevance, the standard leaves out of its scope in defining how the schedule is built, updated and maintained. This open issue is one of the trending topics in the IETF 6TiSCH WG, that still need to be addressed. This work focuses on scheduling in TSCH networks in a centralized manner where the gateway makes time and frequency slot allocation. This paper formulates the scheduling problem as a throughput maximization problem and delay minimization problem. We propose a graph theoretical approach to solve the throughput maximization problem in a centralized way. The combinatorial properties of the scheduling problem are addressed by providing an equivalent maximum weighted bipartite matching (MWBM) problem to reduce the computational complexity and also adopting the Hungarian algorithm in polynomial time. Simulation results are provided to evaluate the performance of the proposed scheme