An Efficient Data Collection Protocol for Maximum Sensor Network Data Persistence

Sensor network has lot applications in the early warning and assistant of disaster environment such as debris flows, floods and forest fires. However, such disaster environment pose an interesting challenge for data collection since sensor nodes may be destroyed unpredictably and centrally, resulting in the decrease of data persistence in the network. Growth Codes Protocol (GCP) first focuses on increase sensor network data persistent in the disaster. However, the completely random data transmission way in GCP may cause a large number of invalid data transmissions and therefore, the efficiency of data collection of the protocol is not ideal in the late stage of data collection. In this paper, we propose an efficient data collection protocol (DGCP) to maximize sensor network data persistence by changing the completely random data transmission way. Packet classification mechanism and a novel dynamic probability model of data transmission in DGCP are proposed to control the effective direction of data flow. Furthermore, we found that the parameter optimization problem of the probabilistic model is a problem of searching the optimal solution in a mathematical view. Based on this property, we propose a genetic algorithm to optimize the dynamic probability model. The performance of the proposed DGCP is shown by a comparative experimental study. When compared with GCP, our DGCP has better performance in a variety of environments

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

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

[3]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

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

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

[6]  Hossam S. Hassanein,et al.  On The Reliability of Wireless Sensor Networks , 2006, 2006 IEEE International Conference on Communications.

[7]  Rajesh K. Gupta,et al.  Optimal Speed Control of Mobile Node for Data Collection in Sensor Networks , 2010, IEEE Transactions on Mobile Computing.

[8]  M. Medard,et al.  XORs in the Air: Practical Wireless Network Coding , 2006, IEEE/ACM Transactions on Networking.

[9]  Chen Gui-Hai Energy-Efficient Routing Algorithms Based on Linear Network Coding in Wireless Sensor Networks , 2010 .

[10]  Christos Gkantsidis,et al.  Network coding for large scale content distribution , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Athanasios V. Vasilakos,et al.  EDAL: An Energy-Efficient, Delay-Aware, and Lifetime-Balancing Data Collection Protocol for Heterogeneous Wireless Sensor Networks , 2015, IEEE/ACM Transactions on Networking.

[12]  Growth codes: maximizing sensor network data persistence , 2006, SIGCOMM '06.

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