Skip to Main content Skip to Navigation

LT Network Codes

Abstract : Network coding has been successfully applied in large-scale content dissemination systems. While network codes provide optimal throughput, its current forms suer from a high decoding complexity. This is an issue when applied to systems composed of nodes with low processing capabilities, such as sensor networks. In this paper, we propose a novel network coding approach based on LT codes, initially introduced in the context of erasure coding. Our coding scheme, called LTNC, fully benets from the low complexity of belief propagation decoding. Yet, such decoding schemes are extremely sensitive to statistical properties of the code. Maintaining such properties in a fully decentralized way with only a subset of encoded data is challenging. This is precisely what the recoding algorithms of LTNC achieve. We evaluate LTNC against random linear network codes in an epidemic content-dissemination application. Results show that LTNC increases communication overhead (20%) and convergence time (30%) but greatly reduces the decoding complexity (99%) when compared to random linear network codes. In addition, LTNC consistently outperforms dissemination protocols without codes, thus preserving the benet of coding.
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Nicolas Le Scouarnec Connect in order to contact the contributor
Submitted on : Thursday, November 26, 2009 - 11:24:01 AM
Last modification on : Wednesday, February 2, 2022 - 3:50:45 PM
Long-term archiving on: : Thursday, September 23, 2010 - 11:02:08 AM


Files produced by the author(s)


  • HAL Id : inria-00416671, version 2


Mary-Luc Champel, Kévin Huguenin, Anne-Marie Kermarrec, Nicolas Le Scouarnec. LT Network Codes. [Research Report] RR-7035, INRIA. 2009, pp.18. ⟨inria-00416671v2⟩



Record views


Files downloads