Performance evaluation of random linear network coding using a Vandermonde matrix

Mane, Pallavi R; Adiga, Sudhakara G.; Kumar, M. Sathish

doi:10.1016/j.phycom.2013.11.008

Cited by 5 publications

(4 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…, K } are chosen to be different. This guarantees that rank of G t is K , and can also be shown that no performance loss will occur when compared to a randomly chosen G t [36] (this procedure can only be used in the s t x node). Note that since an entire row of a Vandermonde matrix can be constructed using a single non-zero field element, this effectively compresses the coefficient header to just one coefficient as compared to K coefficients.…”

Section: A Cllc: Cooperative Link Layer Controlmentioning

confidence: 93%

Network Coding in the Link Layer for Reliable Narrowband Powerline Communications

Bilbao

Crespo

Armendariz

et al. 2016

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

The wide availability of power distribution cables provides an interesting no-new-wires communication channel. However, its electrical characteristics make it a harsh environment for the data transmission purpose and prevent the deployment of services with high reliability requirements. This paper proposes and implements an OSI-Layer2 network codingbased cooperative scheme with the aim of improving communication reliability in indoor narrowband powerline channels. The proposed scheme uses random linear network coding with a sliding window and relaying. We use network coding to replace the retransmissions triggered by legacy subsequent repeat request (ARQ) schemes. We evaluate the performance of our approach in terms of throughput and delay. Regarding the throughput achieved in harsh environments, we show that our scheme often more than doubles the throughput of existing legacy ARQ schemes. At the same time, and even under the large variation of traffic characteristics, it is shown that the delay is likely to be upper bounded by a few seconds, a bound that cannot be guaranteed in other existing transmission techniques.

show abstract

Section: A Cllc: Cooperative Link Layer Controlmentioning

confidence: 93%

Network Coding in the Link Layer for Reliable Narrowband Powerline Communications

Bilbao

Crespo

Armendariz

et al. 2016

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

show abstract

“…Since the above Lemma can be satisfied easily by the VNs containing a high number of relays, we now focus on how to select the optimal VNs containing the full original packet recovery capability with the lowest decoding complexity. The decoding of the recoded packets p ReF C RVij is given in (2) and in order to minimize the calculation complexity of the decoding, the dimension of the product of decoding and recoding matrices should be minimized, as described below…”

Section: The Proposed Opportunistic Fountain Codingmentioning

confidence: 99%

Opportunistic Fountain Coding With Coordinative Routing

Peng

Lambotharan

Zheng

et al. 2022

IEEE Wireless Commun. Lett.

View full text Add to dashboard Cite

Fountain codes are widely employed to improve reliability and efficiency in wireless communication systems due to their simple coding mechanisms. In this letter, we propose an opportunistic decoding and recoding mechanism with coordinative routing algorithm for fountain codes to improve the expected transmission counts (ETX) performance and to reduce computational complexity of fountain decoding at each relay in multi-hop wireless sensor networks. The full recovery in existing cooperative fountain coded networks is replaced by a new partial decoding and recoding mechanism in which both the recovered and the unrecovered packets at the intermediate nodes are considered as recoding candidates. Numerical results show that the proposed algorithm is superior to the existing opportunistic routing-based fountain code schemes.

show abstract

“…It can be argued that for networks with larger number of nodes, or with a significant packet error rate (PER), a more effective solution would be to use linear network coding (LNC) techniques, which are able to encode multiple messages into single messages . In the literature, there are some works dealing with the reduction of encoding/decoding complexity . Nevertheless, the remaining question is whether commercially available WSN nodes are able (or not) to handle complex LNC encoding/decoding operations, using larger field sizes.…”

Section: Introductionmentioning

confidence: 99%

Experimental assessment of LNC‐based cooperative communication schemes using commercial off‐the‐shelf wireless sensor network nodes

Valle

Budke

Montez

et al. 2018

Int J Communication

View full text Add to dashboard Cite

Summary The use of wireless sensor network nodes to support reliable communication exposes some challenging issues. For instance, the reduced available bandwidth combined with an error‐prone communication medium impairs the provision of reliable communication services. Network coding techniques can be useful to mitigate some of these issues, where multiple message groups can be combined into single messages and retransmitted to their destinations, improving the network reliability and reducing the bandwidth consumption. However, an effective use of network coding requires the availability of wireless sensor network nodes able to encode/decode messages within the required timing constraints. This paper reports an experimental assessment of commercial off‐the‐shelf wireless sensor network nodes, running a set of network coding encoding/decoding tasks. The assessed nodes range from the high‐performance ARM Cortex‐M7 to the low capability Arduino Uno platforms, including some of the most popular ARM Cortex and ATMEL AVR processors. The performed experimental assessment demonstrates that highly complex network coding techniques (with fields as large as F28) can be efficiently implemented on a wide range of wireless sensor network nodes, including ARM Cortex, ATMEL AVR, and Arduino Uno platforms, smoothing some relevant reliable communication implementation issues.

show abstract

Performance evaluation of random linear network coding using a Vandermonde matrix

Cited by 5 publications

References 20 publications

Network Coding in the Link Layer for Reliable Narrowband Powerline Communications

Network Coding in the Link Layer for Reliable Narrowband Powerline Communications

Opportunistic Fountain Coding With Coordinative Routing

Experimental assessment of LNC‐based cooperative communication schemes using commercial off‐the‐shelf wireless sensor network nodes

Contact Info

Product

Resources

About