Heuristic Algorithms for Scheduling Resources in Time-Constrained Wireless Sensor Networks

This paper proposes a heuristic algorithm for scheduling multiple channels and multiple timeslots in a time-constrained industrial wireless sensor network. The objective is to minimize the end-to-end (e2e) delay. The proposed algorithm is compared with the meta-heuristics in terms of the given e2e delay bound, where it is common in time-constrained industrial networks. Not surprisingly, the meta-heuristics is more accurate in finding a global optimum or sub-optimal values than the heuristic approach at the expense of significant run times and programming effort. The proposed greedy heuristic approach has advantages such as reflection of design context in decision-making and fast communication between stakeholders.