Coordination of Mobile Mules via Facility Location Strategies

In this paper, we study the problem of wireless sensor network (WSN) maintenance using mobile entities called mules. The mules are deployed in the area of the WSN in such a way that would minimize the time it takes them to reach a failed sensor and fix it. The mules must constantly optimize their collective deployment to account for occupied mules. The objective is to define the optimal deployment and task allocation strategy for the mules, so that the sensors’ downtime and the mules’ traveling distance are minimized. Our solutions are inspired by research in the field of computational geometry and the design of our algorithms is based on state of the art approximation algorithms for the classical problem of facility location. Our empirical results demonstrate how cooperation enhances the team’s performance, and indicate that a combination of k-Median based deployment with closest-available task allocation provides the best results in terms of minimizing the sensors’ downtime but is inefficient in terms of the mules’ travel distance. A k-Centroid based deployment produces good results in both criteria.

[1]  Horst A. Eiselt,et al.  Location analysis: A synthesis and survey , 2005, Eur. J. Oper. Res..

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

[3]  Ying Wang,et al.  A machine-learning approach to multi-robot coordination , 2008, Eng. Appl. Artif. Intell..

[4]  Gaurav S. Sukhatme,et al.  Constrained coverage for mobile sensor networks , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[5]  Juliane Hahn,et al.  Security And Game Theory Algorithms Deployed Systems Lessons Learned , 2016 .

[6]  Nabil H. Mustafa,et al.  Improved Results on Geometric Hitting Set Problems , 2010, Discret. Comput. Geom..

[7]  Marek Chrobak,et al.  The Reverse Greedy Algorithm for the Metric K-Median Problem , 2005, COCOON.

[8]  Sarit Kraus,et al.  Ad Hoc Autonomous Agent Teams: Collaboration without Pre-Coordination , 2010, AAAI.

[9]  Clare Dixon,et al.  Analysing robot swarm behaviour via probabilistic model checking , 2012, Robotics Auton. Syst..

[10]  Sudipto Guha,et al.  A constant-factor approximation algorithm for the k-median problem (extended abstract) , 1999, STOC '99.

[11]  Michael Segal,et al.  Using central nodes for efficient data collection in wireless sensor networks , 2015, Comput. Networks.

[12]  Matthew S. Maxwell,et al.  Approximate Dynamic Programming for Ambulance Redeployment , 2010, INFORMS J. Comput..

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

[14]  Nicholas R. Jennings,et al.  Agent-based decentralised coordination for sensor networks using the max-sum algorithm , 2014, Autonomous Agents and Multi-Agent Systems.

[15]  Lyle A. McGeoch,et al.  Competitive Algorithms for Server Problems , 1990, J. Algorithms.

[16]  Kamesh Munagala,et al.  Local Search Heuristics for k-Median and Facility Location Problems , 2004, SIAM J. Comput..

[17]  J. Munkres.  ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[18]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. I: The p-Centers , 1979 .

[19]  Sarit Kraus,et al.  ARMOR Security for Los Angeles International Airport , 2008, AAAI.

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

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

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

[23]  Milind Tambe,et al.  Defender (Mis)coordination in Security Games , 2013, IJCAI.

[24]  Teofilo F. GONZALEZ,et al.  Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..

[25]  S. L. HAKIMIt.  AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .

[26]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.

[27]  Steven Okamoto,et al.  Distributed constraint optimization for teams of mobile sensing agents , 2014, Autonomous Agents and Multi-Agent Systems.

[28]  Ernesto Nunes,et al.  Iterated Multi-Robot Auctions for Precedence-Constrained Task Scheduling , 2016, AAMAS.

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

[30]  Ramayya Krishnan,et al.  An Efficient Simulation-Based Approach to Ambulance Fleet Allocation and Dynamic Redeployment , 2012, AAAI.

[31]  Andreas Krause,et al.  Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..

[32]  Eduardo Mena,et al.  Using Hitchhiker Mobile Agents for Environment Monitoring , 2009, PAAMS.

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

[34]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[35]  Sven Koenig,et al.  Progress on Agent Coordination with Cooperative Auctions , 2010, AAAI.

[36]  Peter Stone,et al.  Placing Influencing Agents in a Flock , 2015, AAAI.