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

DOI10.3390/A2031137MaRDI QIDQ1662495zbMATH OpenOpenAlexFDO

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

Publication date 20 August 2018

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• Multi cover of a polygon minimizing the sum of areas
• Multi cover of a polygon minimizing the sum of areas
• Optimal movement of mobile sensors for barrier coverage of a planar region
• Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region
• Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks

Cites work

• scientific article; zbMATH DE number 1391661 (Why is no real title available?)
• 2-Covered paths by a set of antennas with minimum power transmission range
• Backtrack Programming
• Circle covering with a margin
• Covering a compact polygonal set by identical circles
• Covering a line segment with variable radius discs
• Decomposing a Polygon into Simpler Components
• Efficient algorithm for placing a given number of base stations to cover a convex region
• On k-Nearest Neighbor Voronoi Diagrams in the Plane

Cited in

(5)

• Multi cover of a polygon minimizing the sum of areas
• Coverage restricted to an angle
• Multi cover of a polygon minimizing the sum of areas
• Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
• Network flow formulation of optimal perimeter sensory coverage problem

This page was built for publication: Optimal 2-coverage of a polygonal region in a sensor network

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