Online Traffic Scheduling in CQF-Based TSN-WiFi Networks

With the development of industrial technology, many applications have requirements for network latency and jitter. Time-sensitive Networking (TSN) can provide deterministic services based on Ethernet. How to extend deterministic services from the wired side to the wireless side is currently a problem. In recent years, WiFi standards have introduced some new features that improve throughput while reducing latency. However, existing research separates wired and wireless scheduling, thus unable to provide end-to-end deterministic services. This paper proposes a TSN-WiFi network architecture based on cyclic queuing and forwarding (CQF), and constraints are proposed based on the characteristics of wired and wireless connections. In response to the dynamic wireless environment, online incremental scheduling algorithms are proposed to complete traffic scheduling for TSN-WiFi networks. Simulation results indicate that the BITS algorithms achieve a 5% increase in scheduling success rate, while the algorithm execution time is halved compared to the baseline.