Reliability of Relay Networks Under Random Linear Network Coding

We consider a single-source, multiple-relay, and single-destination lossy network employing random linear network coding at all transmitting nodes. We address the problem of calculating the probability of successful decoding at the destination node. In contrast to some previous studies, we assume th...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 67; no. 8; pp. 5230 - 5240
Main Authors: Tsimbalo, Evgeny, Sandell, Magnus
Format: Journal Article
Language:English
Published: New York IEEE 01.08.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Coding
Computer simulation
Decoding
Encoding
Manufacturing cells
Network reliability
Nodes
Radio frequency
Relay networks
Relay networks (telecommunications)
Relaying
Reliability
RLNC
Throughput
Upper bounds
ISSN:0090-6778, 1558-0857
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider a single-source, multiple-relay, and single-destination lossy network employing random linear network coding at all transmitting nodes. We address the problem of calculating the probability of successful decoding at the destination node. In contrast to some previous studies, we assume the classical random linear network coding scheme, in which the relaying nodes simply recode packets, without resorting to decoding. In addition, we consider an arbitrary field size and take into account the correlation between the relay nodes. We propose a novel upper bound for an arbitrary number of relays, which becomes exact for a single relay. Using Monte Carlo simulations, we show that the proposed bound is very accurate, exhibiting the mean square error as low as <inline-formula> <tex-math notation="LaTeX">10^{-6} </tex-math></inline-formula>. We also demonstrate the throughput gain of the proposed scheme over alternative coding and relaying strategies.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2019.2911578