Energy efficient data survivability for WSNs via Decentralized Erasure Codes

Designing reliability solutions for WSNs poses intricate challenges due to limitations in processing power and available energy. Such networks are often deployed in harsh and inaccessible environments and are therefore required to be highly reliable. However, reliability normally translates to redundancy in hardware and other resources implying both complexity and higher costs. In this study, we consider data survivability in WSNs. We present a data-centric framework based on Decentralized Erasure Codes (DEC) to increase the likelihood of data survivability in case of sensor nodes failure. The proposed framework enables network engineers to estimate the redundancy in hardware and data to achieve a given data survivability level. We also show two approaches to reduce the energy requirements of the proposed coding scheme using Random Linear Network Coding (RLNC). In addition to being decentralized, the proposed schemes are low in complexity requiring only binary coding over F2. We evaluate the performance of the proposed schemes by simulations and compare them to schemes with no network coding.

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

[2]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

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

[4]  Vladimir Stankovic,et al.  Raptor packets: A packet-centric approach to distributed raptor code design , 2009, 2009 IEEE International Symposium on Information Theory.

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

[6]  R. Koetter,et al.  The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[7]  V. Prabhakaran,et al.  Distributed data storage in sensor networks using decentralized erasure codes , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..

[8]  Muriel Medard,et al.  How good is random linear coding based distributed networked storage , 2005 .

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

[10]  Muriel Médard,et al.  XORs in the Air: Practical Wireless Network Coding , 2006, IEEE/ACM Transactions on Networking.

[11]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[12]  Qin Wang,et al.  A Realistic Power Consumption Model for Wireless Sensor Network Devices , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.

[13]  Francesco Chiti,et al.  A Packet-Centric Approach to Distributed Rateless Coding in Wireless Sensor Networks , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

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

[15]  Colin Cooper,et al.  On the distribution of rank of a random matrix over a finite field , 2000, Random Struct. Algorithms.

[16]  Emina Soljanin,et al.  Decentralized Coding Algorithms for Distributed Storage in Wireless Sensor Networks , 2010, IEEE Journal on Selected Areas in Communications.

[17]  Hossam S. Hassanein,et al.  Data survivability for WSNs via Decentralized Erasure Codes , 2012, IWCMC.

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

[19]  Emina Soljanin,et al.  Doped fountain coding for minimum delay data collection in circular networks , 2009, IEEE Journal on Selected Areas in Communications.

[20]  John Kubiatowicz,et al.  Erasure Coding Vs. Replication: A Quantitative Comparison , 2002, IPTPS.

[21]  Colin Cooper,et al.  On the rank of random matrices , 2000, Random Struct. Algorithms.

[22]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[23]  IAN F. BLAKE,et al.  PROPERTIES OF RANDOM MATRICES AND APPLICATIONS , 2006 .

[24]  Dhar,et al.  Eulerian Walkers as a Model of Self-Organized Criticality. , 1996, Physical review letters.

[25]  Vinod M. Prabhakaran,et al.  Decentralized erasure codes for distributed networked storage , 2006, IEEE Transactions on Information Theory.

[26]  Vladimir Stankovic,et al.  Fireworks: A random linear coding scheme for distributed storage in wireless sensor networks , 2010, 2010 IEEE Information Theory Workshop.