2016
DOI: 10.1109/lcomm.2016.2594768
|View full text |Cite
|
Sign up to set email alerts
|

Improved Bounds on the Decoding Failure Probability of Network Coding Over Multi-Source Multi-Relay Networks

Abstract: This letter considers a multi-source multi-relay network, in which relay nodes employ a coding scheme based on random linear network coding on source packets and generate coded packets. If a destination node collects enough coded packets, it can recover the packets of all source nodes. The links between source-to-relay nodes and relay-to-destination nodes are modeled as packet erasure channels. Improved bounds on the probability of decoding failure are presented, which are markedly close to simulation results … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
31
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 19 publications
(31 citation statements)
references
References 10 publications
0
31
0
Order By: Relevance
“…Several efforts to analyse the performance RLNC applied to relay networks are present in the literature. Multiple-source, multiple-relay two-hop networks were studied in [11]- [13]. In [11], each source node was designed to transmit a single uncoded packet, while each relay node encoded packets it received into a single linear combination and forwarded it to the destination node.…”
Section: Introductionmentioning
confidence: 99%
See 4 more Smart Citations
“…Several efforts to analyse the performance RLNC applied to relay networks are present in the literature. Multiple-source, multiple-relay two-hop networks were studied in [11]- [13]. In [11], each source node was designed to transmit a single uncoded packet, while each relay node encoded packets it received into a single linear combination and forwarded it to the destination node.…”
Section: Introductionmentioning
confidence: 99%
“…More general scenarios involving sparse RLNC [14] were considered in [12], for which lower and upper bounds were proposed. More accurate bounds were subsequently derived in [13]. In both [12], [13] the degree of sparsity was determined by packet loss, which led to poor code performance in certain scenarios.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations