Modified Growth Codes: Enhancing data persistence in sparse sensor networks

Wireless sensor networks are often deployed to work in harsh or disaster and other special environments, such as earthquakes, floods, fires, other outer space and the battlefield. Owing to the lack of energy or disaster scenarios, sensor nodes may fail easily. This severe reduce the data persistence in the network and the efficiency of the sensed data acquisition. Growth Codes (GC) can work effectively and enhance the data persistence simultaneously. However, the performance of GC decreases significantly when deployed in the sparse sensor networks. Uneven sensor data distribution may happen at the beginning of the encoding due to GC exchanges codewords in a completely random way which may also do no good to the data collection in the later period. Furthermore, in the catastrophic scenarios, the nodes continue to failure, which may lead to the network become sparse. To solve this problem, in this paper, we propose an improved GC algorithm-MGC (Modified Growth Codes) from the perspective of making the sensed data distribute uniformly. Later, a more efficient data collection algorithm MGC TYPE ? is proposed. Simulation results show that the performance of MGC and MGC TYPE II is better than GC, especially in the sparse networks.

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

[2]  Alessandro Vespignani,et al.  Epidemic spreading in complex networks with degree correlations , 2003, cond-mat/0301149.

[3]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[4]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[5]  B. Noble,et al.  On certain integrals of Lipschitz-Hankel type involving products of bessel functions , 1955, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.

[6]  J. Maxwell A Treatise on Electricity and Magnetism , 1873, Nature.

[7]  Jörg Widmer,et al.  Resilient Coding Algorithms for Sensor Network Data Persistence , 2008, EWSN.

[8]  Yunfeng Lin,et al.  Performance modeling of network coding in epidemic routing , 2007, MobiOpp '07.

[9]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[10]  Udo W. Pooch,et al.  Customizing a geographical routing protocol for wireless sensor networks , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.

[11]  Deborah Estrin,et al.  Directed diffusion for wireless sensor networking , 2003, TNET.

[12]  Xianghua Xu,et al.  Regulative Growth Codes: Enhancing Data Persistence in Sparse Sensor Networks , 2010, 2010 IEEE Asia-Pacific Services Computing Conference.

[13]  Alexandros G. Dimakis,et al.  Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[14]  Luca Simone Ronga,et al.  Performance evaluation of an IEEE802.15.4 standard based wireless sensor network in Mars exploration scenario , 2009, 2009 1st International Conference on Wireless Communication, Vehicular Technology, Information Theory and Aerospace & Electronic Systems Technology.

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

[16]  T. Yorozu,et al.  Electron Spectroscopy Studies on Magneto-Optical Media and Plastic Substrate Interface , 1987, IEEE Translation Journal on Magnetics in Japan.

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

[18]  Jon Crowcroft,et al.  Siphon: overload traffic management using multi-radio virtual sinks in sensor networks , 2005, SenSys '05.

[19]  Lihao Xu,et al.  Optimizing Cauchy Reed-Solomon Codes for Fault-Tolerant Network Storage Applications , 2006, Fifth IEEE International Symposium on Network Computing and Applications (NCA'06).

[20]  Hayder Radha,et al.  Natural growth codes: Partial recovery under random network coding , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

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

[22]  Muriel Medard,et al.  On Randomized Network Coding , 2003 .

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