Raptor Codes Based Distributed Storage Algorithms for Wireless Sensor Networks

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

published in IEEE ISIT 2008

Scientific paper

We consider a distributed storage problem in a large-scale wireless sensor network with $n$ nodes among which $k$ acquire (sense) independent data. The goal is to disseminate the acquired information throughout the network so that each of the $n$ sensors stores one possibly coded packet and the original $k$ data packets can be recovered later in a computationally simple way from any $(1+\epsilon)k$ of nodes for some small $\epsilon>0$. We propose two Raptor codes based distributed storage algorithms for solving this problem. In the first algorithm, all the sensors have the knowledge of $n$ and $k$. In the second one, we assume that no sensor has such global information.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Raptor Codes Based Distributed Storage Algorithms for Wireless Sensor Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Raptor Codes Based Distributed Storage Algorithms for Wireless Sensor Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Raptor Codes Based Distributed Storage Algorithms for Wireless Sensor Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-652681

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.