Research of Network Coding Data Collection Mechanism Based on the Rough Routing in Wireless Multi-hop Network

In wireless sensor networks, network coding technology can enhance the data persistence. The classic wireless sensor network distributed storage algorithm LTCDS-1 may cause serious cliff effect in decoding process. To address this issue, this paper proposed a strategy BRRCD which is based on the rough routing for collecting data in packet-degree increments in wireless sensor network coding. A collector broadcasts a signal to form a layered network. Meanwhile, each node records the neighbors which are upper one layer of the network of itself, as the optional paths to reach the collector. The experiment results show that the BRRCD algorithm restrains the cliff effect in the extent.

[1]  Naixue Xiong,et al.  Prioritized Degree Distribution in Wireless Sensor Networks with a Network Coded Data Collection Method , 2012, Sensors.

[2]  Naixue Xiong,et al.  BCHED-Energy Balanced Sub-Round Local Topology Management for Wireless Sensor Network , 2012 .

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

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

[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]  Jie Gao,et al.  In-network Coding for Resilient Sensor Data Storage and Efficient Data Mule Collection , 2010, ALGOSENSORS.

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

[8]  Prosenjit Bose,et al.  Algorithms for Sensor Systems , 2015, Lecture Notes in Computer Science.

[9]  Ness B. Shroff,et al.  On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[10]  Sachin Agarwal,et al.  Rateless Coding with Feedback , 2009, IEEE INFOCOM 2009.

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

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

[13]  James S. Plank,et al.  A practical analysis of low-density parity-check erasure codes for wide-area storage applications , 2004, International Conference on Dependable Systems and Networks, 2004.

[14]  Thomas E. Fuja,et al.  Distributed LT Codes , 2006, 2006 IEEE International Symposium on Information Theory.

[15]  Nazanin Rahnavard,et al.  Efficient symbol sorting for high intermediate recovery rate of LT codes , 2010, 2010 IEEE International Symposium on Information Theory.

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