Among the many industrial wireless solution candidates, 5G New Radio (NR) has drawn significant attention in recent years due to its capabilities to support ultra-high-speed communication, wide coverage, ultra-low latency, and massive connectivity. Despite its great potential, 5G NR also brings significant complexity in scheduling data flows to meet their hard real-time requirements in industrial applications. In this paper, we first leverage a 5G RAN testbed to benchmark the downlink throughput and explore the impact of modulation and coding scheme (MCS) selection on the network performance. We then formulate a real-time flow scheduling problem in industrial 5G NR, which features per-flow real-time schedulability guarantee through time-frequency resource allocation. We propose a novel two-phase scheduling framework, named 5G-TPS, to construct a schedule that meets the deadlines of all the flows. To adapt to dynamic channel conditions, 5G-TPS enables online schedule adjustment for affected flows to meet their timing requirements. For large-scale multi-cell 5G industrial systems with cloud radio access network (C-RAN) architecture, we further introduce a user association algorithm respecting the real-time requirements of individual user equipment (UEs). Extensive experimental studies show that 5G-TPS can achieve schedulability ratios comparable to the Satisfiability Modulo Theory (SMT)-based exact solution and outperform many other state-of-the-art scheduling approaches, including the built-in 5G NR schedulers.

A growing trend in large-scale industrial system design is the integration of multiple real-time, mission-critical applications over shared network infrastructures to reduce hardware costs and improve scalability. Recent advances in network resource partitioning techniques provide practical mechanisms for managing these applications hierarchically while maintaining operational isolation. However, as system complexity increases, applications often exhibit multi-state behaviors that challenge the system's ability to meet stringent timing requirements - especially under static resource partitions. While dynamic resource reconfiguration can restore feasibility, it is typically costly and disruptive in industrial environments. To address this challenge, we propose a flexibility-aware network resource partitioning framework that introduces a novel metric - partition flexibility - to quantify how effectively a resource partition supports an application's state transitions. Using this metric, we develop efficient strategies for both static partition allocation and dynamic partition adjustment, with the goal of minimizing reconfiguration overhead. We validate our framework design through a real-world case study involving a NASA extra-terrestrial habitat system deployed on a time-sensitive networking (TSN) testbed. Extensive simulations further demonstrate that the proposed partitioning framework reduces$\mathbf{5 6. 4 \%}$reconfigurations compared to the state-of-the-art methods.

Resource virtualization is a promising technique that has been increasingly deployed in industrial automation systems to support multiple time-critical applications sharing the same physical resources. Extensive studies have been reported on how to perform real-time virtualization on computing resources. However, when applying virtualization techniques on network resources (especially for real-time wireless networks), node dependency among applications, wireless channel contention and stringent end-to-end timing requirements of the real-time flows in the network pose severe challenges. To address this problem, this paper formulates the network virtualization problem for multi-hop multi-channel real-time wireless networks (RTWNs). We first present a Satisfiability Modulo Theory (SMT)-based exact solution to capture the constraints posted by each application's resource interfaces and node dependency graphs. A novel supply graph (SG)-based partitioning framework, SGP, is then proposed to determine the resource partitions for individual applications. SGP uses supply graph to maintain compliance with the regularity constraints while efficiently allocating resources. Experimental results from both a real-world testbed and extensive simulations show that SGP can achieve comparable success ratio with the SMT-based exact solution but reduce the computational overhead significantly.

Among the many industrial wireless solution candidates, 5G New Radio (NR) has drawn significant attention in recent years due to its capabilities to support ultra-high-speed communication, ultra-low latency, and massive connectivity. Despite its great potential, 5G NR also brings significant complexity in scheduling industrial data flows to meet their hard real-time requirements. In this paper, we first leverage a real-world 5G RAN testbed to benchmark the downlink throughput and explore the impact of modulation and coding scheme (MCS) selection on the network performance. We then formulate a real-time flow scheduling problem in industrial 5G NR, which features per-flow real-time schedulability guarantees through time-frequency-space resource allocation. We propose a novel two-phase scheduling framework, named 5G-TPS, to construct the schedule that meets the deadlines of all the flows. To adapt to dynamic channel conditions, 5G-TPS enables online schedule adjustment for affected flows to meet their timing requirements. To evaluate the performance of 5G-TPS, we present a case study of a motion control panel use case and perform extensive experiments. The results show that 5G-TPS can achieve schedulability ratios comparable to the Satisfiability Modulo Theory (SMT)-based exact solution and outperform many other state-of-the-art scheduling approaches, including the built-in 5G NR schedulers.

Thermal covert channel (TCC) attacks have been a serious security concern to the use of many-core chips. Severity of these attacks is directly linked to the TCC’s transmission rate and its BER (bit error rate) performance, both of which are impacted by the transmission characteristics of thermal signals and adopted encoding, modulation, and multiplexing schemes. This paper examines, compares, and analyzes various TCCs built upon different combinations of encoding, modulation, and multiplexing. In particular, our study shows that TCC using non-return-to-zero (NRZ) line coding and frequency shift keying (FSK) modulation achieves the highest throughput of 120 bps and BER of below 10%.

Industrial wireless networks (IWNs) are being increasingly deployed in the field to serve as the network fabrics for various industrial Internet-of-Things (IIoT) applications. Given that IWNs typically operate in noisy and harsh environments, frequently occurring network dynamics post huge challenges for IWN resource management especially when the network scales up. Existing centralized and distributed network management solutions either suffer from large communication overhead and time delay, or introduce schedule collisions which unnecessarily degrade the system performance. To address these problems, this work proposes a novel HierArchical Resource Partitioning framework (HARP), to provide dynamic resource management in IWNs. By hierarchically partitioning and allocating resources for the links in the network, HARP enables distributed collision-free resource allocation. HARP enables rapid adjustment of the partitions in the presence of network dynamics with modest communication overhead. The effectiveness of HARP is validated and evaluated through both simulation studies and testbed experiments on a 50-node multi-channel multi-hop 6TiSCH network.

With the rapid growth of industrial Internet of Things (IIoT) applications, real-time wireless networks (RTWNs) are playing an increasingly important role in providing realtime, reliable, and secure communication services for these applications. A key challenge in RTWN management is to ensure real-time Quality of Services (QoS), especially in the presence of unexpected external (i.e., application-side) and internal (i.e., network-side) disturbances. This paper presents a novel framework, DS-PaS, to determine the packet transmission schedule for multi-channel multi-hop RTWNs at the data link layer in a distributed and dynamic fashion. DS-PaS is able to (i) handle external disturbances, (ii) support spatial reuse, (iii) meet deadlines of all critical tasks, and (iv) minimize the number of dropped non-critical packets. To avoid transmission collisions when using inconsistent information in a distributed framework, DS-PaS incorporates several key advances in both the data-link layer protocol and algorithm design so that individual nodes can build on-line schedules with only local interference information. Extensive evaluation based on both testbed implementation and simulation validates the correctness of the DS-PaS design and demonstrates its effectiveness compared to the state of the art.

The fifth-generation (5G) cellular networks are increasingly considered for industrial applications, such as factory automation systems. In 5G networks, Enhanced Mobile Broadband (eMBB) and Ultra-Reliable Low-Latency Communication (URLLC) are two essential services. eMBB services require high data rates with some lower bounds while URLLC traffic is subject to strict latency and reliability requirements. Existing approaches to scheduling coexisting eMBB and URLLC traffic all assume that URLLC traffic preempts eMBB traffic immediately upon arrival, which can adversely impact the achievable eMBB data rates. Furthermore, none of the prior work considers guaranteeing minimum data rate requirements imposed on certain eMBB traffic. This paper proposes a new model to capture the URLLC and eMBB requirements and introduces a novel framework, QoSG-RA, to perform network resource allocation for coexisting eMBB and URLLC traffic. QoSG-RA builds on a hybrid offline/online approach which performs offline resource allocation to ensure the Quality of Service (QoS) requirements of eMBB and URLLC traffic to be satisfied and online resource allocation to maximize fairness on the data rates among eMBB traffic based on runtime information. QoSG-RA is able to (i) meet latency and reliability requirements of URLLC traffic, and (ii) maximize the data rates for eMBB traffic in a fair way while fulfilling their minimum data rate requirements. Experimental results demonstrate the effectiveness of QoSG-RA compared to the state-of-the-art.

Industrial Internet of Things (IIoT) systems aim to interconnect a large number of heterogeneous industrial sensing and actuation devices through both wired and wireless communication technologies and further connect them to the Internet to achieve ubiquitous sensing, computing and control services [1]. As a representative IIoT technology, 6TiSCH [2] targets at gluing together the 802.15.4e data link layer (offering industrial performance in terms of timing, reliability and power consumption) and an IP-enabled upper layer stack to achieve both deterministic network performance and seamless integration with Internet services. In recent years, 6TiSCH has been receiving increasing attentions from both industry and academia. We have witnessed its wide deployment in many industrial domains, including advanced manufacturing, industrial process control, smart grids, and healthcare.

The past decade has witnessed the rapid development of real-time wireless technologies and their wide adoption in various industrial Internet-of-Things (IIoT) applications. Among those wireless technologies, 6TiSCH is a promising candidate as the de facto standard due to its nice feature of gluing a real-time link-layer standard (802.15.4e, for offering deterministic communication performance) together with an IP-enabled upper-layer stack (for seamlessly supporting Internet services). 6TiSCH's built-in random slot selection scheduling algorithm, however, often leads to large and unbounded transmission latency, thus can hardly meet the real-time requirements of IIoT applications. This paper proposes an adaptive partition based scheduling framework, APaS, for 6TiSCH networks. APaS introduces the concept of resource partitioning into 6TiSCH network management. Instead of allocating network resources to individual devices, APaS partitions and assigns network resources to different groups of devices based on their layers in the network so as to guarantee that the transmission latency of any end-toend flow is within one slotframe length. APaS also employs a novel online partition adjustment method to further improve its adaptability to dynamic network topology changes. The effectiveness of APaS is validated through both simulation and testbed experiments on a 122-node multi-hop 6TiSCH network.

As a means to thwart thermal covert channel attack in a multi-/many-core system, a strong heat noise whose frequency band coincides with that occupied by the thermal covert channel is injected to jam the channel. However, this undiscriminating channel jamming-based countermeasure will fail if a thermal covert channel is allowed to change its transmission frequency dynamically in response to the jamming. To combat this enhanced thermal covert channel, a more advanced countermeasure is needed and thus proposed that checks the frequency spectrum and tracks any possible covert channel. Only after a channel is detected to be susceptible, a thermal noise with this channel frequency is then emitted to jam the covert channel. The communication protocols and frequency changing scheme pertaining to this enhanced thermal covert channel are described in this article. The experimental results confirm that, when the proposed countermeasure is applied, the enhanced thermal covert channel, much more resilient to jamming, suffers from an extremely high packet error rate (PER), which makes any meaningful data leakage practically impossible. As the proposed countermeasure method is poised to contain dangerous thermal covert channel attacks with an anti-jamming capability, it lends itself well to secure multi-/many-core systems.