1,535 research outputs found
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.Comment: 12 pages, 6 figures, conferenc
Robust Environmental Mapping by Mobile Sensor Networks
Constructing a spatial map of environmental parameters is a crucial step to
preventing hazardous chemical leakages, forest fires, or while estimating a
spatially distributed physical quantities such as terrain elevation. Although
prior methods can do such mapping tasks efficiently via dispatching a group of
autonomous agents, they are unable to ensure satisfactory convergence to the
underlying ground truth distribution in a decentralized manner when any of the
agents fail. Since the types of agents utilized to perform such mapping are
typically inexpensive and prone to failure, this results in poor overall
mapping performance in real-world applications, which can in certain cases
endanger human safety. This paper presents a Bayesian approach for robust
spatial mapping of environmental parameters by deploying a group of mobile
robots capable of ad-hoc communication equipped with short-range sensors in the
presence of hardware failures. Our approach first utilizes a variant of the
Voronoi diagram to partition the region to be mapped into disjoint regions that
are each associated with at least one robot. These robots are then deployed in
a decentralized manner to maximize the likelihood that at least one robot
detects every target in their associated region despite a non-zero probability
of failure. A suite of simulation results is presented to demonstrate the
effectiveness and robustness of the proposed method when compared to existing
techniques.Comment: accepted to icra 201
- …