Abstract
Joint FoUntain coding and Network coding (FUN) is proposed to boost information spreading over multi-hop lossy networks. The novelty of our FUN approach lies in combining the best features of fountain coding, intra-session network coding, and cross-next-hop network coding. This paper provides an in-depth study of FUN codes. First, we theoretically analyze the throughput of FUN codes. Second, we identify several practical issues that may undermine the actual performance, such as buffer overflow, and quantify the resulting throughput degradation. Finally, we propose a systematic design to overcome these issues. Simulation results in TDMA multi-hop networks show that our methods yield near-optimal throughput and are significantly better than fountain codes and existing network coding schemes.
| Original language | English |
|---|---|
| Article number | 7387794 |
| Pages (from-to) | 3340-3353 |
| Journal | IEEE/ACM Transactions on Networking |
| Volume | 24 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - 1 Dec 2016 |
| Externally published | Yes |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Research Keywords
- Erasure channel
- fountain codes
- information spreading
- multi-hop networks
- network coding