Results 21 to 30 of about 55,694 (255)

Index Coded Automatic Repeat Request (ARQ)

open access: yesEntropy, 2020
In this paper, an index-coded Automatic Repeat Request (ARQ) is studied in the perspectives of transmission efficiency and memory overhead. Motivated by reducing significant computational complexity from huge matrix inverse computation of random linear ...
Sang Won Choi
doaj   +1 more source

Random Linear Network Coding on Programmable Switches [PDF]

open access: yes2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), 2019
By extending the traditional store-and-forward mechanism, network coding has the capability to improve a network's throughput, robustness, and security. Given the fundamentally different packet processing required by this new paradigm and the inflexibility of hardware, existing solutions are based on software. As a result, they have limited performance
Gonçalves, Diogo   +3 more
openaire   +4 more sources

A fast network coding scheme for mobile wireless sensor networks

open access: yesInternational Journal of Distributed Sensor Networks, 2017
In mobile wireless sensor networks, linear network coding has been shown to improve the performance of network throughput and reduce delay. However, the linear dependence of coded packets caused by linear network coding will result in significant ...
Chen Han, Yuwang Yang, Xu Han
doaj   +1 more source

Efficient Data Dissemination Strategy for VANETs Based on Network Coding [PDF]

open access: yesJisuanji gongcheng, 2016
In Vehicular Ad-hoc Networks(VANETs),due to the unstable network environment,the Road Side Unit(RSU) can not transmit data quickly,efficiently,and reliably to vehicles.This paper proposes a RSU multicast retransmission algorithm based on network coding ...
WANG Shujuan,YIN Jiao
doaj   +1 more source

Enhanced algebraic error control for random linear network coding [PDF]

open access: yesMILCOM 2012 - 2012 IEEE Military Communications Conference, 2012
Error control is significant to network coding, since when unchecked, errors greatly deteriorate the throughput gains of network coding and seriously undermine both reliability and security of data. Two families of codes, subspace and rank metric codes, have been used to provide error control for random linear network coding.
Yan, Zhiyuan, Xie, Hongmei
openaire   +2 more sources

Linear-Complexity Overhead-Optimized Random Linear Network Codes

open access: yes, 2013
Sparse random linear network coding (SRLNC) is an attractive technique proposed in the literature to reduce the decoding complexity of random linear network coding. Recognizing the fact that the existing SRLNC schemes are not efficient in terms of the required reception overhead, we consider the problem of designing overhead-optimized SRLNC schemes. To
Mahdaviani, Kaveh   +2 more
openaire   +2 more sources

Sparse Random Linear Network Coding For Low Latency Allcast [PDF]

open access: yes2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2019
Numerous applications require the sharing of data from each node on a network with every other node. In the case of Connected and Autonomous Vehicles (CAVs), it will be necessary for vehicles to update each other with their positions, manoeuvring intentions, and other telemetry data, despite shadowing caused by other vehicles.
Graham, Mark A   +2 more
openaire   +2 more sources

Lightweight Random Linear Coding over Wireless Mesh Networks

open access: yes, 2015
We propose an enhanced version of an intra-flow Network Coding protocol, which was conceived to offer a reliable communication service, by means of the combination a Random Linear Coding (RLC) scheme with the UDP protocol. We reduce the overhead that was originally required in the protocol header and we assess, through an extensive campaign carried out
Garrido Torres, Pablo   +4 more
openaire   +2 more sources

Decoding Algorithms for Random Linear Network Codes [PDF]

open access: yes, 2011
We consider the problem of efficient decoding of a random linear code over a finite field. In particular we are interested in the case where the code is random, relatively sparse, and use the binary finite field as an example. The goal is to decode the data using fewer operations to potentially achieve a high coding throughput, and reduce energy ...
Heide, Janus   +2 more
openaire   +3 more sources

On GRAND-Assisted Vector Random Linear Network Coding in Wireless Broadcasts

open access: yesEntropy
Recent works have combined random linear network coding (RLNC) with guessing random additive noise decoding (GRAND) to leverage RLNC packets to partially correct bit errors prior to RLNC decoding, so as to reduce the packet erasure rates in wireless ...
Rina Su   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy