Antijamming Schemes for the Generalized MIMO Y Channel.

Signal space alignment (SSA) is a promising technique for interference management in wireless networks. However, despite the excellent work done on SSA, its robustness against jamming attacks has not been considered in the literature. In this paper, we propose two antijamming strategies for the SSA scheme applied in the multiple-input-multiple-output (MIMO) Y channel. The first scheme involves projecting the jamming signal into the null space of each source's precoding vectors, effectively eliminating it entirely. The second scheme removes interference originating from the jammer by subtracting the disturbance estimate from the incoming signal. The estimate is derived on the basis of the criterion of minimizing the received signal energy. The block error rate (BLER) performance of the proposed strategies in various channel configurations is verified by link level simulations and is presented to show the efficiency in mitigating jamming signals within the SSA-based MIMO Y channel.

Genetic Algorithm-Based Cooperative Coding and Caching Data Dissemination Scheme in Multi-UAV-Enabled Internet of Vehicles.

Unmanned Aerial Vehicles (UAVs) have emerged as efficient tools in disaster-stricken areas, facilitating efficient data dissemination for post-disaster rescue operations. However, the limited onboard energy of UAVs imposes significant constraints on their operational lifespan, thereby presenting substantial challenges for efficient data dissemination. Therefore, this work investigates a data dissemination scheme to enhance the UAVs' bandwidth efficiency in multi-UAV-enabled Internet of Vehicles, thereby reducing UAVs' energy consumption and improving overall system performance when UAVs hover along designated flight trajectories for data dissemination. Specifically, first, we present a software-defined network-based framework for data dissemination in multi-UAV-enabled IoV. According to this framework, we formulate a problem called C2BS (Coding-based Cooperative Broadcast Scheduling) that focuses on optimizing the UAVs' bandwidth efficiency by leveraging the combined benefits of coding and caching. Furthermore, we demonstrate the NP-hardness of the C2BS problem by employing a polynomial time reduction technique on the simultaneous matrix completion problem. Then, inspired by the benefits offered by genetic algorithms, we propose a novel approach called the Genetic algorithm-based Cooperative Scheduling (GCS) algorithm to address the C2BS problem. This approach encompasses a coding scheme for representing individuals, a fitness function for assessing individuals, operators (i.e., crossover and mutation) for generating offspring, a local search technique to enhance search performance, and a repair operator employed to rectify infeasible solutions. Additionally, we present an analysis of the time complexity for the GCS algorithm. Finally, we present a simulation model to evaluate the performance. Experimental findings provide evidence of the excellence of the proposed scheme.

An Underwater Source Location Privacy Protection Scheme Based on Game Theory in a Multi-Attacker Cooperation Scenario.

Ensuring source location privacy is crucial for the security of underwater acoustic sensor networks amid the growing use of marine environmental monitoring. However, the traditional source location privacy scheme overlooks multi-attacker cooperation strategies and also has the problem of high communication overhead. This paper addresses the aforementioned limitations by proposing an underwater source location privacy protection scheme based on game theory under the scenario of multiple cooperating attackers (SLP-MACGT). First, a transformation method of a virtual coordinate system is proposed to conceal the real position of nodes to a certain extent. Second, through using the relay node selection strategy, the diversity of transmission paths is increased, passive attacks by adversaries are resisted, and the privacy of source nodes is protected. Additionally, a secure data transmission technique utilizing fountain codes is employed to resist active attacks by adversaries, ensuring data integrity and enhancing data transmission stability. Finally, Nash equilibrium could be achieved after the multi-round evolutionary game theory of source node and multiple attackers adopting their respective strategies. Simulation experiments and performance evaluation verify the effectiveness and reliability of SLP-MACGT regarding aspects of the packet forwarding success rate, security time, delay and energy consumption: the packet delivery rate average increases by 30%, security time is extended by at least 85%, and the delay is reduced by at least 90% compared with SSLP, PP-LSPP, and MRGSLP.

Optimizing Distributions for Associated Entropic Vectors via Generative Convolutional Neural Networks.

The complete characterization of the almost-entropic region yields rate regions for network coding problems. However, this characterization is difficult and open. In this paper, we propose a novel algorithm to determine whether an arbitrary vector in the entropy space is entropic or not, by parameterizing and generating probability mass functions by neural networks. Given a target vector, the algorithm minimizes the normalized distance between the target vector and the generated entropic vector by training the neural network. The algorithm reveals the entropic nature of the target vector, and obtains the underlying distribution, accordingly. The proposed algorithm was further implemented with convolutional neural networks, which naturally fit the structure of joint probability mass functions, and accelerate the algorithm with GPUs. Empirical results demonstrate improved normalized distances and convergence performances compared with prior works. We also conducted optimizations of the Ingleton score and Ingleton violation index, where a new lower bound of the Ingleton violation index was obtained. An inner bound of the almost-entropic region with four random variables was constructed with the proposed method, presenting the current best inner bound measured by the volume ratio. The potential of a computer-aided approach to construct achievable schemes for network coding problems using the proposed method is discussed.

BAR: Blockwise Adaptive Recoding for Batched Network Coding.

Multi-hop networks have become popular network topologies in various emerging Internet of Things (IoT) applications. Batched network coding (BNC) is a solution to reliable communications in such networks with packet loss. By grouping packets into small batches and restricting recoding to the packets belonging to the same batch; BNC has much smaller computational and storage requirements at intermediate nodes compared with direct application of random linear network coding. In this paper, we discuss a practical recoding scheme called blockwise adaptive recoding (BAR) which learns the latest channel knowledge from short observations so that BAR can adapt to fluctuations in channel conditions. Due to the low computational power of remote IoT devices, we focus on investigating practical concerns such as how to implement efficient BAR algorithms. We also design and investigate feedback schemes for BAR under imperfect feedback systems. Our numerical evaluations show that BAR has significant throughput gain for small batch sizes compared with existing baseline recoding schemes. More importantly, this gain is insensitive to inaccurate channel knowledge. This encouraging result suggests that BAR is suitable to be used in practice as the exact channel model and its parameters could be unknown and subject to changes from time to time.

Design and Analysis of Systematic Batched Network Codes.

Systematic codes are of important practical interest for communications. Network coding, however, seems to conflict with systematic codes: although the source node can transmit message packets, network coding at the intermediate network nodes may significantly reduce the number of message packets received by the destination node. Is it possible to obtain the benefit of network coding while preserving some properties of the systematic codes? In this paper, we study the systematic design of batched network coding, which is a general network coding framework that includes random linear network coding as a special case. A batched network code has an outer code and an inner code, where the latter is formed by linear network coding. A systematic batched network code must take both the outer code and the inner code into consideration. Based on the outer code of a BATS code, which is a matrix-generalized fountain code, we propose a general systematic outer code construction that achieves a low encoding/decoding computation cost. To further reduce the number of random trials required to search a code with a close-to-optimal coding overhead, a triangular embedding approach is proposed for the construction of the systematic batches. We introduce new inner codes that provide protection for the systematic batches during transmission and show that it is possible to significantly increase the expected number of message packets in a received batch at the destination node, without harm to the expected rank of the batch transfer matrix generated by network coding.

Multiple Linear-Combination Security Network Coding.

In this paper, we put forward the model of multiple linear-combination security multicast network coding, where the wiretapper desires to obtain some information about a predefined set of multiple linear combinations of the source symbols by eavesdropping any one (but not more than one) channel subset up to a certain size r, referred to as the security level. For this model, the security capacity is defined as the maximum average number of source symbols that can be securely multicast to all sink nodes for one use of the network under the linear-combination security constraint. For any security level and any linear-combination security constraint, we fully characterize the security capacity in terms of the ratio of the rank of the linear-combination security constraint to the number of source symbols. Also, we develop a general construction of linear security network codes. Finally, we investigate the asymptotic behavior of the security capacity for a sequence of linear-combination security models and discuss the asymptotic optimality of our code construction.

Efficient Communications in V2V Networks with Two-Way Lanes Based on Random Linear Network Coding.

Vehicle-to-vehicle (V2V) communication has gained significant attention in the field of intelligent transportation systems. In this paper, we focus on communication scenarios involving vehicles moving in the same and opposite directions. Specifically, we model a V2V network as a dynamic multi-source single-sink network with two-way lanes. To address rapid changes in network topology, we employ random linear network coding (RLNC), which eliminates the need for knowledge of the network topology. We begin by deriving the lower bound for the generation probability. Through simulations, we analyzed the probability distribution and cumulative probability distribution of latency under varying packet loss rates and batch sizes. Our results demonstrated that our RLNC scheme significantly reduced the communication latency, even under challenging channel conditions, when compared to the non-coding case.

Weighted BATS Codes with LDPC Precoding.

Batched Sparse (BATS) codes are a type of network coding scheme that use a combination of random linear network coding (RLNC) and fountain coding to enhance the reliability and efficiency of data transmission. In order to achieve unequal error protection for different data, researchers have proposed unequal error protection BATS (UEP-BATS) codes. However, current UEP-BATS codes suffer from high error floors in their decoding performance, which restricts their practical applications. To address this issue, we propose a novel UEP-BATS code scheme that employs a precoding stage prior to the weighted BATS code. The proposed precoding stage utilizes a partially regular low-density parity-check (PR-LDPC) code, which helps to mitigate the high error floors in the weighted BATS code We derive the asymptotic performance of the proposed scheme based on density evolution (DE). Additionally, we propose a searching algorithm to optimize precoding degree distribution within the complexity range of the precoding stage. Simulation results show that compared to the conventional weighted BATS codes, our proposed scheme offers superior UEP performance and lower error floor, which verifies the effectiveness of our scheme.

Network Coding Approaches for Distributed Computation over Lossy Wireless Networks.

In wireless distributed computing systems, worker nodes connect to a master node wirelessly and perform large-scale computational tasks that are parallelized across them. However, the common phenomenon of straggling (i.e., worker nodes often experience unpredictable slowdown during computation and communication) and packet losses due to severe channel fading can significantly increase the latency of computational tasks. In this paper, we consider a heterogeneous, wireless, distributed computing system performing large-scale matrix multiplications which form the core of many machine learning applications. To address the aforementioned challenges, we first propose a random linear network coding (RLNC) approach that leverages the linearity of matrix multiplication, which has many salient properties, including ratelessness, maximum straggler tolerance and near-ideal load balancing. We then theoretically demonstrate that its latency converges to the optimum in probability when the matrix size grows to infinity. To combat the high encoding and decoding overheads of the RLNC approach, we further propose a practical variation based on batched sparse (BATS) code. The effectiveness of our proposed approaches is demonstrated by numerical simulations.

Joint Design of Polar Coding and Physical Network Coding for Two-User Downlink Non-Orthogonal Multiple Access.

In this paper, we propose a joint polar coding and physical network coding (PNC) for two-user downlink non-orthogonal multiple access (PN-DNOMA) channels, since the successive-interference-cancellation-aided polar decoding cannot be optimal for finite blocklength transmissions. In the proposed scheme, we first constructed the XORed message of two user messages. Then, the XORed message was superimposed with the message of the weak User 2 for broadcast. By doing so, we can utilize the PNC mapping rule and polar decoding to directly recover the message of User 1, while at User 2, we equivalently constructed a long-length polar decoder to obtain its user message. The channel polarization and decoding performance can be greatly improved for both users. Moreover, we optimized the power allocation of the two users with their channel conditions by considering the user fairness and the performance. The simulation results showed that the proposed PN-DNOMA can achieve performance gains of about 0.4-0.7 dB over the conventional schemes in two-user downlink NOMA systems.

The Functional Relevance of Task-State Functional Connectivity.

Resting-state functional connectivity has provided substantial insight into intrinsic brain network organization, yet the functional importance of task-related change from that intrinsic network organization remains unclear. Indeed, such task-related changes are known to be small, suggesting they may have only minimal functional relevance. Alternatively, despite their small amplitude, these task-related changes may be essential for the ability of the human brain to adaptively alter its functionality via rapid changes in inter-regional relationships. We used activity flow mapping-an approach for building empirically derived network models-to quantify the functional importance of task-state functional connectivity (above and beyond resting-state functional connectivity) in shaping cognitive task activations in the (female and male) human brain. We found that task-state functional connectivity could be used to better predict independent fMRI activations across all 24 task conditions and all 360 cortical regions tested. Further, we found that prediction accuracy was strongly driven by individual-specific functional connectivity patterns, while functional connectivity patterns from other tasks (task-general functional connectivity) still improved predictions beyond resting-state functional connectivity. Additionally, since activity flow models simulate how task-evoked activations (which underlie behavior) are generated, these results may provide mechanistic insight into why prior studies found correlations between task-state functional connectivity and individual differences in behavior. These findings suggest that task-related changes to functional connections play an important role in dynamically reshaping brain network organization, shifting the flow of neural activity during task performance.SIGNIFICANCE STATEMENT Human cognition is highly dynamic, yet the functional network organization of the human brain is highly similar across rest and task states. We hypothesized that, despite this overall network stability, task-related changes from the intrinsic (resting-state) network organization of the brain strongly contribute to brain activations during cognitive task performance. Given that cognitive task activations emerge through network interactions, we leveraged connectivity-based models to predict independent cognitive task activations using resting-state versus task-state functional connectivity. This revealed that task-related changes in functional network organization increased prediction accuracy of cognitive task activations substantially, demonstrating their likely functional relevance for dynamic cognitive processes despite the small size of these task-related network changes.

Data Gathering Techniques in WSN: A Cross-Layer View.

Wireless sensor networks (WSNs) have taken a giant leap in scale, expanding their applicability to a large variety of technological domains and applications, ranging from the Internet of things (IoT) for smart cities and smart homes to wearable technology healthcare applications, underwater, agricultural and environmental monitoring and many more. This expansion is rapidly growing every passing day in terms of the variety, heterogeneity and the number of devices which such applications support. Data collection is commonly the core application in WSN and IoT networks, which are typically composed of a large variety of devices, some constrained by their resources (e.g., processing, storage, energy) and some by highly diverse demands. Many challenges span all the conceptual communication layers, from the Physical to the Applicational. Many novel solutions devised in the past do not scale well with the exponential growth in the population of the devices and need to be adapted, revised, or new innovative solutions are required to comply with this massive growth. Furthermore, recent technological advances present new opportunities which can be leveraged in this context. This paper provides a cross-layer perspective and review of data gathering in WSN and IoT networks. We provide some background and essential milestones that have laid the foundation of many subsequent solutions suggested over the years. We mainly concentrate on recent state-of-the-art research, which facilitates the scalable, energy-efficient, cost-effective, and human-friendly functionality of WSNs and the novel applications in the years to come.

Scalable Network Coding for Heterogeneous Devices over Embedded Fields.

In complex network environments, there always exist heterogeneous devices with different computational powers. In this work, we propose a novel scalable random linear network coding (RLNC) framework based on embedded fields, so as to endow heterogeneous receivers with different decoding capabilities. In this framework, the source linearly combines the original packets over embedded fields based on a precoding matrix and then encodes the precoded packets over GF(2) before transmission to the network. After justifying the arithmetic compatibility over different finite fields in the encoding process, we derive a sufficient and necessary condition for decodability over different fields. Moreover, we theoretically study the construction of an optimal precoding matrix in terms of decodability. The numerical analysis in classical wireless broadcast networks illustrates that the proposed scalable RLNC not only guarantees a better decoding compatibility over different fields compared with classical RLNC over a single field, but also outperforms Fulcrum RLNC in terms of a better decoding performance over GF(2). Moreover, we take the sparsity of the received binary coding vector into consideration, and demonstrate that for a large enough batch size, this sparsity does not affect the completion delay performance much in a wireless broadcast network.

A Fault-Tolerant Transmission Scheme in SDN-Based Industrial IoT (IIoT) over Fiber-Wireless Networks.

Driven by the emerging mission-critical and data-intensive applications in industrial intelligent manufacturing, the software-defined network (SDN) based fiber-wireless access network (FiWi) is attracting considerable attention thanks to its capability of central control and large bandwidth. However, the heterogeneity of the network leads to new challenges, since the packet loss can be caused either by the poor channel quality of wireless links or network component failures. A novel and adaptive mechanism combining sparse random linear network coding with parallel transmission (SNC-PT) is proposed to achieve the fault-tolerance against high packet loss rate and any network element malfunction. We illustrate the benefits of using the SNC-PT mechanism to improve fault tolerance by characterizing the network performance with respect to the completion time and goodput along with its relationship to channel quality and node failures. We show that significant performance gains can be obtained in comparison with conventional uncoded transmission based on transmission control protocol (TCP). The simulation results show that the SNC-PT mechanism is fault-tolerant, while it can significantly shorten the data transmission completion time to at least 12% of the baseline and increase the goodput by about 10% compared to other coding schemes such as random linear network coding.

Backscatter Assisted NOMA-PLNC Based Wireless Networks.

In this paper, sum capacity maximization of the non-orthogonal multiple access (NOMA)-based wireless network is studied in the presence of ambient backscattering (ABS). Assuming that ABS is located next to far nodes, it improves the signal strength of far node cluster. By applying suitable successive interference cancellation (SIC) operation, far node cluster act as an internet of things (IoT) reader. Moreover, to improve the uplink performance of the nodes, a physical layer network coding (PLNC) scheme is applied in the proposed network. Power optimization is employed at the access point (AP) to enhance the downlink performance with total transmit power constraint and minimum data rate requirement per user constraint using Lagrangian's function. In addition, end-to-end outage performance of the proposed wireless network is analyzed to enhance each wireless link capacity. Numerical results evident that the outage performance of the proposed network is significantly improved while using the ABS. Furthermore, the average bit error rate (BER) performance of the proposed wireless network is studied to improve the reliability. Simulation results are presented to validate the analytical expressions.

Cross-Layer-Aided Opportunistic Routing for Sparse Underwater Wireless Sensor Networks.

Underwater wireless sensor networks (UWSNs) have emerged as a promising technology to monitor and explore the oceans instead of traditional undersea wireline instruments. Traditional routing protocols are inefficient for UWSNs due to the specific nature of the underwater environment. In contrast, Opportunistic Routing (OR) protocols establish an online route for each transmission, which can well adapt with time-varying underwater channel. Cross-layer design is an effective approach to combine the metrics from different layers to optimize an OR routing in UWSNs. However, typical cross-layer OR routing protocols that are designed for UWSNs suffer from congestion problem at high traffic loads. In this paper, a Cross-Layer-Aided Opportunistic Routing Protocol (CLOR) is proposed to reduce the congestion in multi-hop sparse UWSNs. The CLOR consists of a negotiation phase and transmission phase. In the negotiation phase, the cross-layer information in fuzzy logic is utilized to attain an optimal forwarder node. In the transmission phase, to improve the transmission performance, a burst transmission strategy with network coding is exploited. Finally, we perform simulations of the proposed CLOR protocol in a specific sea region. Simulation results show that CLOR significantly improves the network performances at various traffic rates compared to existing protocols.

Defragmenting the 6LoWPAN Fragmentation Landscape: A Performance Evaluation.

The emergence of the Internet of Things (IoT) has made wireless connectivity ubiquitous and necessary. Extending the IoT to the Industrial Internet of Things (IIoT) places significant demands in terms of reliability on wireless connectivity. The Institute of Electrical and Electronics Engineers (IEEE) Std 802.15.4-2015 standard was designed in response to these demands, and the IPv6 over Low power Wireless Personal Area Networks (6LoWPAN) adaptation layer was introduced to address (among other issues) its payload size limitations by performing packet compression and fragmentation. However, the standardised method does not cope well with low link-quality situations and, thus, we present the state-of-the-art Forward Error Correction (FEC) methods and introduce our own contribution, Network Coding FEC (NCFEC), to improve performance in these situations. We present and analyse the existing methods as well as our own theoretically, and we then implement them and perform an experimental evaluation using the 6TiSCH simulator. The simulation results demonstrate that when high reliability is required and only low quality links are available, NCFEC performs best, with a trade-off between additional network and computational overhead. In situations where the link quality can be guaranteed to be higher, simpler solutions also start to be feasible, but with reduced adaptation flexibility.

Performance Analysis of Two-Way Satellite-Terrestrial Relay Network with SWIPT.

In this paper, we investigated the performance of a two-way satellite-terrestrial DF relay network with asymmetric simultaneous wireless information and power transfer (SWIPT). In particular, selective physical-layer network coding (SPNC) was employed in the proposed network, improving the throughput performance. We derived the expressions of system average end-to-end throughput and single node detection (SND) occurrence probability. Furthermore, to observe the effects of the power splitting (PS) coefficient on the energy efficiency performance, the expressions of energy harvested in the physical-layer network coding (PNC) and SPNC protocol were also derived. Finally, theoretical analyses and Monte Carlo simulation results are presented to show: (i) SPNC protocol outperforms the conventional PNC protocol in the two-way satellite-terrestrial relay network with SWIPT in infrequent light shadowing (ILS), average shadowing (AS), and frequent heavy shadowing (FHS) Shadowed-Rician fading channels; (ii) as the channel state gets worse, SPNC protocol can achieve more performance improvement than PNC protocol; (iii) as the PS coefficient increases, the average end-to-end throughput performance increases progressively, and the average energy efficiency performance increases progressively within a certain range, while decreasing in the others.

Secure Physical Layer Network Coding versus Secure Network Coding.

When a network has relay nodes, there is a risk that a part of the information is leaked to an untrusted relay. Secure network coding (secure NC) is known as a method to resolve this problem, which enables the secrecy of the message when the message is transmitted over a noiseless network and a part of the edges or a part of the intermediate (untrusted) nodes are eavesdropped. If the channels on the network are noisy, the error correction is applied to noisy channels before the application of secure NC on an upper layer. In contrast, secure physical layer network coding (secure PLNC) is a method to securely transmit a message by a combination of coding operation on nodes when the network is composed of set of noisy channels. Since secure NC is a protocol on an upper layer, secure PLNC can be considered as a cross-layer protocol. In this paper, we compare secure PLNC with a simple combination of secure NC and error correction over several typical network models studied in secure NC.