Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule

In this paper, we study the problem of data gathering in ad-hoc sensor networks using a mobile entity called mule . The mule traverses the children of failed sensors, to prevent loss of data. Our objective is to define the optimal communication tree, and the mule’s placement such that the mule’s overall traveling distance is minimized. We explore this problem in several network topologies including: unit disc graph on a line (UDL), general unit disc graph (UDG), and a complete graph with failing probabilities on the nodes (CGFP). We provide an optimal solution for the UDL problem and three approximation algorithms for the UDG problem. For the CGFP problem we outline the two possible structures of an optimal solution and provide near optimal approximation algorithms.

[1]  Michael Segal,et al.  Collecting data in ad-hoc networks with reduced uncertainty , 2013, 2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt).

[2]  Prosenjit Bose,et al.  Fast approximations for sums of distances, clustering and the Fermat-Weber problem , 2003, Computational geometry.

[3]  Peng-Jun Wan,et al.  Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.

[4]  Yingfan L. Du,et al.  A new bound on maximum independent set and minimum connected dominating set in unit disk graphs , 2015, J. Comb. Optim..

[5]  Andreas Terzis,et al.  Using mobile robots to harvest data from sensor fields , 2009, IEEE Wireless Communications.

[6]  Mani B. Srivastava,et al.  Mobile element scheduling for efficient data collection in wireless sensor networks with dynamic deadlines , 2004, 25th IEEE International Real-Time Systems Symposium.

[7]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[8]  Stephane Durocher,et al.  Algorithms, Theory , 2006 .

[9]  Ryu Miura,et al.  Dynamic Recovery of Wireless Multi-Hop Infrastructure With the Autonomous Mobile Base Station , 2016, IEEE Access.

[10]  F. Fodor.  The Densest Packing of 19 Congruent Circles in a Circle , 1999 .

[11]  Donghyun Kim,et al.  Minimizing data collection latency in wireless sensor network with multiple mobile elements , 2012, 2012 Proceedings IEEE INFOCOM.

[12]  Weiping Shang,et al.  On minimum m-connected k-dominating set problem in unit disc graphs , 2008, J. Comb. Optim..

[13]  Eytan Modiano,et al.  Construction and Maintenance of Wireless Mobile Backbone Networks , 2009, IEEE/ACM Transactions on Networking.

[14]  Satish Rao,et al.  Approximating geometrical graphs via “spanners” and “banyans” , 1998, STOC '98.

[15]  Michael Segal,et al.  Using data mules for sensor network data recovery , 2016, Ad Hoc Networks.

[16]  Sajal K. Das,et al.  Data Collection in Wireless Sensor Networks with Mobile Elements: A Survey , 2011, TOSN.

[17]  Jie Gao,et al.  Exact and Approximation Algorithms for Data Mule Scheduling in a Sensor Network , 2015, ALGOSENSORS.

[18]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..