Optimal One-Dimensional Coverage by Unreliable Sensors
Authors:
- Paolo FrascaPFPaolo Frasca
- Federica GarinFGFederica Garin
- Balázs GerencsérBGBalázs Gerencsér
- Julien M. HendrickxJHJulien M. Hendrickx
Open Access
- 1 January 2015
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 53 (5) , 3120-3140
Abstract
This paper regards the problem of optimally placing unreliable sensors in a one-dimensional environment. We assume that sensors can fail with a certain probability and we minimize the expected maximum distance between any point in the environment and the closest active sensor. We provide a computational method to find the optimal placement and we estimate the costs of the equispaced placement and of the uniform random placement. When the number of sensors goes to infinity, the equispaced placement is asymptotically equivalent to the optimal placement (that is, the ratio between their costs converges to one), whereas the cost of the random placement remains strictly larger.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Nonuniform coverage control on the lineIEEE Transactions on Automatic Control, 2013
- Adaptive Deployment of Mobile Robotic NetworksIEEE Transactions on Automatic Control, 2012
- Deployment of an unreliable robotic sensor network for spatial estimationSystems & Control Letters, 2012
- Gossip Coverage Control for Robotic Networks: Dynamical Systems on the Space of PartitionsSIAM Journal on Control and Optimization, 2012
- Asymptotic Optimality of Multicenter Voronoi Configurations for Random Field EstimationIEEE Transactions on Automatic Control, 2009
- Coverage and connectivity issues in wireless sensor networks: A surveyPervasive and Mobile Computing, 2008
- Coordination and Geometric Optimization via Distributed Dynamical SystemsSIAM Journal on Control and Optimization, 2005
- Coverage Control for Mobile Sensing NetworksIEEE Transactions on Robotics and Automation, 2004
- Centroidal Voronoi Tessellations: Applications and AlgorithmsSIAM Review, 1999
- An extreme value theory for long head runsProbability Theory and Related Fields, 1986