A fast FPTAS for two dimensional barrier coverage using sink-based mobile sensors with MinSum movement

DOI10.1007/978-3-030-93176-6_23zbMath1498.68041OpenAlexW4205593274MaRDI QIDQ2151379

Lei Liu, Chunlin Hao, Wenjie Zou, Longkun Guo

Publication date: 1 July 2022

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

zbMATH Keywords

approximation algorithmbarrier coveragemobile sensor networkMinSum movementsink station

Mathematics Subject Classification ID

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

Cites Work

• Minimizing the aggregate movements for interval coverage
• Optimal movement of mobile sensors for barrier coverage of a planar region
• Complexity of barrier coverage with relocatable sensors in the plane
• Optimal point movement for covering circular regions
• Minimizing Total Sensor Movement for Barrier Coverage by Non-uniform Sensors on a Line
• New Algorithms for Barrier Coverage with Mobile Sensors
• Barrier Coverage with Uniform Radii in 2D
• Improved PTASs for convex barrier coverage
• Barrier coverage problem in 2D

This page was built for publication: A fast FPTAS for two dimensional barrier coverage using sink-based mobile sensors with MinSum movement