Jul 2026· International Conference on Ubiquitous and Future Networks· pp. 872-877· 0 citations· 10 references
Abstract
Time-Sensitive Networking (TSN) is a key mechanism for deterministic in-vehicle Ethernet, but its end-to-end behavior over 10BASE-T1S shared media remains unclear under mixed traffic in zonal architectures. This paper experimentally evaluates periodic control traffic delivered from an upper zonal Ethernet TSN domain to a lower-tier 10BASE-T1S bus. The testbed connects two cascaded SJA1110-based switches and an EVB-LAN9383 switch to a 10BASE-T1S motor-control node, with best-effort (BE) background traffic generated by an internal processing core of the second SJA1110. Control latency is measured by matching a 32-bit sequence field between source-side Ethernet and destination-side 10BASE-T1S observation points while varying BE load from 0% to 95%. We compare No GB, which strictly separates scheduled traffic (ST) and BE traffic without a guard band; fixed guard-band (GB), which closes the cycle end before the next ST window; Shared, which opens the remaining non-ST interval to both ST and BE traffic; and two ST-slot/GB-width variants. The results show that No GB suffers severe latency growth, whereas fixed GB stabilizes lowand medium-load latency near 3 ms but loses matched delivery under high load. Shared provides the best control-delivery tradeoff in the evaluated testbed, maintaining above 95% matched ratio through $\mathbf{9 0}$ % load with $\mathbf{5 1 0. 8} \mu \mathbf{s}$ and $\mathbf{6 7 8. 3} \mu \mathbf{s}$ mean latency at 0% and 90%, respectively. These results indicate that flexible shared scheduling can improve control-flow delivery compared with strict static partitioning in the evaluated 10BASE-T1S-based zonal topology, while BE fairness and synchronization-related phase effects require further study.
BASE-T1S is a low-cost multidrop Ethernet technology whose shared-medium access is governed by Physical Layer Collision Avoidance (PLCA). While attractive for automotive zonal edge networks, PLCA introduces non-trivial bus-access latency whose worst case depends on the interaction of roundrobin arbitration, empty and occupied transmit opportunities, node ordering, burst behavior, and heterogeneous traffic releases. To the best of our knowledge, this is the first paper devoted to a formal worst-case timing analysis of Ethernet 10BASE-T1S at the base PLCA MAC/PHY arbitration layer. Unlike classical algebraic analyses used for protocols such as CAN, FlexRay, or switched Ethernet, we model 10BASE-T1S as a network of timed automata and use Uppaal model checking to compute guaranteed upper bounds on protocol-level packet delays. The method also yields witness traces that explain how pathological worst-case scenarios arise, making it useful for timing debugging and design-space exploration. Our results complement simulation by isolating the contribution of PLCA itself and by exposing valid worst-case schedules that finite simulation runs may miss.
Shengjie Xu, Prateek Ganguli, K. Shazzad et al.· IEEE International Conferenc...· 0 citations
The nascTime framework on OMNeT++/Simu5G is used to evaluate how many TSN endpoints a single 5G NR cell can bridge before per-flow QoS degrades, showing that sub-3 ms TSN deadlines may require radio-configuration changes such as configured grants or higher numerology.
Mohamed A. M. Seliem, U. Roedig, C. Sreenan et al.· 0 citations
Deterministic networking is essential for safety-critical applications in automotive, industrial, and aerospace systems, where bounded end-to-end latency must be guaranteed for time-critical traffic. Time-Sensitive Networking (TSN) provides the mechanisms to achieve such guarantees, but its deployment requires expensive TSN-capable switches at every hop and complex per-switch configuration that hinders runtime reconfiguration. This paper presents SbDN, a Multi-Agent Source-based architecture that achieves TSN-grade determinism using commodity Ethernet switches. SbDN moves all scheduling intelligence to a centralized controller composed of three cooperating agents and enforces the computed configurations exclusively at the source endpoints, leaving switches as simple forwarding elements. We propose two methods: Temporal Network Partitioning (TNP), which provides strict temporal isolation on pure FIFO switches, and Traffic Prioritization (TP), which leverages strict-priority queuing at switches to enable work-conserving best-effort traffic. Both methods are formally proven to guarantee that all admitted time-critical flows meet their end-to-end deadlines. Evaluation across 40 benchmark configurations on two topologies shows that TNP and TP achieve 100\% admission of time-critical traffic in every scenario, with scheduling times in the low-millisecond range suitable for safe runtime reconfiguration. Compared to a standard TSN baseline, SbDN delivers superior time-critical latency at a fraction of the switch infrastructure cost, while offering competitive best-effort throughput through the choice between the two methods.
Mohammadparsa Karimi, Majid Nabi, Andrew Nelson et al.· 0 citations
Time-Sensitive Networking (TSN) provides guaranteed traffic delivery, making it essential for industrial automation, multimedia, automotive systems, and other areas. Although TSN is well-established in wired networks, wireless systems face extra challenges such as delays, interference, and unstable links. Extending TSN to wireless (WTSN) thus adds complexity, particularly in managing traffic. This paper proposes a data-driven solution leveraging Digital Twin (DT) modeling to enhance WTSN management. We focus on mitigating the residual service time (RST) problem introduced by non-TSN traffic generators, which increases link latency. Implemented in a real Wi-Fi TSN-based environment, our implementation demonstrates that delay prediction through WTSN-DT reduces application link latency by up to 96% at the 90th percentile in a real Wi-Fi TSN setting, relative to fixed time slot allocation.
Pablo Avila-Campos, J. Haxhibeqiri, Xianjun Jiao et al.· IEEE Access· 0 citations
The ultra-reliable low-latency communication (uRLLC) capability of 5G has created significant opportunities for industrial wireless connectivity, yet widespread use of cellular networks for closed-loop control remains challenging. Closed-loop control requires more than low packet latency and high reliability: cyclic command/feedback exchanges must complete within predictable time bounds despite changing channel conditions, recovery transmissions, mobility, and multi-device contention. This paper introduces Deterministic-5G (Det-5G), a unified radio resource allocation framework for industrial closed-loop control. Det-5G treats the complete bidirectional control cycle as the scheduling object and combines coordinated downlink/uplink allocation, adaptive bundled transmissions, group-oriented downlink communication, and optimized multi-user uplink scheduling over 5G air-interface. Its performance is evaluated through a combination of closed-form analysis and Monte Carlo scheduling experiments, with comparisons against conventional dynamic grant-based scheduling, semi-persistent scheduling/configured grant operation, and fixed proactive repetition. The evaluation shows that Det-5G improves predictability of cycle completion, maintains the target reliability under changing link conditions, and scales more effectively to multi-device control than conventional reactive scheduling, while adapting radio resource use instead of continuously provisioning for the worst case as in fixed repetition. These characteristics make cycle-oriented scheduling a pragmatic solution for reducing the determinism gap that limits the use of 5G for closed-loop control in different verticals, especially as it evolves through 5G-Advanced toward 6G.
Current end-to-end congestion-control feedback is too slow to track rapid wireless dynamics in cellular networks. We identify Grant-to-Buffer Ratio (GBR)—the ratio of base-station uplink grants to mobile-reported demand—as a millisecond-scale RAN signal of uplink resource scarcity. Measurements across AT&T, Verizon, and T-Mobile LTE/5G FDD/TDD deployments show that GBR tracks base-station uplink load and reveals congestion earlier than end-to-end feedback. Because GBR is derived from the mandatory BSR-grant exchange, it requires no base-station changes and captures scheduler decisions at their native timescale. We then design GBR-CC, a dual-loop controller that updates the sender rate on each GBR sample, using GBR for fast adaptation and end-to-end delay trends as a conservative fallback. This design lets the sender react before queues inflate while still handling non-radio bottlenecks through the outer loop. GBR-CC runs on commodity mobile devices without extra hardware or external tools. Experiments on commercial cellular networks show that GBR-CC improves average throughput over GCC by 50%, while reducing median playout latency by 32–53% and freeze rate by 60%; compared with BBR, it improves average throughput by 5% and halves median RTT.
Qiang Wu, Yuxin Liu, Tianyang Zhang et al.· Conference on Applications,...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
