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

DOI10.3390/A2031137zbMATH Open1461.68041OpenAlexW2033507316MaRDI QIDQ1662495FDOQ1662495

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

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

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)

Cites Work

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

Cited In (3)

• Coverage restricted to an angle
• Network flow formulation of optimal perimeter sensory coverage problem
• Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons

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)