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

Authors:
Dejan Vukobratovic;Čedomir Stefanovic;Miloš Stojakovic;Vladimir Stankovic
Affiliations:
Department of Power, Electronics and Communication Engineering, University of Novi Sad, Novi Sad, Serbia;Department of Power, Electronics and Communication Engineering, University of Novi Sad, Novi Sad, Serbia;Department of Mathematics and Informatics, University of Novi Sad, Novi Sad, Serbia;Department of Electronic and Electrical Engineering, University of Strathclyde, Glasgow, UK
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 6
Cited 1

LT Codes

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Fastest Mixing Markov Chain on a Graph

SIAM Review
Raptor codes

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Growth codes: maximizing sensor network data persistence

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Uniform Data Sampling from a Peer-to-Peer Network

ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks

IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks

Packet-centric approach to distributed sparse-graph coding in wireless ad hoc networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.