The Industrial Internet of Things (IIoT), integral to Industry 4.0, leverages Wireless Low-power and Lossy Networks (LLNs) for critical applications. These networks fulfill demanding industrial requirements, ensuring limited end-to-end latency and high reliability. The Internet Engineering Task Force (IETF) has developed the 6TiSCH protocol stack, a network architecture comprising cutting-edge standards to support this IIoT paradigm. Particularly, the 6TiSCH architecture introduces id=R1“tracks”’tracks’ to deliver deterministic Quality of Service (QoS) across diverse networks, aligning with stringent Service Level Agreements (SLAs). Furthermore, the Reliable and Available Wireless (RAW) work group, now part of the Deterministic Networking (DetNet) group, enhances this concept for wireless-specific challenges. The RAW framework effectively balances redundancy against constraints like spectrum and battery usage. It incorporates reliability mechanisms, including tracks and specialized control routines. This paper focuses on applying id=R1“tracksid=R1” within deterministic 6TiSCH networks, in line with IETF standardsid=R1, to demonstrate the ability of tracks to tend towards deterministic id=R1performanceperformace in wireless mesh networks. id=R1We provide a new remote network management interface, evolved from current 6TiSCH protocols, particularly 6top and CoAP, designed to install and maintain tracks in 6TiSCH networks. id=R1We aim to extend current 6TiSCH protocols, particularly 6top and CoAP, to establish a remote monitoring system for track processing and lifecycle management. Our approach, implemented in the OpenWSN open-source protocol stack, is id=R1evaluatedtested on id=R1real OpenMote-B hardware for two real-life use cases. id=R1The performance evaluation shows drastic improvement in latency (up to 4.5 times).

Smart metering IoT applications are among the most energy-critical in the current panorama. Metering sensors are battery-powered and are expected to have a lifetime exceeding ten years. In order to achieve such long operation duration, a generic header compression mechanism named Static Context Header Compression (SCHC) has been introduced and accepted as a standard by the Internet Engineering Task Force (IETF). This paper aims to demonstrate the energy savings enabled by the use of SCHC on a cellular IoT network by the means of real-life implementation and measurements. Experiments are conducted in a controlled environment for different scenarios and considering multiple parameters such as message size and radio conditions. Measurements show the high impact of this header compression mechanism, particularly when the radio conditions are bad and repetitions are used to improve the reliability of the transmission: a reduction of up to 40% in energy consumption is observed. Using SCHC over the non-IP transport mode (NIDD) of NB-IoT compared to the legacy IP mode also enables significant energy savings and allows the latency to be reduced while maintaining the interoperability provided by the IP layer.

Non-orthogonal multiple access schemes with grant free access have been recently highlighted as a prominent solution to meet the stringent requirements of massive machine-type communications (mMTCs). In particular, the multi-user shared access (MUSA) scheme has shown great potential to grant free access to the available resources. For the sake of simplicity, MUSA is generally conducted with the successive interference cancellation (SIC) receiver, which offers a low decoding complexity. However, this family of receivers requires sufficiently diversified received user powers in order to ensure the best performance and avoid the error propagation phenomenon. The power allocation has been considered as a complicated issue especially for a decentralized decision with a minimum signaling overhead. In this paper, we propose a novel algorithm for an autonomous power decision with a minimal overhead based on a tight approximation of the bit error probability (BEP) while considering the error propagation phenomenon. We investigate the efficiency of multi-armed bandit (MAB) approaches for this problem in two different reward scenarios: (i) in Scenario 1, each user reward only informs about whether its own packet was successfully transmitted or not; (ii) in Scenario 2, each user reward may carry information about the other interfering user packets. The performances of the proposed algorithm and the MAB techniques are compared in terms of the successful transmission rate. The simulation results prove that the MAB algorithms show a better performance in the second scenario compared to the first one. However, in both scenarios, the proposed algorithm outperforms the MAB techniques with a lower complexity at user equipment.