Jul 2026· Annual International Computer Software and Applications Conference· pp. 1231-1239· 0 citations· 16 references
Computer Science
Abstract
Base-T1S Ethernet is a promising technology for integrating low-rate electronic control units (ECUs) in invehicle and industrial networks, because it supports multidrop communication over a single-pair physical layer while preserving an Ethernet-based architecture. Its Physical Layer Collision Avoidance (PLCA) mechanism assigns deterministic transmission opportunities to nodes in a round-robin manner. IEEE 802.1Qav Credit-Based Shaper (CBS) is widely adopted in TSN/AVB networks to regulate class-based bandwidth and suppress traffic burstiness, and can be deployed locally within each ECU before frames are forwarded to the PLCA MAC-PHY. Existing CBS analyses typically assume full-duplex point-to-point Ethernet links, where an eligible queue, once selected by the local scheduler, can receive continuous transmission service at the link rate. This assumption does not directly hold in PLCA-based multidrop networks, where an ECU can transmit only during its assigned transmission opportunities. For control, diagnostic, and safety-related traffic, average delay or finite simulation traces are insufficient to certify whether timing requirements are always met; designers instead need deterministic upper bounds on the worst-case delay. However, in PLCA-based 10Base-T1S networks, the service available to CBS-shaped traffic is determined by the interaction among CBS credit evolution, PLCA access timing, and local non-preemptive priority scheduling. Therefore, these mechanisms must be modeled jointly to derive such bounds. This paper develops a network-calculus model for CBS-shaped traffic over PLCA-based 10Base-T1S networks. Numerical examples and simulation results demonstrate how CBS parameters and PLCA configurations influence the resulting delay bounds.
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
This work ranks the DCF and traffic parameters that shape throughput, collision probability, delay, packet delivery ratio and Age of Information in a single-AP V2I network, and derives a closed-form contention-window control law, linear in the contending population and closed with a Greenshields density model.
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
This paper evaluates the performance of the Orthogonal Frequency Division Multiple Access (OFDMA) technique within dense IEEE 802.11be (Wi-Fi 7) network environments. As traditional CSMA/CA-based networks reach their scalability limits, this work investigates how OFDMA interacts with key MAC layer features, specifically frame aggregation (A-MPDU/A-MSDU) and Spatial Reuse (SR), using BSS Coloring and OBSS/PD thresholds. Through simulation-based analysis, the work demonstrates that OFDMA provides substantial scalability gains, with throughput improvements of up to 49% in Downlink (DL) and 70% in Uplink (UL), while effectively preventing delay escalation. However, the results also reveal that these benefits are highly sensitive to Resource Unit (RU) granularity and scheduler design. In scenarios with frame aggregation, legacy OFDM may still offer higher throughput, and the effectiveness of Spatial Reuse remains highly constrained in UL and DL-OFDMA due to protocol and power density limitations. The paper concludes that maximizing Wi-Fi 7 performance requires precise parameter tuning adjusted to specific traffic types, network topologies, and utilized mechanisms.
Marek Natkaniec, Jakub Kogut· Applied Sciences· 0 citations
Wi-Fi 8 introduces Prioritized EDCA (P-EDCA) to support latency-critical traffic within which DS-RTS/CTS operates as a two-phase channel access procedure. In this mechanism, stations first compete in a Defer Signal (DS) contention, which determines the number of stations entering RTS/CTS contention, creating a stochastic coupling not captured by existing IEEE 802.11 models. We develop an analytical framework for the performance analysis of DS-RTS/CTS using a 2-D Markov chain to model the RTS backoff process of a tagged station under a variable number of contenders. Using this model, we obtain expressions for head-of-line delay and normalized throughput. We further formulate an optimization problem for adaptive selection of the DS contention window size. Results show that a moderately sized DS contention window achieves a favorable throughput-delay trade-off across network densities.
Mahith Chintada, Sreelakshmi Manjunath· International Conference on...· 0 citations
An improved strict-priority Deficit Round-Robin (SP-DRR) scheduling strategy is proposed and incorporates it into a unified moment generating function (MGF) analytical framework, referred to as SP-DRR-MGF, for probabilistic E2E delay analysis in 5G–TSN networks.
Xiaohuan Zhang, Jiancheng Qin, Yiqin Lu et al.· PeerJ Computer Science· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.