Vehicle Platooning combines lower fuel consumption with safe and efficient transportation in a cooperative driving application. To ensure this, vehicles must communicate quickly and reliably. The sliding window protoc...
详细信息
ISBN:
(纸本)9781728175867
Vehicle Platooning combines lower fuel consumption with safe and efficient transportation in a cooperative driving application. To ensure this, vehicles must communicate quickly and reliably. The sliding window protocol Caterpillar random linear network coding (CRLNC) is used as it does not rely on acknowledgements and uses networkcoding to reduce losses. However, the protocol was intentionally designed for single hop scenarios. Therefore, three contributions to the CRLNC protocol are presented in this paper to optimize it for multi hop/single path transmissions. The contributions are idle-slot-management, adaptive-window, and queue-management. By effectively combining these contributions, a large gain in throughput of up to 40% is achieved. Furthermore, it was investigated what are the optimal protocol parameters for CRLNC in single path scenarios are. It is shown that the best transmission in terms of throughput and delay is achieved, when the code rate is less than one minus the error probability and a large window size is used. Even if the error probability is unknown, a large window size will bring more benefits to the transmission.
In wireless multi-hop and multi-path computer networks, such as the ones that potentially emerge with Internet of Things (IoT) deployments, channel coding has become a tried and tested solution to handle packet losses...
详细信息
ISBN:
(纸本)9781728189642
In wireless multi-hop and multi-path computer networks, such as the ones that potentially emerge with Internet of Things (IoT) deployments, channel coding has become a tried and tested solution to handle packet losses. random linear network coding (RLNC) is one of such block coding techniques, which also provides the unique feature of recoding already coded symbols on intermediate nodes, thereby increasing the general throughput of the network. However, the computation overhead of decoding on the receiver device counteracts the much desired low-latency requirements of various fifth generation (5G) use cases. Sliding-window RLNC is a technique, which can minimize such overheads. Nonetheless, recoding over a sliding window destroys the low-latency decodable properties of the scheme. In this paper we present a low-latency recoding technique that balances packet forwarding and recoding on the intermediate nodes in way that potentially preserves the sliding window characteristics. Our simulation results show that the performance of the proposed recoding algorithm achieves a two factor improvement in latency and losses, as well as a more than three times gain in throughput.
Using random linear network coding (RLNC) in asynchronous networks with one-to-many information flow has already been proven to be a valid approach to maximize the channel capacities. Message-based consensus protocols...
详细信息
ISBN:
(纸本)9781665424349
Using random linear network coding (RLNC) in asynchronous networks with one-to-many information flow has already been proven to be a valid approach to maximize the channel capacities. Message-based consensus protocols such as Practical Byzantine Fault Tolerance (pBFT) adhere partially to said scenario. Protocol phases with many-to-many communication, however, still suffer from quadratic growth in the number of required transmissions to reach consensus. We present several experiments, showing that a significant improvement in the transmission efficiency in the quadratic phases is possible under very reasonable settings through combining RLNC with pBFT into a single hybrid protocol running on a selected layer of the network. Applying the same approach to other combinations of message-based consensus and networkcoding protocols promises not only a gain in performance, but may also improve robustness and security and open up new application scenarios for RLNC.
Not all data units carried over a packet stream are equal in value. Often some portions of data are more significant than others. Qualitative Communication is a paradigm that leverages the 'quality of data' at...
详细信息
ISBN:
(纸本)9781665406680
Not all data units carried over a packet stream are equal in value. Often some portions of data are more significant than others. Qualitative Communication is a paradigm that leverages the 'quality of data' attribute to improve both the end-user experience and the overall performance of the network specifically when adverse network conditions occur. Qualitative Communication allows that the content that is received differs from the one that is transmitted but maintains enough of its information to still be useful. This paper describes Qualitative Communication, its packetization methods, and the corresponding mechanisms to process the packets at a finer granularity with New IP. The paper also discusses its benefits to the emerging and future network applications through a couple of use cases in video streaming, multi-camera assisted remote driving, AR/VR and holographic streaming, and high precision networking. Some preliminary performance results are illustrated to show such benefits. This suggests that Qualitative Communication will find wide applications for many use cases.
Data dissemination to multiple users within a predetermined deadline is a commonly required function in many emerging wireless scenarios. In this paper, we propose a data dissemination scheme enhanced by device-to-dev...
详细信息
Data dissemination to multiple users within a predetermined deadline is a commonly required function in many emerging wireless scenarios. In this paper, we propose a data dissemination scheme enhanced by device-to-device (D2D) communications and random linear network coding (RLNC), where the broadcast and the D2D links are used simultaneously with on-the-fly RLNC to accelerate the dissemination. The probability distribution of the completion time of using either pure or systematic RLNC is analyzed assuming a finite field size, under a general model where the cooperation may occur probabilistically and multiple packets may be exchanged between the D2D users in each time slot. An optimization problem is formulated to design the cooperation parameters to minimize the expected energy consumption of the system. Numerical and simulation results show that the analysis is accurate, and that to minimize the energy consumption a tradeoff exists between allowing for longer broadcast and for more intensive cooperation. The cooperation parameters designed for multiple D2D pairs are shown to be effective for meeting the reliability requirements.
One of the by-products of Sparse networkcoding (SNC) is the ability to perform partial decoding, i.e., decoding some original packets prior to collecting all needed coded packets to decode the entire coded data. Due ...
详细信息
One of the by-products of Sparse networkcoding (SNC) is the ability to perform partial decoding, i.e., decoding some original packets prior to collecting all needed coded packets to decode the entire coded data. Due to this ability, SNC has been recently used as a technique for reducing the Average Decoding Delay (ADD) per packet in real-time multimedia applications. This study focuses on characterizing the ADD per packet for SNC considering the impact of finite field size. We present a Markov Chain model that allows us to determine lower bounds on the mean number of transmissions required to decode a fraction of a generation and the ADD per packet of the generation. We validate our model using simulations and show that the smaller finite fields, e.g., q = 24, outperform large finite fields, e.g., q = 232, in regard to the ADD per packet and provide a better tradeoff between the ADD per packet and the overall number of transmissions to decode a generation.
Subspace coding is a solution to the error-control problem in noncoherent networks using random linear network coding (RLNC) as a transmission mechanism. In this paper, we propose a secure error-correction scheme base...
详细信息
Subspace coding is a solution to the error-control problem in noncoherent networks using random linear network coding (RLNC) as a transmission mechanism. In this paper, we propose a secure error-correction scheme based on a codeword selection method called the Subspace coding Strategy (SCS) along with a permutation step, as a possible solution for secure transmission of data encoded using subspace codes. Our scheme also makes use of the correction capability of the used code to induce correctable random errors to further mislead the wiretapper. Numerical results and comparative analysis with other schemes from the literature are presented as a verification of the impact of the proposed scheme on transmission security. (C) 2021 Elsevier B.V. All rights reserved.
In this paper, an efficient and practical solution to cope with random linear network coding (RLNC) drawbacks and maximize the system throughput is proposed. No header overheads and no retransmissions are required as ...
详细信息
In this paper, an efficient and practical solution to cope with random linear network coding (RLNC) drawbacks and maximize the system throughput is proposed. No header overheads and no retransmissions are required as a result of the introduction of a unique codebook at the nodes in charge of RLNC coding and decoding. The codebook contains the seeds that allow for the pseudo-random generation of fullrank matrices of networkcoding elements over the finite Galois field GF(q), where q is the field size, for N generations. Each relay generates the same matrix and uses its corresponding row of N coding GF(q) coefficients. The destination, whose seeds codebook is synchronized on the same index value, generates the same full-rank matrix to decode the source nodes packets. Results show that the number of successfully transmitted packets is not generally affected by the choice of the generation size or the underlying finite field, which demonstrates the outperformance of the proposed technique over the traditional RLNC procedure. (C) 2021 Elsevier Inc. All rights reserved.
random linear network coding gained its importance in recent days with its greater potential to enhance the performance of the IoT systems. But the challenging issue is the matrix multiplications and inversions involv...
详细信息
ISBN:
(纸本)9789811501357;9789811501340
random linear network coding gained its importance in recent days with its greater potential to enhance the performance of the IoT systems. But the challenging issue is the matrix multiplications and inversions involved in it. Nowadays, with increase in multimedia streaming formats, IoT devices like smartphones will try to make full use of heterogeneous multicore architectures, which are drawing everyone's attention. The approach presented in this paper is the improvement of matrix operations through optimized operations on matrix blocks. We can schedule the operations on matrix blocks in the heterogeneous cores through directed acyclic graph (DAG). The utilization of computer technology to complete the task is known as computing. It is the process of using computer to complete a given goal-oriented task. Here, we make use of different types of computing in order to solve the problem of high computation of matrix operations. RLNC encoding and decoding achieved higher throughputs than already available approaches.
We derive the probability distribution of the link outage duration at a typical receiver in a wireless network with Poisson distributed interferers sending messages with slotted random access over a Rayleigh fading ch...
详细信息
ISBN:
(纸本)9781728150895
We derive the probability distribution of the link outage duration at a typical receiver in a wireless network with Poisson distributed interferers sending messages with slotted random access over a Rayleigh fading channel. This result is used to analyze the performance of random linear network coding, showing that there is an optimum code rate and that interference correlation affects the decoding probability and throughput.
暂无评论