Industrial Internet of Things (IIoT) is a high-value cyber target due to the nature of the devices and connectivity protocols they deploy. They are easy to compromise and, as they are connected on a large scale with high-value data content, the compromise of any single device can extend to the whole system and disrupt critical functions. There are various security solutions that detect and mitigate intrusions. However, as they lack the capability to deal with an IIoT’s co-existing heterogeneity and interoperability, developing new universal security solutions to fit its requirements is critical. This is challenging due to the scarcity of accurate data about IIoT systems’ activities, connectivities, and attack behaviors. In addition, owing to their multiplatform connectivity protocols and multivendor devices, collecting and creating such data are also challenging. To tackle these issues, we propose a holistic approach for generating an appropriate intrusion data set for an IIoT called X-IIoTID, a connectivity-agnostic and device-agnostic intrusion data set for fitting the heterogeneity and interoperability of IIoT systems. It includes the behaviors of new IIoT connectivity protocols, activities of recent devices, diverse attack types and scenarios, and various attack protocols. It defines an attack taxonomy and consists of multiview features, such as network traffic, host resources, logs and alerts. X-IIoTID is evaluated using popular machine and deep learning algorithms and compared with 18 intrusion data sets to verify its novelty.

Industrial Internet of Thing (IIoT) systems are considered attractive ransomware targets because they operate critical services that affect human lives and have substantial operational costs. The major concern is with brownfield IIoT systems since they have legacy edge systems that are not fully prepared to integrate with IoT technologies. Various existing security solutions can detect and mitigate such attacks but are often ineffective due to the heterogeneous and distributed nature of the IIoT systems and their interoperability demands. Consequently, developing new detection solutions is essential. Therefore, this paper proposes a novel targeted ransomware detection model tailored for IIoT edge systems. It uses Asynchronous Peer-to-Peer Federated Learning (AP2PFL) and Deep Learning (DL) techniques as a targeted ransomware detection algorithm. The proposed model consists of two modules: 1) Data Purifying Module (DPM) aims to refine and reconstruct a valuable and robust representation of data based on Contractive Denoising Auto-Encoder (CDAE), and 2) Diagnostic and Decision Module (DDM) is used to identify targeted ransomware and its stages based on Deep Neural Network (DNN) and Batch Normalization (BN). The main strengths of this proposed model include: 1) each edge gateway’s modules work cooperatively with its neighbors in an asynchronous manner and without a third party, 2) it deals with both homogeneous and heterogeneous data, and 3) it is robust against evasion attacks. An exhaustive set of experiments on three datasets prove the high effectiveness of the proposed model in detecting targeted ransomware (known and unknown attacks) in brownfield IIoT and the superiority over the state-of-the-art models.

Opportunistic network coding (ONC) has shown high potential in enhancing the quality-of-experience (QoE) for the clients of cellular networks using their previously downloaded files. In this paper, we study the problem of offloading clients from the macrocell base station (MBS) with the help of femtocaches (FCs) and ONC. We formulate this MBS offloading problem as an optimization problem over an ONC graph, and prove that it is non-deterministic polynomial-time (NP)-hard. Thus, we propose an ONC-broadcast offloading scheme, which utilizes separate ONC graphs at the MBS and FCs in addition to uncoded broadcasting, to offload the clients from the MBS. We analyze the performance of the ONC-broadcast offloading scheme and show that it is asymptotically optimal using random graph theory. Since even this ONC-broadcast offloading scheme is still NP-hard to implement, we devise an efficient heuristic to simplify the implementation. We show that the proposed heuristic reduces the worst-case complexity of implementing the ONC-broadcast offloading scheme from an exponential to a quadratic function of the total number of vertices in the FC ONC graph. Simulation results show that, despite its low complexity, the proposed heuristic achieves similar MBS offloading performance to the ONC-broadcast offloading scheme.

We propose a joint compressed sensing-based encoding and an iterative-decoding method, which we call turbo compressed sensing (turbo-CS), for the robust to noise transmission of sparse signals over an additive white Gaussian noise (AWGN) channel. The turbo-CS encoder applies 1-bit compressed sensing as a source encoder concatenated serially with a convolutional channel encoder. At the turbo-CS decoder, an iterative joint source-channel decoding method is proposed for signal reconstruction. We analyze, for the first time, the convergence of the turbo-CS decoder by determining an extrinsic information transfer chart of the constituent decoders. We modify the soft-outputs of the constituent source decoder to improve the signal reconstruction performance of the turbo-CS decoder. Our results show that for a fixed received signal to noise ratio (RSNR) of 10 dB more than 5 dB of improvement in the channel SNR is achieved after six iterations of the turbo-CS decoder. Alternatively, for a fixed SNR of-1 dB, 10 dB improvement in RSNR is achieved. Moreover, it is shown that the turbo-CS decoder outperforms the state-of-the-art algorithms for 1-bit compressed sensing reconstruction in the presence of AWGN channel in terms of signal reconstruction performance and complexity.

In this paper, we propose a new scalar linear coding scheme for the index coding problem called update-based maximum column distance (UMCD) coding scheme. The central idea in each transmission is to code messages such that one of the receivers with the minimum size of side information is instantaneously eliminated from unsatisfied receivers. One main contribution of the paper is to prove that the other satisfied receivers can be identified after each transmission, using a polynomial-time algorithm solving the well-known maximum cardinality matching problem in graph theory. This leads to determining the total number of transmissions without knowing the coding coefficients. Once this number and what messages to transmit in each round are found, we then propose a method to determine all coding coefficients from a sufficiently large finite field. We provide concrete instances where the proposed UMCD coding scheme has a better broadcast performance compared to the most efficient existing coding schemes, including the recursive scheme (Arbabjolfaei and Kim, 2014) and the interlinked-cycle cover (ICC) scheme (Thapa et al., 2017). We prove that the proposed UMCD coding scheme performs at least as well as the MDS coding scheme in terms of broadcast rate. By characterizing two classes of index coding instances, we show that the gap between the broadcast rates of the recursive and ICC schemes and the UMCD scheme grows linearly with the number of messages. Then, we extend the UMCD coding scheme to its vector version by applying it as a basic coding block to solve the subinstances.Preliminary results of this paper are presented, in part, in Sharififar2021UMCDconference This paper has supplementary downloadable material available at http://ieeexplore.ieee.org, provided by the authors. The supplementary material includes Appendix proof:A-2 (proof of Proposition prop:A-2) and Appendix proof:thm-class-ICC (proof of Theorem thm:class-ICC-UMCD). Please contact the authors for further questions about this work The authors are with the School of Engineering and Information Technology, University of New South Wales, Canberra, ACT 2600, Australia (Email:{a.sharififar, n.aboutorab, p.sadeghi}@unsw.edu.au).

This paper studies a Fog Radio Access Network (F-RAN) architecture that utilises the increasing storage and device-to-device communication capacities of users’ smart devices (referred to as F-UEs) in order to reduce the time that the central processing unit (referred to as BBU) has to spend to serve these F-UEs and thus, increases the system’s capacity. Indeed, these F-UEs can employ these capacities in cooperatively serving each other’s file requests, as long as the F-UEs have the files in their storage, rather than always receiving them through the BBU. In addition, network coding (NC) can be employed to minimize the communications among the F-UEs and from the BBU to further offload the BBU resources and reduce the energy consumed in F-UEs’ cooperation. This paper develops an algorithm for scheduling the file encoding and transmissions both among half-duplex F-UEs and from the BBU to minimise the consumed time-frequency resources from the BBU given constraints on the energy consumed by each F-UE for their cooperation to help preserve their battery life. The influence of the energy constraint on BBU offloading is investigated and the performance of the system under a variety of settings is evaluated through extensive simulations. The benefit of using NC is shown and the ability of the F-UEs to transmit with different power levels is also studied and shown to considerably impact the number of cooperating F-UEs and the BBU offloading.