Efficient mobile sink-based data gathering in wireless sensor networks with guaranteed delay

In this paper, we present a rendezvous-based data gathering protocol for wireless sensor networks employing a mobile sink. For satisfying timely delivery of sensory data to the mobile sink, the mobile sink is forced to visit only an appropriate number of rendezvous nodes while the remaining nodes send their data through multi-hop communication toward the rendezvous nodes. The proposed technique achieves prolonged network lifetime by selecting energy rich paths for this multi-hop communication. Specifically, first the network is partitioned into a number of clusters and then the cluster heads of an appropriate number of energy rich clusters are selected as rendezvous nodes in such a way that (i) the rendezvous nodes are appropriately distributed across the network area to ensure energy efficient data gathering from the other sensor nodes to the rendezvous nodes and (ii) the length of the mobile sink trajectory is below a certain limit. Then, by exploiting the clustering structure, energy efficient routes are determined for all sensor nodes of the network toward the mobile sink trajectory. Experimental results confirm the effectiveness of our approach compared with other competitive approaches from the literature.

[1]  Rajesh K. Gupta,et al.  Improving the Data Delivery Latency in Sensor Networks with Controlled Mobility , 2008, DCOSS.

[2]  Guoliang Xing,et al.  Rendezvous design algorithms for wireless sensor networks with a mobile base station , 2008, MobiHoc '08.

[3]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .

[4]  Guoliang Xing,et al.  Rendezvous Planning in Wireless Sensor Networks with Mobile Elements , 2008, IEEE Transactions on Mobile Computing.

[5]  Fazel Naghdy,et al.  An Energy-Efficient Mobile-Sink Path Selection Strategy for Wireless Sensor Networks , 2014, IEEE Transactions on Vehicular Technology.

[6]  Dirk Van Oudheusden,et al.  Iterated local search for the team orienteering problem with time windows , 2009, Comput. Oper. Res..

[7]  Jun Luo,et al.  Joint mobility and routing for lifetime elongation in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[8]  Mo Li,et al.  Load Balanced Rendezvous Data Collection in Wireless Sensor Networks , 2011, 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems.

[9]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[10]  Charalampos Konstantopoulos,et al.  Watershed-Based Clustering for Energy Efficient Data Gathering in Wireless Sensor Networks with Mobile Collector , 2012, Euro-Par.

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

[12]  Emanuel Melachrinoudis,et al.  Controlled sink mobility for prolonging wireless sensor networks lifetime , 2008, Wirel. Networks.

[13]  Khaled Almiani,et al.  Energy-efficient data gathering with tour length-constrained mobile elements in wireless sensor networks , 2010, IEEE Local Computer Network Conference.