Improving reliability of erasure codes-based storage paradigm under correlated failures for wireless sensor networks

In distributed sensor networks, ensuring data availability and reliability in the presence of node failures and malicious attacks is an important requirement. Traditionally, redundant schemes such as erasure codes and network coding are used to improve storage efficiency. However, prior works do not consider the scenario that node failures might cut the network into multiple components and result in unsuccessful data reconstruction. To address this problem, we first devise a data segment distribution scheme that enables randomly connected component of remaining network to have enough data symbols to recreate the initial data. Because the optimal symbol distribution is Nondeterministic Polynomial NP-complete problem, we further propose an approximation solution to solve it for arbitrary network model. Second, an efficient data recovery scheme with integrity check is proposed to reconstruct the initial data and repair the data saved on the disabled nodes in case of Byzantine failures. Compared with the previous approaches, the proposed scheme benefits from low data loss and storage overhead, which is confirmed by evaluations. Copyright © 2015 John Wiley & Sons, Ltd.

[1]  Prashant J. Shenoy,et al.  Rethinking Data Management for Storage-centric Sensor Networks , 2007, CIDR.

[2]  Arunabha Sen,et al.  Beyond connectivity - new metrics to evaluate robustness of networks , 2011, 2011 IEEE 12th International Conference on High Performance Switching and Routing.

[3]  J. Cole Smith,et al.  Models for Assessing Vulnerability in Imperfect Sensor Networks , 2013 .

[4]  Takahiro Hara,et al.  A survey on communication and data management issues in mobile sensor networks , 2014, Wirel. Commun. Mob. Comput..

[5]  Eytan Modiano,et al.  Network Reliability With Geographically Correlated Failures , 2010, 2010 Proceedings IEEE INFOCOM.

[6]  Meng Wu,et al.  Compressed error and erasure correcting codes via rank-metric codes in random network coding , 2012, Int. J. Commun. Syst..

[7]  Yunnan Wu,et al.  Network coding for distributed storage systems , 2010, IEEE Trans. Inf. Theory.

[8]  Alexandros G. Dimakis,et al.  Distributed Storage Allocations , 2010, IEEE Transactions on Information Theory.

[9]  Yunnan Wu,et al.  A Survey on Network Codes for Distributed Storage , 2010, Proceedings of the IEEE.

[10]  Baochun Li,et al.  Geometric Random Linear Codes in Sensor Networks , 2008, 2008 IEEE International Conference on Communications.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Xiaohong Jiang,et al.  Reliability Assessment for Wireless Mesh Networks Under Probabilistic Region Failure Model , 2011, IEEE Transactions on Vehicular Technology.

[13]  I. Reed,et al.  Polynomial Codes Over Certain Finite Fields , 1960 .

[14]  Abbas Jamalipour,et al.  Data Persistency in Wireless Sensor Networks Using Distributed Luby Transform Codes , 2013, IEEE Sensors Journal.

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

[16]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[17]  Frédérique E. Oggier,et al.  Byzantine fault tolerance of regenerating codes , 2011, 2011 IEEE International Conference on Peer-to-Peer Computing.

[18]  Tamás Kalmár-Nagy,et al.  Cut Detection in Wireless Sensor Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[19]  Anxiao Jiang,et al.  Optimal Interleaving on Tori , 2006, SIAM J. Discret. Math..

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

[21]  Alexandros G. Dimakis,et al.  Symmetric Allocations for Distributed Storage , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[22]  Meng Wu,et al.  Counteracting malicious adversaries via secret and reliable coding mechanism in random network coding , 2013, Int. J. Commun. Syst..

[23]  Mohsen Sardari,et al.  Memory allocation in distributed storage networks , 2010, 2010 IEEE International Symposium on Information Theory.

[24]  Antonio Alfredo Ferreira Loureiro,et al.  A distributed data storage protocol for heterogeneous wireless sensor networks with mobile sinks , 2013, Ad Hoc Networks.

[25]  John Cook,et al.  Comparing cost and performance of replication and erasure coding , 2013, ArXiv.

[26]  Carsten Lund,et al.  Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.

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

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

[29]  Nihar B. Shah,et al.  Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction , 2010, IEEE Transactions on Information Theory.

[30]  Anne-Marie Kermarrec,et al.  LT Network Codes , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[31]  Anxiao Jiang,et al.  Network file storage with graceful performance degradation , 2005, TOS.

[32]  Kannan Ramchandran,et al.  Securing Dynamic Distributed Storage Systems Against Eavesdropping and Adversarial Attacks , 2010, IEEE Transactions on Information Theory.

[33]  Wei Liang,et al.  Securing sensor data storage and query based on k‐out‐of‐ n coding , 2013, Int. J. Commun. Syst..