Combinatorial networks are widely applied in many practical scenarios. In this paper, we compute the closed-form probability expressions of successful decoding at a sink and at all sinks in the multicast scenario, in ...
详细信息
Combinatorial networks are widely applied in many practical scenarios. In this paper, we compute the closed-form probability expressions of successful decoding at a sink and at all sinks in the multicast scenario, in which one source sends messages to k destinations through m relays using random linear network coding over a Galois field. The formulation at a （all） sink（s） represents the impact of major parameters, i.e., the size of field, the number of relays （and sinks） and provides theoretical groundings to numerical results in the literature. Such condition maps to the receivers＇ capability to decode the original information and its mathematical characterization is helpful to design the coding. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized.
Error control techniques are designed to ensure reliable data transfer over unreliable communication channels that are frequently subjected to channel errors. In this paper, the effect of applying a convolution code t...
详细信息
ISBN:
(纸本)9780769549521;9781467362399
Error control techniques are designed to ensure reliable data transfer over unreliable communication channels that are frequently subjected to channel errors. In this paper, the effect of applying a convolution code to the Scattered randomnetworkcoding (SRNC) scheme over a multi-hop wireless channel was studied. An interleaver was implemented for bit scattering in the SRNC with the purpose of dividing the encoded data into protected blocks and vulnerable blocks to achieve error diversity in one modulation symbol while randomising errored bits in both blocks. By combining the interleaver with the convolution encoder, the network decoder in the receiver would have enough number of correctly received network coded blocks to perform the decoding process efficiently. Extensive simulations were carried out to study the performance of three systems: 1) SRNC with convolutional encoding;2) SRNC;and 3) A system without convolutional encoding nor interleaving. Simulation results in terms of block error rate for a 2-hop wireless transmission scenario over an Additive White Gaussian Noise (AWGN) channel were presented. Results showed that the system with interleaving and convolutional code achieved better performance with coding gain of at least 1.29 dB and 2.08 dB on average when the block error rate is 0.01 when compared with system II and system III respectively.
random linear network coding (RLNC) is widely used in practical networkcoding (NC) protocol design. Recent results show that RLNC also plays an important role in capacity-achieving intersession NC schemes for erasure...
详细信息
ISBN:
(纸本)9781457705953
random linear network coding (RLNC) is widely used in practical networkcoding (NC) protocol design. Recent results show that RLNC also plays an important role in capacity-achieving intersession NC schemes for erasure-based 1-hop relay networks. This work quantifies the common information of RLNC over a 1-hop broadcast packet erasure channel. Several potential applications are discussed, including source coding, intersession NC, and broadcasting with common and private information.
This paper considers throughput of an unreliable single-hop broadcast channel by employing random linear network coding technology at the source node. Closed form expressions of the total broadcast throughput for each...
详细信息
ISBN:
(纸本)9781728121840
This paper considers throughput of an unreliable single-hop broadcast channel by employing random linear network coding technology at the source node. Closed form expressions of the total broadcast throughput for each transmission time slot are derived for system random linear network coding and non-systematic random linear network coding, respectively. Furthermore, the expressions of the total broadcast throughput are also presented in a recursive manner. These expressions is related to the link erasure probability, the number of subscribers in the broadcast link, the number of packets per generation, and the field size. We then investigate the impact of the link erasure probability, the number of receivers, the generation size, and the field size on the throughput performance gains of system random linear network coding and non-systematic random linear network coding over the round robin transmission scheme.
Nowadays, different end devices with different computation and bandwidth capabilities acquire data from Internet. To improve efficiency of data storage and retrieve, in this paper, we study how to use randomlinear ne...
详细信息
ISBN:
(纸本)9783030050634;9783030050627
Nowadays, different end devices with different computation and bandwidth capabilities acquire data from Internet. To improve efficiency of data storage and retrieve, in this paper, we study how to use random linear network coding to construct an efficient distributed storage system to reduce the traffic cost in a dynamic network. In order to balance the success ratio of recovery traffic cost and traffic speed, we firstly introduce a randomnetworkcoding scheme and implement a practically available distributed storage system in the actual environment. We then adjust different parameters, e.g., finite fields, link bandwidth, node computing capabilities, etc., to evaluate the proposed system. Finally, experiment results show the efficiency of the proposed designs.
In wireless broadcast, random linear network coding (RLNC) over GF(2(L)) is known to asymptotically achieve the optimal completion delay with increasing L. However, the high decoding complexity hinders the potential a...
详细信息
ISBN:
(纸本)9781728150895
In wireless broadcast, random linear network coding (RLNC) over GF(2(L)) is known to asymptotically achieve the optimal completion delay with increasing L. However, the high decoding complexity hinders the potential applicability of RLNC schemes over large GF(2(L)). In this paper, a comprehensive analysis of completion delay and decoding complexity is conducted for field-based systematic RLNC schemes in wireless broadcast. In particular, we prove that the RLNC scheme over GF(2) can also asymptotically approach the optimal completion delay per packet when the packet number goes to infinity. Moreover, we introduce a new method, based on circular-shift operations, to design RLNC schemes which avoid multiplications over large GF(2(L)). The new RLNC schemes turn out to have a much better trade-off between completion delay and decoding complexity. In particular, numerical results demonstrate that the proposed schemes can attain average completion delay just within 5% higher than the optimal one, while the decoding complexity is only about 3 times the one of the RLNC scheme over GF(2).
the objective of this paper is to test two sceneries of multicast transmissions through the WiMAX network and identify the optimal transmission method. The first method is a simulation of the WiMAX networks in a netwo...
详细信息
ISBN:
(纸本)9781509064656
the objective of this paper is to test two sceneries of multicast transmissions through the WiMAX network and identify the optimal transmission method. The first method is a simulation of the WiMAX networks in a network simulator (network Simulator 3 - NS3) using the standard NS3 libraries. The second simulation implemented in NS3 as well, contains the code altered in a way that will allow implementing the RLNC (random linear network coding) method.
Managing and maintaining network connectivity in a mobile ad-hoc network (MANET) is known to consume bandwidth and energy at the mobile nodes. Traditional mechanisms require that stations periodically monitor the wire...
详细信息
ISBN:
(纸本)9781467349192
Managing and maintaining network connectivity in a mobile ad-hoc network (MANET) is known to consume bandwidth and energy at the mobile nodes. Traditional mechanisms require that stations periodically monitor the wireless channel, in order to determine available paths to route incoming packets. Aiming to alleviate the problem of energy consumption and high control overhead, this paper adopts a new approach to passive neighbourhood detection, based on networkcoding. Specifically, ad-hoc stations examine the coding vectors and subspaces of incoming network-coded packets to extract information about the subspaces spanned by these vectors, enabling them to passively discover new neighbours. The new discovery mechanism is incorporated into the well-known dynamic MANET on-demand (DYMO) ad-hoc routing protocol and the features of the combined scheme are discussed, towards assessing the potential advantages of the proposed approach, particularly with respect to energy efficiency.
In wireless broadcasting retransmission, any node of multi-nodes requests the retransmission of information packets. This approach always needs large amounts of broadcasting packets. This paper presents a novel retran...
详细信息
ISBN:
(纸本)9781424441983
In wireless broadcasting retransmission, any node of multi-nodes requests the retransmission of information packets. This approach always needs large amounts of broadcasting packets. This paper presents a novel retransmission approach (RLNCBR) in wireless broadcasting networks based on random linear network coding. Firstly, source node will send linearcoding packets based on the largest amounts of lost packets in received nodes. Then, received nodes will decode lost packets with networkcoding theory. Mathematic analysis reveals that our approach can ensure the solvability in the received nodes, and have optimal performance in wireless retransmission. Simulation results indicate that compared with existing approach, the approach in this paper can effectively reduce the average number of transmissions and advance the transmission efficiency.
In this paper, first we discuss some basic knowledge about the randomnetworkcoding, then we introduce the random linear network coding with some simple models. Secondly, we will consider the coding over packets that...
详细信息
ISBN:
(纸本)9781457715846
In this paper, first we discuss some basic knowledge about the randomnetworkcoding, then we introduce the random linear network coding with some simple models. Secondly, we will consider the coding over packets that randomly arrive to a source node for transmission to a single destination. Then, for broadcasting retransmission, any node of multi-nodes requests the retransmission of information packets. This approach always needs large amounts of broadcasting packets. And, at last, we present a queuing model for a randomlinearcoding scheme that adapts to the amount of traffic at the source node.
暂无评论