Optimal one-dimensional coverage by unreliable sensors

DOI10.1137/140968094MaRDI QIDQ2949989zbMATHOpenAlexFDO

Authors Paolo Frasca, Federica Garin, Balázs Gerencsér, Julien M. Hendrickx

Publication date 5 October 2015

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.7711

zbMATH Keywords

sensor networkssensor deploymentcoverage optimizationrobotic networksunreliable sensors

Mathematics Subject Classification ID

Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Existence of optimal solutions to problems involving randomness (49J55) Communication networks in operations research (90B18) Optimal stochastic control (93E20) Network design and communication in computer systems (68M10)

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 from any point in the environment to the closest active sensor. We provide a computational method to find the optimal placement and we estimate the relative quality of equispaced and random placements. We prove that the former is asymptotically equivalent to the optimal placement when the number of sensors goes to infinity, with a cost ratio converging to 1, while the cost of the latter remains strictly larger.

Recommendations

• Sensor allocation problems on the real line
• Covering a planar region by randomly distributed sensors
• A robust sensor covering and communication problem
• Barrier coverage
• Coverage Problem of Wireless Sensor Networks

Cites work

• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 193944 (Why is no real title available?)
• Adaptive Deployment of Mobile Robotic Networks
• An extreme value theory for long head runs
• Asymptotic Optimality of Multicenter Voronoi Configurations for Random Field Estimation
• Centroidal Voronoi Tessellations: Applications and Algorithms
• Coordination and Geometric Optimization via Distributed Dynamical Systems
• Deployment of an unreliable robotic sensor network for spatial estimation
• Distributed control of robotic networks: a mathematical approach to motion coordination algorithms.
• Distributed welfare games
• Gossip coverage control for robotic networks: dynamical systems on the space of partitions
• Hedonic coalition formation for optimal deployment
• Nonuniform coverage control on the line
• Order Statistics
• Random Networks for Communication

Cited in

(10)

• Minimal sensor integrity: Measuring the vulnerability of sensor grids
• Nonuniform coverage control for heterogeneous mobile sensor networks on the line
• Optimal sensor positioning; a probability perspective study
• Limiting behaviors for longest consecutive switches in an IID Bernoulli sequence
• Sensor allocation problems on the real line
• Coverage control for heterogeneous mobile sensor networks with bounded position measurement errors
• A robust sensor covering and communication problem
• Coverage control for mobile sensor networks with time-varying communication delays on a closed curve
• On the moment absolute deviation of order statistics from uniform distribution
• How many wireless sensors are needed to guarantee connectivity of a one-dimensional network with random inter-node spacing?

This page was built for publication: Optimal one-dimensional coverage by unreliable sensors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949989)