Throughput Maximizing and Fair Scheduling Algorithms in Industrial Internet of Things Networks

Time-slotted channel hopping (TSCH) mode in the IEEE 802.15.4-2015 standard provides ultrahigh reliability and ultralow power consumption to sensor devices. The key feature of TSCH is the scheduling of time slots and frequencies, which falls outside the current standards. In this paper, we focus on throughput maximizing and max–min fair scheduling problems in a centralized TSCH networks. At first, a polynomial time algorithm for the throughput maximizing scheduling problem is proposed. We proceed to investigate and deliberate on some instances of the problem with their combinatorial properties. Second, a novel auction-based scheduling algorithm that uses a first-price sealed-bid auction mechanism is presented for the throughput maximizing problem. Simulation results show that the proposed algorithm obtains a close throughput performance to the optimal one obtained through CPLEX with a much lower complexity. Moreover, we propose a novel heuristic for the max–min fair scheduling problem and demonstrate its performance through extensive simulations in terms of the total throughput and fairness varying the number of nodes, frequencies, and antennas. Simulation results indicate the effectiveness of the proposed algorithm and its close performance to the optimal solution.