A Wireless TSN Scheduling Algorithm Based on Strict Priority with Dynamic Queues
- Time-Sensitive Networking (TSN) is an IEEE 802.1 standard set to provide deterministic data transmission over Ethernet-based networks. In TSN, Strict Priority (SP) scheduling is a fundamental technique ensuring high-priority traffic to be transmitted before low-priority traffic. This prioritization strives for low-latency communication for critical applications, such as industrial automation andTime-Sensitive Networking (TSN) is an IEEE 802.1 standard set to provide deterministic data transmission over Ethernet-based networks. In TSN, Strict Priority (SP) scheduling is a fundamental technique ensuring high-priority traffic to be transmitted before low-priority traffic. This prioritization strives for low-latency communication for critical applications, such as industrial automation and automotive systems. This scheduling algorithm operates by assigning each frame a priority level of eight priorities and processing frames in descending order of priority, effectively creating a hierarchical transmission model with a constant queue number (8 queues). This paper investigates the performance of standard SP. In addition, it proposes a novel Synchronized Strict Priority with Dynamic Queues (S-SPDQ) scheduling for optimizing the processing delay as a part of the overall system latency, which is especially relevant for Wireless TSN (WTSN). The proposed algorithm was implemented as a bare-metal program on ESP32S2 which is a 32-bit Xtensa LX7 microcontroller. The SS-PDQ scheduling improves the SP model by introducing queue dynamicity to minimize overall latency and implementing time-based synchronization to ensure precise transmission delay estimation, paving the way for future enhancements in time-aware algorithms. Compared with the standard SP, the S-SPDQ introduced an average reduction in memory consumption by 50%, in the dequeuing process time by 49%, and the transmission delay by 12%. For the end-to-end latencies in selected use cases, the average reduction is 17% for 1 -queue, 15% for 4-queues and 12% for 7-queues.…


| Document Type: | Conference Proceeding |
|---|---|
| Conference Type: | Konferenzartikel |
| Zitierlink: | https://opus.hs-offenburg.de/11119 | Bibliografische Angaben |
| Title (English): | A Wireless TSN Scheduling Algorithm Based on Strict Priority with Dynamic Queues |
| Conference: | International Conference on Factory Communication Systems (21. : 10-13 June 2025 : Rostock, Germany) |
| Author: | Mohammed Wahhab Abdulrazzaq, Axel SikoraStaff MemberORCiDGND, Abdulkareem A. Kadhim |
| Year of Publication: | 2025 |
| Publisher: | IEEE |
| Page Number: | 8 |
| Parent Title (English): | 2025 IEEE 21st International Conference on Factory Communication Systems (WFCS) : Proceedings |
| Editor: | Frank Golatowski, Stefano Scanzio, Mohammad Ashjaei, Ramez Daoud, Pedro Santos, Hassanein Amer |
| ISBN: | 979-8-3315-3005-1 (Elektronisch) |
| ISBN: | 979-8-3315-3006-8 (Print on Demand) |
| ISSN: | 2835-8414 (Elektronisch) |
| ISSN: | 2835-8511 (Print on Demand) |
| DOI: | https://doi.org/10.1109/WFCS63373.2025.11077611 |
| Language: | English | Inhaltliche Informationen |
| Institutes: | Fakultät Elektrotechnik, Medizintechnik und Informatik (EMI) (ab 04/2019) |
| Research: | ivESK - Institut für verlässliche Embedded Systems und Kommunikationselektronik |
| Collections of the Offenburg University: | Bibliografie |
| Tag: | FTM; IIOT; Strict Priority; TSN; WTSN | Formale Angaben |
| Relevance for "Jahresbericht über Forschungsleistungen": | 5-fach | Konferenzbeitrag |
| Open Access: | Closed |
| Licence (German): | Urheberrechtlich geschützt |



