Network Coding Data Collecting Mechanism Based on Prioritized Degree Distribution in Wireless Sensor Network

Wireless sensor network (WSN) is a typical distributed storage system, and network coding technology is developed to enhance the data persistence of WSN. However, the traditional distributed coding strategy may cause serious "cliff effect" in the decoding process, that is to say, few source data can be recovered before sufficient encoded packets are received. Moreover, nodes may fail due to the lack of energy or the influence of the switching of external environment, such as a disaster scenario. Such failures may concentrate in a small region or distribute in the whole deployment area which can severely reduced the decoding efficiency of the persistent data in WSN. In this paper, we propose the PLTCDS (prioritized LT codes based distributed storage) algorithm to improve the data decoding efficiency when the data persistence is assured. The main idea of PLTCDS is that the predefined node broadcasts a beacon to stimulate the nodes to form the network with degree distribution priority. To ensure the effectiveness of storage nodes, PLTCDS introduces a class of cumulative counter scheme to avoid empty storage. Also we discuss about the idea of another type of PLTCDS. Experimental results show that PLTCDS algorithm can enhance the network data collection performance and reduce the influence of "cliff effect".

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

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

[3]  Jörg Kliewer,et al.  On the Performance of Distributed LT Codes , 2006 .

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

[5]  Anxiao Jiang Network Coding for Joint Storage and Transmission with Minimum Cost , 2006, 2006 IEEE International Symposium on Information Theory.

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

[7]  Saejoon Kim,et al.  Improved intermediate performance of rateless codes , 2009, 2009 11th International Conference on Advanced Communication Technology.

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

[9]  Francesco Chiti,et al.  Contaminated areas monitoring via distributed rateless coding with constrained data gathering , 2010, IWCMC.

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

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

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

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

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

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

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

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

[18]  Jie Gao,et al.  In-network Coding for Resilient Sensor Data Storage and Efficient Data Mule Collection , 2010, ALGOSENSORS.

[19]  Zhen Liu,et al.  Maximizing the Data Utility of a Data Archiving & Querying System through Joint Coding and Scheduling , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

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