Raptor codes based distributed storage algorithms for wireless sensor networks

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 + isin)k of nodes for some small isin Gt 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.

[1]  Vinod M. Prabhakaran,et al.  Ubiquitous access to distributed data in large-scale sensor networks through decentralized erasure codes , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[2]  Chen Avin,et al.  On the Cover Time of Random Geometric Graphs , 2005, ICALP.

[3]  Baochun Li,et al.  Differentiated Data Persistence with Priority Random Linear Codes , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[4]  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.

[5]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

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

[7]  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).

[8]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.