2017
DOI: 10.1109/twc.2017.2701822
|View full text |Cite
|
Sign up to set email alerts
|

Controlled Flooding of Fountain Codes

Abstract: We consider a multihop network where a source node must reliably deliver a set of data packets to a given destination node. To do so, the source applies a fountain code and floods the encoded packets through the network, until they reach their destination or are lost in the process. We model the probability that the destination can recover the original transmissions from the received coded packets as a function of the network topology and of the code redundancy, and show that our analytical results predict the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
references
References 29 publications
0
0
0
Order By: Relevance