A deadline-aware scheduler for smart factory using wifi 6

Abstract

We discuss the optimization of wireless network scheduling in smart factories, specifically focusing on data packets with varying deadlines and importance levels. The proposed solution involves utilizing IEEE 802.11ax (WiFi 6) for efficient packet transmission. The problem of scheduling packets is modeled by assigning profit to each packet and maximizing the sum of profits. We establish the problem’s NP-Hard nature and presents a 12-approximate algorithm based on local search to configure resource units (RUs) and parallel transmission durations. Extensive simulations demonstrate the algorithm’s superior performance compared to other benchmarks in various scenarios. Built on the previous work, we modelled our algorithm to accommodate various interference. We also extended our algorithm to use WiFi 7 principles.