Barrier coverage problem in 2D

DOI10.1007/978-3-030-14094-6_8MaRDI QIDQ6051503zbMATH OpenFDO

Authors A. I. Erzin, Natalya Lagutkina

Publication date 20 October 2023

Published in Algorithms for Sensor Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-14094-6_8

zbMATH Keywords

barrier coveragemobile sensorssensor networks

Mathematics Subject Classification ID

Wireless sensor networks as related to computer science (68M18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• Barrier Coverage with Uniform Radii in 2D
• Barrier coverage with non-uniform lengths to minimize aggregate movements

Cited in

(6)

• On the complexity of two circle connecting problems
• A fast FPTAS for two dimensional barrier coverage using sink-based mobile sensors with MinSum movement
• Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane
• Improved PTASs for convex barrier coverage
• Optimal placement of mobile sensors for the distance-constrained line routing problem
• Drone placement for optimal barrier coverage

This page was built for publication: Barrier coverage problem in 2D

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