Optimal 2-coverage of a polygonal region in a sensor network

DOI10.3390/a2031137zbMath1461.68041OpenAlexW2033507316MaRDI QIDQ1662495

Manuel Abellanas, Inês Matos, Antonio L. Bajuelos

Publication date: 20 August 2018

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a2031137

zbMATH Keywords

computational geometryVoronoi diagramswireless sensor networksgeometric optimisationminimum rangesafe routesad-hoc sensor networks

Mathematics Subject Classification ID

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

Related Items

Coverage restricted to an angle

Cites Work

• Unnamed Item
• Efficient algorithm for placing a given number of base stations to cover a convex region
• Covering a line segment with variable radius discs
• Covering a compact polygonal set by identical circles
• 2-Covered paths by a set of antennas with minimum power transmission range
• Circle covering with a margin
• Decomposing a Polygon into Simpler Components
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• Backtrack Programming