Optimal one-dimensional coverage by unreliable sensors

DOI10.1137/140968094zbMATH Open1346.49024arXiv1404.7711OpenAlexW2165150671MaRDI QIDQ2949989FDOQ2949989

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)

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.

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

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

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)

Cites Work

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

Cited In (10)

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

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)