Distributed LT Codes on Multi-hop Networks

DOI

10.2991/iccia-17.2017.88How to use a DOI?

Keywords

distributed LT codes, binary erasure channels, multi-hop networks, And-Or Tree, asymptotic performance, linear optimization.

Abstract

Distributed LT codes on binary erasure channels (BECs) have been widely investigated, but the number of sources was usually limited within ten. In the practical cases we often need to transmit information blocks from scores of sources to a common destination through one or more relays, which encourages us to reclaim the scenarios in which up to one hundred sources transmit information blocks to the destination. Obviously, in these scenarios, sources need to be re-organized to improve the system performance. Our propositions are Multi Distributed LT codes (MDLT) and Backtracking Distributed LT codes (BDLT). We investigate the performances of these codes by density evolution, and present the simulating results, compared with those Conventional Distributed codes (CDLT).

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yan Zhang
AU  - Jianhua Chen
AU  - Meng Tang
AU  - Xin Jin
PY  - 2016/07
DA  - 2016/07
TI  - Distributed LT Codes on Multi-hop Networks
BT  - Proceedings of the 2nd International Conference on Computer Engineering, Information Science & Application Technology (ICCIA 2017)
PB  - Atlantis Press
SP  - 518
EP  - 525
SN  - 2352-538X
UR  - https://doi.org/10.2991/iccia-17.2017.88
DO  - 10.2991/iccia-17.2017.88
ID  - Zhang2016/07
ER  -