To better understand the wireless network design with a large number of hops, we investigate a line network formed by general discrete memoryless channels (DMCs), which may not be identical. Our focus lies on Generali...
详细信息
With the consolidation of Industry 4.0, IIoT (Industrial IoT) environments are becoming more common. Communications in these scenarios are mostly wireless, and due to the lossy nature of wireless links, loss of inform...
详细信息
ISBN:
(纸本)9781450372077
With the consolidation of Industry 4.0, IIoT (Industrial IoT) environments are becoming more common. Communications in these scenarios are mostly wireless, and due to the lossy nature of wireless links, loss of information becomes an intrinsic problem. Conventional recovery schemes come at cost, since they increase the delay. On the other hand, both reliability (robustness) and low delay are crucial requirements for IIoT. An interesting strategy to improve both of them is the use of network coding techniques, which have shown promising results, in terms of increased reliability and performance. Besides improving communication performance, network coding techniques enable a more efficient multi-cloud storage, which is often used in IIoT. This thesis aims at finding a network coding based solution that would efficiently respond to IIoT needs.
It is becoming more and more popular to share video among multiple users. However, sharing video in traditional cellular networks will incur high expense. Device-to-Device (D2D) communication is one of the key technol...
详细信息
ISBN:
(纸本)9781728125428
It is becoming more and more popular to share video among multiple users. However, sharing video in traditional cellular networks will incur high expense. Device-to-Device (D2D) communication is one of the key technologies in the 5th generation(5G) networks, and it enables the devices to transmit data directly without the relay of base stations. This paper proposes a network-coding-based video distribution scheme for D2D communication environment. In the scheme, the network coding technology is applied in the H.264 video transmission, which can also provide additional protection to key information of the video. This scheme enables the receivers to decode the original video with a high probability, especially in the networks with interferences. Simulation results show that the quality of video is improved after using network coding.
The McEliece cryptosystem based on quasi-cyclic low-density parity check (QC-LDPC) codes is presented to offer both security and error-correction simultaneously in the determined network coding system. The characteris...
详细信息
The McEliece cryptosystem based on quasi-cyclic low-density parity check (QC-LDPC) codes is presented to offer both security and error-correction simultaneously in the determined network coding system. The characteristics of the cryptosystem make it does not need to reduce information rate additionally to offer security. The messages u is encoded into x with QC-LDPC. x is transmitted through a network where a network coding error-correcting scheme is performed. rho links are observed by the adversary and t errors occur in the network. The characteristic of MDS code make the errors cannot be spread, therefore, the corrupted packets which occur in t links will cause at most t errors in the received messages in the sink. As long as the number of errors occuring in the intermediate links will not exceed the minimum distance of QC-LDPC codes, the hybrid scheme can perform error-correcting and security simultaneously. The information rate reaches n-2t instead of n-mu-2t where n is the max-flow min-cut.
The authors consider a scenario in which two wireless nodes communicate via a single access-point with two buffers using network coding. The access point first pairs each data packet being sent from each node and then...
详细信息
The authors consider a scenario in which two wireless nodes communicate via a single access-point with two buffers using network coding. The access point first pairs each data packet being sent from each node and then performs the network coding operation. Packets arriving at the access point that are unable to be paired are instead loaded into one of the two buffers at the access point. When one of the buffers is empty and the other is not, network coding is not possible. When this happens, the access point must either wait for a network coding opportunity, or transmit the unpaired packet without coding. The authors analyse the trade-off that arises between decreasing packet delay time, and increasing efficiency of the wireless spectrum usage as double-ended push-out queueing theory problem under phase type data arrivals. They use this model to resolve the optimal threshold policy and analyse the performance of the system.
To efficiently collect sensor readings in cluster-based wireless sensor networks, we propose a structural compressed network coding (SCNC) scheme that jointly considers structural compressed sensing (SCS) and network ...
详细信息
To efficiently collect sensor readings in cluster-based wireless sensor networks, we propose a structural compressed network coding (SCNC) scheme that jointly considers structural compressed sensing (SCS) and network coding (NC). The proposed scheme exploits the structural compressibility of sensor readings for data compression and reconstruction. Random linear network coding (RLNC) is used to re-project the measurements and thus enhance network reliability. Furthermore, we calculate the energy consumption of intra- and inter-cluster transmission and analyze the effect of the cluster size on the total transmission energy consumption. To that end, we introduce an iterative reweighed sparsity recovery algorithm to address the all-or-nothing effect of RLNC and decrease the recovery error. Experiments show that the SCNC scheme can decrease the number of measurements required for decoding and improve the network's robustness, particularly when the loss rate is high. Moreover, the proposed recovery algorithm has better reconstruction performance than several other state-of-the-art recovery algorithms.
Wireless mesh networks represent a key architecture on which several communication systems are relaying. Implementations of these networks which apply contention-based user access control and classical routing techniq...
详细信息
Wireless mesh networks represent a key architecture on which several communication systems are relaying. Implementations of these networks which apply contention-based user access control and classical routing techniques suffer throughput limitations and scale poorly with the number of network nodes. One of the solutions proposed to overcome the throughput limitations and improve scalability is the use of network coding (NC) techniques. This paper proposes three algorithms for computing the coding solutions in the network's nodes when opportunistic NC techniques are employed. The proposed algorithms, applicable in fixed or nomadic networks, rely on the availability of the topology information in the relay nodes which perform NC coding and are strongly related to the transmission buffer management and neighbor nodes selection algorithms. The first two algorithms have lower complexity and the potential to be used in time constrained applications, while the third algorithm is a brute force like one, which can exploit most of the coding opportunities offered by the mesh architecture. Computer simulations performed on test scenarios with large number of nodes and data flows show that all proposed algorithms can achieve significant throughput improvements compared to the uncoded transmissions.
The McEliece cryptosystem based on rank-metric codes is presented to offer both security and error-correction simultaneously in random network coding system. In the multicast network, the original messages are encoded...
详细信息
The McEliece cryptosystem based on rank-metric codes is presented to offer both security and error-correction simultaneously in random network coding system. In the multicast network, the original messages are encoded with McEliece cryptosystem based on Gabidulin codes. Key distribution will be done one time. The rank codes decoding is performed in the sink. As long as t < d(R) (C) /2, the decoding is guaranteed, where t is the number of corrupted packets and d(R) (C) is the minimum rank distance of the rank codesC. Original messages are protected based on the cryptosystem. Compared with the rate n - mu - 2t in traditional SEC network codes, the rate approaches n-2t where mu is the number of eavesdroppers. The rate won't decrease as the number of eavesdropped edges increases.
The rate of a network code is the ratio of the block size of the network's messages to that of its edge codewords. We compare the linear capacities and achievable rate regions of networks using finite field alphab...
详细信息
The rate of a network code is the ratio of the block size of the network's messages to that of its edge codewords. We compare the linear capacities and achievable rate regions of networks using finite field alphabets to the more general cases of arbitrary ring and module alphabets. For non-commutative rings, two-sided linearity is allowed. Specifically, we prove the following for directed acyclic networks. First, the linear rate region and the linear capacity of any network over a finite field depend only on the characteristic of the field. Furthermore, any two fields with different characteristics yield different linear capacities for at least one network. Second, whenever the characteristic of a given finite field divides the size of a given finite ring, each network's linear rate region over the ring is contained in its linear rate region over the field. Thus, any network's linear capacity over a field is at least its linear capacity over any other ring of the same size. An analogous result also holds for linear network codes over module alphabets. Third, whenever the characteristic of a given finite field does not divide the size of a given finite ring, there is some network whose linear capacity over the ring is strictly greater than its linear capacity over the field. Thus, for any finite field, there always exist rings over which some networks have higher linear capacities than over the field.
Establishing code equivalences between index coding and network coding provides important insights for code design. Previous works showed an equivalence relation between any index-coding instance and a network-coding ...
详细信息
Establishing code equivalences between index coding and network coding provides important insights for code design. Previous works showed an equivalence relation between any index-coding instance and a network-coding instance, for which a code for one instance can be translated to a code for the other instance with the same decoding-error performance. The equivalence also showed a surprising result that any network-coding instance can be mapped to an index-coding instance with a properly designed code translation. In this article, we extend the existing equivalence (instance map and code translation) to one between secure index coding and secure network coding, where eavesdroppers are present in the network. In the secure setting, any code construction needs to guarantee security constraints in addition to decoding-error performance. A rate equivalence between these two problems is also established.
暂无评论