Network Coding Scheme Research Articles

Network Coding Schemes and Cooperative Communication Systems Amplify and Forward in Outdoor Environments

Fading is a phenomenon of decreasing signal strength during transmission, caused by changes in environmental conditions or physical obstacles in the propagation path. Fading can cause interference in signal reception, such as distortion or loss of information, especially in Non-Line of Sight (NLoS) paths, where signals must pass through many paths or obstacles such as buildings, trees, or other objects. To eliminate fading interference, a cooperative communication system is created to reduce the effects of fading in wireless networks. The cooperative communication system works by utilizing other nodes in sending signals to the destination. The relay protocol used in this study is amplify and forward, where the signal to be sent will be amplified and forwarded to the destination by the relay node. A network coding scheme is added to the cooperative communication system to improve network performance. This scheme encodes each piece of information with the XOR technique. The parameters used in measuring the network coding scheme in the cooperative communication system are BER and throughput. Viewed from the BER value, the conventional cooperative communication system has better performance compared to the cooperative communication system with network coding. Cooperative communication system scheme without NC BER value is 0 when the transmit power value is -19 dBm or Gain 32. While for the cooperative communication system scheme with network coding BER value is 0 when transmit power of -9.25 dBm. Throughput system with network coding has increased by 17% compared to the conventional system.

A Network Coding Scheme Transmitting Specific Data and Universal Data Based on Deep Learning

A Network Coding Scheme Transmitting Specific Data and Universal Data Based on Deep Learning

A Lightweight Identity-Based Network Coding Scheme for Internet of Medical Things

Network coding is a potent technique extensively utilized in decentralized Internet of Things (IoT) systems, including the Internet of Medical Things (IoMT). Nevertheless, the inherent packet-mixing characteristics of network coding expose data transmission to pollution attacks, potentially compromising the integrity of original files. The homomorphic signature scheme serves as a robust cryptographic tool that can bolster network coding’s resilience against such attacks. However, current schemes are computationally intensive for signature verification, making them impractical for IoMT environments. In this study, we propose a lightweight identity-based network coding scheme (IBNS) that minimizes computational overhead during the signing and verification processes. This scheme has been demonstrated to be secure against adaptive chosen-message attacks and is well-suited for IoMT applications. Furthermore, we assess the performance of our IBNS through both theoretical and experimental analyses. Simulation outcomes confirm that our scheme outperforms previous ones in terms of practicality and efficiency.

Phase-Aligned Complex Linear Physical-Layer Network Coding in OFDM-VLC Two-Way Relay Network

We propose and experimentally demonstrate a phase-aligned complex linear physical-layer network coding (PA-CLPNC) scheme in orthogonal frequency division multiplexing (OFDM) visible light communication (VLC) two-way relay network (TWRN). The proposed scheme, based on the finite field of the Gaussian integer, achieves PNC of high-order QAMs and reduces the constellation size of the superposed signal at the relay before broadcasting it back to users. We further adopt a phase alignment strategy to enhance the minimum Euclidean distance between classes, into which the constellation points of the superposed signal at the relay are categorized. VLC-TWRN experiments with throughput of 600Mbit/s-1.47Gbit/s, using either uniform 8QAM/16QAM OFDM or bit-and-power loading, show that the proposed PA-CLPNC achieves one to two orders of magnitude reduction in the bit error ratio compared to the conventional amplify-and-forward PNC scheme.

A Secure Scheme for Network Coding with Deep Learning in Industrial Internet of Things

This paper proposes a network coding scheme that utilizes neural network coding and steganography technique for Industrial Internet of Things (IIoT). This proposal gives an efficient error-correcting and secure network coding strategy simultaneously for general non-multicast network for the first time. The trivial concatenation of the above two schemes will not work, and we adopt a smart skill to fuse the neural network coding scheme and the steganography scheme seamlessly. The whole neural network model includes the network coding part and the steganography part. The first skill is making the network coding part converge in advance, and then we make the steganography part converged. The second skill is delicately designing the neural network structure and parameters to make the whole model work efficiently. The new proposal can correct more errors and confront more eavesdroppers than state of the art method in network coding. Besides, the transmission information rate is three, which is bigger than one, which is the most information rate of traditional channel code based on Shannon theory. We use a steganography neural network model to encode three images into one image and at last, the three images can be recovered simultaneously. The new scheme will give a practical error-correcting and secure network coding strategy, and then decrease the energy consume in the communication, which will benefit IIoT.

Physical-Layer Network Coding Enhanced Visible Light Communications Using RGB LEDs

Compared with traditional radio frequency (RF)-based techniques, the advantages of wider bandwidth, higher security, and stronger electromagnetic immunity (EMI) capability make visible light communications (VLC) a good candidate technology for the 6th generation (6G) wireless communications. Red, green, and blue (RGB) light-emitting diodes (LEDs) based VLC has become an important research branch due to its low price and high reliability. However, the saturation of photodiode (PD) caused by the ambient background light may seriously degrade the bit error rate (BER) performance of an RGB-VLC system's three spatially uncoupled information streams (i.e., red, green, and blue LEDs can transmit different data packets simultaneously) in practical applications. To mitigate the ambient light interference in point-to-point RGB-VLC systems, we propose, PNC-VLC, a network-coded scheme that uses two LEDs with the same color at the transmitter to transmit two different data streams and we make use of the naturally overlapped signals at the receiver to formulate physical-layer network coding (PNC). The adaptivity of PNC-VLC could effectively improve the BER degradation problem caused by the saturation of PD under the influence of ambient light. We conducted simulations based on the parameters of commercial off-the-shelf (COTS) products to prove the superiority of the PNC-VLC under the influence of four typical illuminants. Simulation results show that the PNC-VLC system can maintain a better and more stable system BER performance under different ambient background light conditions. Remarkably, with 2/3 throughput efficiency, PNC-VLC can bring 133.3% gain to the BER performance when compared with the traditional RGB-VLC systems under the Illuminant A interference model, making it a good option for VLC with unpredictable ambient background interferences.

Optimization of Decision Thresholds in Two-Way Molecular Communication via Diffusion With Network Coding

In this paper, we investigate a two-way molecular communication via diffusion (MCvD) system, which consists of two source nanomachines and one relay nanomachine in three-dimensional channel. The combinations of decode-and-forward (DF) relaying protocol and network coding (NC) scheme are implemented by using same number of molecules (SNM) and different number of molecules (DNM) which are released by source nanomachines. First, both the effects of actual and estimated inter-symbol interference (ISI) sequences are taken into account under SNM and DNM. Then the mathematical expression of the average probability of error for this two-way MCvD system are derived by using the Genie-aided detector and the detector which estimates the ISI sequence. Furthermore, we use particle swarm optimization (PSO) algorithm to solve the optimization problem whose objective is to minimize the average probability of error to search decision threshold at each nanomachine simultaneously. Finally, the numerical results show the DF and NC scheme outperforms the DF-No-NC scheme which is without NC. Moreover, PSO algorithm has good convergence behaviors and it is the most efficient to find optimal thresholds with fewest iterations compared with gradient descent algorithm and the iterative algorithm based on block coordinate descent algorithm. The obtained results are expected to provide guidance significance in designing two-way MCvD system with optimal decision thresholds and lower average probability of error.

Performance analysis of physical-layer network coding with QPSK modulation in wireless IoT networks

In this paper, we mathematically analyze bit-error rate (BER) and diversity order of physical-layer network coding (PNC) scheme in the two-way relay channel (TWRC) under the assumption of multiple antennas at relay node. We assume the quadrature phase shift keying (QPSK) modulation for simple data transmission in IoT applications, and max–min transmit antenna selection (TAS) scheme in the broadcast (BC) phase for achieving full diversity gain. In particular, we obtain the upper bound of BER at the multiple access (MA) phase, while deriving the exact BER performance at the BC phase. To the best our knowledge, the mathematical analysis in this paper is the first analytical results in the literature. Through computer simulations, the analytical results are validated.

Sliding-Window-Based RNC Scheme in UAV Multicasting: Performance Analysis and Network Optimization

Unmanned aerial vehicles (UAVs)-enabled multicasting network has attracted significant attention in recent years. However, there are still some disadvantages of existing multicasting schemes used in these systems, such as low transmission efficiency and high feedback overhead. Accordingly, we propose a sliding coding window (SCW)-based random network coding (SCWRNC) scheme for a UAV multicasting network where one UAV base station is dispatched to the multicast data stream to multiple user equipments (UEs). The proposed scheme includes an SCW scheduling original packets for encoding, a lower triangular coding structure enabling UEs to decode out information even without receiving a full set of coded packets, and a feedback-compete mechanism requiring only one UE to send feedback information. The packet scheduling process is described as a five-tuple Markov decision process. Then, we give a theoretical analysis of the proposed scheme, based on which the sliding steps of SCW and the UAV hovering location are jointly optimized to maximize the system throughput. The optimal sliding steps are obtained by applying the Greedy scheduling technique, while the UAV optimal position is obtained by minimizing the maximum outage probability of all UEs. Furthermore, we also propose a flexible feedback mechanism, which enables more than one UE to send feedback for systems with sufficient resources and a “F-SCWRNC” scheme for systems where no UE is allowed to send feedback. Numerical results show that both the proposed SCWRNC scheme and F-SCWRNC scheme could achieve significant throughput gain over the existing ones.

LTE Modulation and Coding Schemes for 6G Networks

Background: Long Term Evolution (LTE) is the fourth generation (4G) mobile communication technology developed by the 3rd Generation Partnership Project (3GPP). In comparison to previous generations of cellular systems, LTE incorporates several innovative technologies. These innovative technologies are used to increase spectrum efficiency and data speeds, as envisioned by designers Methods: This study provides a comprehensive investigation of orthogonal frequency division multiple access and Single carrier frequency division multiple access transmission model and investigate physical layer performance of LTE system using MATLAB – Simulink Environment. Results: By providing spectrum flexibility, the SC-FDMA-OFDMA 16 QAM with AWGN Channel Transmission model achieves a higher outcome and has a packet loss rate of 0%. The numerical evaluation is used to illustrate the trade-off between loss of capacity in the time and frequency domains. Conclusion: SC-FDMA has a lower multipath propagation rate and peak to average power ratio than OFDM; therefore, multipath must be eliminated to make it more efficient. The final section of this study contains a full description of the techniques required in simulating a simple communication model.

Maximum Decoding Clique Based Maximum Weight Vertex Search Algorithm for Buffered Instantly Decodable Network Codes

The traditional instantly decodable network coding (IDNC) schemes discard the non-instantly decodable packets (NIDPs), which results in the loss of useful information. In this letter, we consider a network coding scheme named as buffered instantly decodable network coding (B-IDNC) where each receiving node can cache the NIDPs containing two unreceived packets for subsequent network decoding, and give a decoding algorithm by utilizing the maximum decoding clique. The maximum decoding clique is defined as a subset of vertices in the IDNC graph, which can be decoded together. We approximate the average packet decoding delay minimization problem as the maximum weight encoding clique problem, and a heuristic algorithm named as maximum decoding clique based maximum weight vertex (MDC-MWV) searching algorithm is proposed to solve the approximated problem. Simulation results show that our proposed algorithm can reduce the average packet decoding delay compared with the conventional IDNC schemes.

Coding and Multi-User Schemes for Future Wireless Networks

Coding and Multi-User Schemes for Future Wireless Networks

Performance Analysis and Optimization of a UAV-Enabled Two-Way Relaying Network Under FSMH, NC, and PNC Schemes

Unmanned aerial vehicles (UAVs) have played an important role in wireless communications due to the advantages, such as highly controllable mobility in 3-D space, swift deployment, Line-of-Sight (LoS) aerial–ground links, and so on. In this article, we consider a UAV-enabled two-way relaying system, where the UAV relay assists the information exchange between two ground users (GUs) under three different schemes, i.e., four-slot multihopping (FSMH) without network coding (NC), three-slot NC, and two-slot physical NC (PNC). First, the capacity region of each scheme in this relaying system is analyzed. Then, we maximize the system average sum rate by jointly optimizing the time resource allocation, transmission powers of the transceivers, and the UAV trajectory subject to the constraints on UAV mobility and information causality under each scheme. To solve those problems, we propose an iterative algorithm by applying the successive convex approximation and block coordinate descent techniques. Specifically, the time resource allocation, transmission powers, and the UAV trajectory are alternatively optimized in each iteration. In addition, the nonconvex trajectory optimization problem is solved by successively solving an approximate convex optimization problem. To gain more insights, we also investigate the performance of those three schemes with symmetric and asymmetric traffic, respectively, by introducing a new traffic pattern constraint. Numerical results show that the proposed relaying schemes with moving relay can achieve great throughput gains as compared to the conventional scheme with static relay. The three relay schemes also show great performance heterogeneity under different traffic patterns.

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.

A computationally efficient HMAC-based authentication scheme for network coding

A computationally efficient HMAC-based authentication scheme for network coding

Controllable Quantum Network Coding Scheme Based on Quantum Walk

Controllable Quantum Network Coding Scheme Based on Quantum Walk

Fishery Data Distribution System Based on Distance Prior Network Coding Strategy with Buffer Mapping Mechanism

Marine fishery production safety has always been a livelihood issue of high concern to government departments at all levels in China. With the construction of marine informatization, a large number of fishing vessels have entered the Vessel Monitoring System (VMS). The massive, highly concurrent, and continuous track data generated by these vessels has posed great challenges to real-time data distribution. To cope with low distribution efficiency in the original data distribution system, this paper proposed a data distribution model based on the combination of network coding and UDP, which improves both reliability and efficiency of data distribution. In order to further enhance the efficiency of data distribution, a Codeword Distance Priority Protocol based on Buffer Map (CDPPBM) was added to the proposed model for the concentration of innovative codewords in the network, thereby increasing the effectiveness of data received by nodes. Experimental results show that the protocol proposed in this paper improves the data distribution efficiency by about 75% on average, compared with the LT code. The influence of data block size on network coded data distribution system is not involved in the previous work. Therefore, this paper discusses the Block to Piece Protocol (BPP) for large files, divides large files into fixed sizes equally, and distributesndata blocks multiple times to find the optimal piece size. The experimental results show that there is an optimalnfor large files of different sizes, which can maximize the efficiency of data distribution.

A certificateless linearly homomorphic signature scheme for network coding and its application in the IoT

Network coding is an effective method to optimize network throughput and improve routing reliability, and has been widely used in a decentralized Internet of Things system. However, the packet-mixing property of network coding renders transmission susceptible to pollution attacks, which may prevent the reconstruction of the original file. A homomorphic signature scheme is a powerful tool that enables network coding to combat pollution attacks. Although a series of homomorphic signature schemes already exists, no construction has been proposed to support both homomorphic network coding signatures and the certificateless characteristic. In this paper, we construct a certificateless linearly homomorphic signature scheme for network coding, thus avoiding the disadvantages of certificate management and key escrow problems. We then prove the security of the scheme in a random oracle model against an adaptively chosen dataset attack under two types of adversaries. Moreover, performance analysis results show that our scheme has a lower communication overhead and enjoys a comparable computation cost with related schemes.

Network Coding-Based Post-Quantum Cryptography

We propose a novel hybrid universal network-coding cryptosystem (HUNCC) to obtain secure post-quantum cryptography at high communication rates. The secure network-coding scheme we offer is hybrid in the sense that it combines information-theoretic security with public-key cryptography. In addition, the scheme is general and can be applied to any communication network, and to any public-key cryptosystem. Our hybrid scheme is based on the information theoretic notion of individual secrecy, which traditionally relies on the assumption that an eavesdropper can only observe a subset of the communication links between the trusted parties - an assumption that is often challenging to enforce. For this setting, several code constructions have been developed, where the messages are linearly mixed before transmission over each of the paths in a way that guarantees that an adversary which observes only a subset has sufficient uncertainty about each individual message. Instead, in this article, we take a computational viewpoint, and construct a coding scheme in which an arbitrary secure cryptosystem is utilized on a subset of the links, while a pre-processing similar to the one in individual security is utilized. Under this scheme, we demonstrate 1) a computational security guarantee for an adversary which observes the entirety of the links 2) an information theoretic security guarantee for an adversary which observes a subset of the links, and 3) information rates which approach the capacity of the network and greatly improve upon the current solutions. A perhaps surprising consequence of our scheme is that, to guarantee a computational security level b, it is sufficient to encrypt a single link using a computational post-quantum scheme. That is, using HUNCC, we can ensure post-quantum security in networks where it is not possible to use public-key encryption over all the links in the network. In addition, the information rate approaches 1 as the number of communication links increases. As a concrete example, in a multipath network with three links, using a 128-bit computationally secure McEliece cryptosystem only over one link, we obtain a 128-bit individually computationally secure level over all paths with a total information rate of 0.91 in the network.

DDGS: A Network Coding Scheme for Dynamic Adaptation to Heterogeneous Vehicular Networks

The rapid development of the transportation industry has brought about the demand for massive data transmission. In order to make use of a large number of heterogeneous network resources in vehicular network, the research of applying network coding to multipath transmission has become a hot topic. Network coding can better solve the problems of packet reordering and low aggregation efficiency. The determination of coding scale is the key to network coding scheme. However, the existing research cannot adapt to the different characteristics of network resources in vehicular network, leading to larger decoding time cost and lower bandwidth aggregation efficiency. In this paper, we propose a network coding scheme called Delay Determined Group Size (DDGS), which could adaptively adjust the coding group according to the heterogeneous wireless networks state. The mathematical analysis and process design of the DDGS scheme are discussed in detail. Through a large number of simulations, we proved that the DDGS scheme is significantly superior to other coding group determination schemes in terms of decoding time cost and bandwidth aggregation efficiency.