Quantum-Safe Group Key Establishment Protocol from Lattice Trapdoors.

Group communication enables Internet of Things (IoT) devices to communicate in an efficient and fast manner. In most instances, a group message needs to be encrypted using a cryptographic key that only devices in the group know. In this paper, we address the problem of establishing such a key using a lattice-based one-way function, which can easily be inverted using a suitably designed lattice trapdoor. Using the notion of a bad/good basis, we present a new method of coupling multiple private keys into a single public key, which is then used for encrypting a group message. The protocol has the apparent advantage of having a conjectured resistance against potential quantum-computer-based attacks. All functions-key establishment, session key update, node addition, encryption, and decryption-are effected in constant time, using simple linear-algebra operations, making the protocol suitable for resource-constrained IoT networks. We show how a cryptographic session group key can be constructed on the fly by a user with legitimate credentials, making node-capture-type attacks impractical. The protocol also incorporates a mechanism for node addition and session-key generation in a forward- and backward-secrecy-preserving manner.

Multiple Access-Enabled Relaying with Piece-Wise and Forward NOMA: Rate Optimization under Reliability Constraints.

The increasing proliferation of Internet-of-things (IoT) networks in a given space requires exploring various communication solutions (e.g., cooperative relaying, non-orthogonal multiple access, spectrum sharing) jointly to increase the performance of coexisting IoT systems. However, the design complexity of such a system increases, especially under the constraints of performance targets. In this respect, this paper studies multiple-access enabled relaying by a lower-priority secondary system, which cooperatively relays the incoming information to the primary users and simultaneously transmits its own data. We consider that the direct link between the primary transmitter-receiver pair uses orthogonal multiple access in the first phase. In the second phase, a secondary transmitter adopts a relaying strategy to support the direct link while it uses non-orthogonal multiple access (NOMA) to serve the secondary receiver. As a relaying scheme, we propose a piece-wise and forward (PF) relay protocol, which, depending on the absolute value of the received primary signal, acts similar to decode-and-forward (DF) and amplify-and-forward (AF) schemes in high and low signal-to-noise ratio (SNR), respectively. By doing so, PF achieves the best of these two relaying protocols using the adaptive threshold according to the transmitter-relay channel condition. Under PF-NOMA, first, we find the achievable rate region for primary and secondary receivers, and then we formulate an optimization problem to derive the optimal PF-NOMA time and power fraction that maximize the secondary rate subject to reliability constraints on both the primary and the secondary links. Our simulation results and analysis show that the PF-NOMA outperforms DF-NOMA and AF-NOMA-based relaying techniques in terms of achievable rate regions and rate-guaranteed relay locations.

A Blind Signal Samples Detection Algorithm for Accurate Primary User Traffic Estimation.

The energy detection process for enabling opportunistic spectrum access in dynamic primary user (PU) scenarios, where PU changes state from active to inactive at random time instances, requires the estimation of several parameters ranging from noise variance and signal-to-noise ratio (SNR) to instantaneous and average PU activity. A prerequisite to parameter estimation is an accurate extraction of the signal and noise samples in a received signal time frame. In this paper, we propose a low-complexity and accurate signal samples detection algorithm as compared to well-known methods, which is also blind to the PU activity distribution. The proposed algorithm is analyzed in a semi-experimental simulation setup for its accuracy and time complexity in recognizing signal and noise samples, and its use in channel occupancy estimation, under varying occupancy and SNR of the PU signal. The results confirm its suitability for acquiring the necessary information on the dynamic behavior of PU, which is otherwise assumed to be known in the literature.

Congestion Control and Traffic Differentiation for Heterogeneous 6TiSCH Networks in IIoT.

The Routing Protocol for Low power and lossy networks (RPL) has been introduced as the de-facto routing protocol for the Industrial Internet of Things (IIoT). In heavy load scenarios, particular parent nodes are likely prone to congestion, which in turn degrades the network performance, in terms of packet delivery and delay. Moreover, there is no explicit strategy in RPL to prioritize the transmission of different traffic types in heterogeneous 6TiSCH networks, each according to its criticality. In this paper, we address the aforementioned issues by introducing a congestion control and service differentiation strategies to support heterogeneous 6TiSCH networks in IIoT applications. First, we introduce a congestion control mechanism to achieve load balancing under heavy traffic scenarios. The congestion is detected through monitoring and sharing the status of the queue backlog among neighbor nodes. We define a new routing metric that considers the queue occupancy when selecting the new parent node in congestion situations. In addition, we design a multi-queue model to provide prioritized data transmission for critical data over the non-critical ones. Each traffic type is placed in a separate queue and scheduled for transmission based on the assigned queue priority, where critical data are always transmitted first. The performance of the proposed work is evaluated through extensive simulations and compared with existing work to demonstrate its effectiveness. The results show that our proposal achieves improved packet delivery and low queue losses under heavy load scenarios, as well as improved delay performance of critical traffic.

Fog Computing Enabling Industrial Internet of Things: State-of-the-Art and Research Challenges.

Industry is going through a transformation phase, enabling automation and data exchange in manufacturing technologies and processes, and this transformation is called Industry 4.0. Industrial Internet-of-Things (IIoT) applications require real-time processing, near-by storage, ultra-low latency, reliability and high data rate, all of which can be satisfied by fog computing architecture. With smart devices expected to grow exponentially, the need for an optimized fog computing architecture and protocols is crucial. Therein, efficient, intelligent and decentralized solutions are required to ensure real-time connectivity, reliability and green communication. In this paper, we provide a comprehensive review of methods and techniques in fog computing. Our focus is on fog infrastructure and protocols in the context of IIoT applications. This article has two main research areas: In the first half, we discuss the history of industrial revolution, application areas of IIoT followed by key enabling technologies that act as building blocks for industrial transformation. In the second half, we focus on fog computing, providing solutions to critical challenges and as an enabler for IIoT application domains. Finally, open research challenges are discussed to enlighten fog computing aspects in different fields and technologies.

Efficient Resource Scheduling for Multipath Retransmission over Industrial WSAN Systems.

With recent adoption of Wireless Sensor-Actuator Networks (WSANs) in industrial automation, wireless control systems have emerged as a frontier of industrial networks. Hence, it has been shown that existing standards and researches concentrate on the reliability and real-time performance of WSANs. The multipath retransmission scheme with multiple channels is a key approach to guarantee the deterministic wireless communication. However, the efficiency of resource scheduling is seldom considered in applications with diverse data sampling rates. In this paper, we propose an efficient resources scheduling algorithm for multipath retransmission in WSANs. The objective of our algorithm is to improve efficiency and schedulability for the use of slot and channel resources. In detail, the proposed algorithm uses the approaches of CCA (clear channel assessment)-Embedded slot and Multiple sinks with Rate Monotonic scheme (CEM-RM) to decrease the number of collisions. We have simulated and implemented our algorithm in hardware and verified its performance in a real industrial environment. The achieved results show that the proposed algorithm significantly improves the schedulability without trading off reliability and real-time performance.

A Reliable Handoff Mechanism for Mobile Industrial Wireless Sensor Networks.

With the prevalence of low-power wireless devices in industrial applications, concerns about timeliness and reliability are bound to continue despite the best efforts of researchers to design Industrial Wireless Sensor Networks (IWSNs) to improve the performance of monitoring and control systems. As mobile devices have a major role to play in industrial production, IWSNs should support mobility. However, research on mobile IWSNs and practical tests have been limited due to the complicated resource scheduling and rescheduling compared with traditional wireless sensor networks. This paper proposes an effective mechanism to guarantee the performance of handoff, including a mobility-aware scheme, temporary connection and quick registration. The main contribution of this paper is that the proposed mechanism is implemented not only in our testbed but in a real industrial environment. The results indicate that our mechanism not only improves the accuracy of handoff triggering, but also solves the problem of ping-pong effect during handoff. Compared with the WirelessHART standard and the RSSI-based approach, our mechanism facilitates real-time communication while being more reliable, which can help end-to-end packet delivery remain an average of 98.5% in the scenario of mobile IWSNs.