Raptor packets: A packet-centric approach to distributed raptor code design

In this paper, we address the problem of distributed Raptor code design over information packets located across the network nodes. We propose a novel approach to this problem that consists of generating, encoding and dispersing Raptor packets across the network. Unlike recent node-centric proposals, where network nodes are responsible for collecting information packets and performing Raptor encoding, in the proposed packet-centric approach this task is assigned to Raptor packets. In a two-step encoding procedure that corresponds to precoding and LT-coding step of standard Raptor encoding, Raptor packets randomly traverse the network, collect and encode sufficient number of information packets following exactly a given degree distribution, and finish their paths in a random network node. The efficiency of the distributed Raptor coding scheme is confirmed by simulation results, where their performance is demonstrated to approach closely the performance of standard (centralized) Raptor codes.

[1]  Hillol Kargupta,et al.  Uniform Data Sampling from a Peer-to-Peer Network , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[2]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[3]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[4]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[5]  Jon Feldman,et al.  Growth codes: maximizing sensor network data persistence , 2006, SIGCOMM 2006.

[6]  Aamod Khandekar,et al.  Irregular repeat accumulate codes for non-binary modulation schemes , 2002, Proceedings IEEE International Symposium on Information Theory,.

[7]  László Lovász,et al.  Random Walks on Graphs: A Survey , 1993 .

[8]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[9]  Emina Soljanin,et al.  Raptor codes based distributed storage algorithms for wireless sensor networks , 2008, 2008 IEEE International Symposium on Information Theory.

[10]  Emina Soljanin,et al.  Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks , 2008, 2008 International Conference on Information Processing in Sensor Networks (ipsn 2008).

[11]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[12]  Stephen P. Boyd,et al.  Fastest Mixing Markov Chain on a Graph , 2004, SIAM Rev..

[13]  Baochun Li,et al.  Data Persistence in Large-Scale Sensor Networks with Decentralized Fountain Codes , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[14]  Wei Zhong,et al.  Approaching Shannon performance by iterative decoding of linear codes with low-density generator matrix , 2003, IEEE Communications Letters.

[15]  Vinod M. Prabhakaran,et al.  Distributed Fountain Codes for Networked Storage , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.