Design and Analysis of a Persistent, Efficient, and Self-Contained WSN Data Collection System

Wireless sensor networks are usually deployed in harsh and emergency scenarios, such as floods, fires, or earthquakes, where human participation to monitor and collect environmental data may be too dangerous. It can be also used for healthcare in extreme and remote environments. In such an environment, sensor nodes are faced with the risk of failure and the loss of valuable healthcare data. Therefore, fast collection and reliable storage of data becomes the two important basic topics for reliable data collection. Traditional distributed data collection protocols based on the network, such as Growth Codes proposed by Karma et al., have improved the persistence of data and the efficiency of reliable data collection in disaster scenarios. However, there are still some problems that reduce the overall efficiency. In this paper, we analyze the factors that affect the collection efficiency from a new perspective, the ratio of redundant symbols. Random feedback digestion (RFDG) model is proposed to digest the redundant symbols, similiar to our stomach digesting food, to remove redundant symbols and reduce resource consumption by using the feedback information of the already decoded code words sent by the sink node. This model can increase the valid information ratio in the network and finally increase data decoding efficiency. Three protocols are proposed in this paper according to different feedback mechanisms based on RFDG. It is shown that protocols based on RFDG outperform the growth codes protocol in data collection efficiency and reduce the delayed effect.

[1]  H. Vincent Poor,et al.  A Distributed Data Collection Algorithm for Wireless Sensor Networks with Persistent Storage Nodes , 2011, 2011 4th IFIP International Conference on New Technologies, Mobility and Security.

[2]  Yao Zhao,et al.  Maximizing Growth Codes Utility in Large-Scale Wireless Sensor Networks , 2010, Euro-Par.

[3]  Li Xu,et al.  A novel data collection scheme with Cluster-based Separate Network Coding for WSNs , 2012, 2012 Computing, Communications and Applications Conference.

[4]  E. Montroll,et al.  Random Walks on Lattices. II , 1965 .

[5]  Jie Gao,et al.  Data preservation under spatial failures in sensor networks , 2010, MobiHoc '10.

[6]  Ramachandran Ramjee,et al.  Network Coding-Based Broadcast in Mobile Ad-hoc Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

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

[8]  Vishal Misra,et al.  Data Persistence for Zero-Configuration Sensor Networks , 2006 .

[9]  Jianer Chen,et al.  An Overhearing-Based Scheme for Improving Data Persistence in Wireless Sensor Networks , 2010, 2010 IEEE International Conference on Communications.

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

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

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

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

[14]  Athanasios V. Vasilakos,et al.  EDAL: An Energy-Efficient, Delay-Aware, and Lifetime-Balancing Data Collection Protocol for Wireless Sensor Networks , 2013, 2013 IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems.

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

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

[17]  Vladimir Stankovic,et al.  A random linear coding scheme with perimeter data gathering for wireless sensor networks , 2011, 2011 Eighth International Conference on Wireless On-Demand Network Systems and Services.

[18]  Xin Wang,et al.  Data collection for distributed surveillance sensor networks in disaster-hit regions , 2010, 6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010).

[19]  Jun Sun,et al.  Compressive data gathering for large-scale wireless sensor networks , 2009, MobiCom '09.

[20]  Muriel Médard,et al.  XORs in the air: practical wireless network coding , 2008, TNET.

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

[22]  Radu Stoica,et al.  Random network coding for wireless ad-hoc networks , 2009, 2009 International Symposium on Signals, Circuits and Systems.

[23]  Chih-Chun Wang,et al.  Robust and optimal opportunistic scheduling for downlink 2-flow inter-session network coding with varying channel quality , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

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

[25]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

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

[27]  Athanasios V. Vasilakos,et al.  CDC: Compressive Data Collection for Wireless Sensor Networks , 2015, IEEE Transactions on Parallel and Distributed Systems.

[28]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[29]  Jörg Widmer,et al.  Network Coding Strategies for Data Persistence in Static and Mobile Sensor Networks , 2007, 2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops.

[30]  Massimiliano Sala,et al.  Efficient construction and implementation of short LDPC codes for wireless sensor networks , 2007, 2007 18th European Conference on Circuit Theory and Design.

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

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

[33]  Reiner Kolla,et al.  MCGC: A Network Coding Approach for Reliable Large-scale Wireless Networks , 2017, FAILSAFE@SenSys.

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

[35]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

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

[37]  Burak Eksioglu,et al.  The vehicle routing problem: A taxonomic review , 2009, Comput. Ind. Eng..

[38]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[39]  Xiaojun Cao,et al.  Ubiquitous WSN for Healthcare: Recent Advances and Future Prospects , 2014, IEEE Internet of Things Journal.

[40]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

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