Optimal 2-coverage of a polygonal region in a sensor network (Q1662495): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4936005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-Nearest Neighbor Voronoi Diagrams in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a line segment with variable radius discs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithm for placing a given number of base stations to cover a convex region / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a compact polygonal set by identical circles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle covering with a margin / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Covered paths by a set of antennas with minimum power transmission range / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a Polygon into Simpler Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backtrack Programming / rank
 
Normal rank

Latest revision as of 09:20, 16 July 2024

scientific article
Language Label Description Also known as
English
Optimal 2-coverage of a polygonal region in a sensor network
scientific article

    Statements

    Optimal 2-coverage of a polygonal region in a sensor network (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 August 2018
    0 references
    Summary: Wireless sensor networks are a relatively new area where technology is developing fast and are used to solve a great diversity of problems that range from museums' security to wildlife protection. The geometric optimisation problem solved in this paper is aimed at minimising the sensors' range so that every point on a polygonal region \(R\) is within the range of at least two sensors. Moreover, it is also shown how to minimise the sensors' range to assure the existence of a path within \(R\) that stays as close to two sensors as possible.
    0 references
    computational geometry
    0 references
    geometric optimisation
    0 references
    ad-hoc sensor networks
    0 references
    wireless sensor networks
    0 references
    safe routes
    0 references
    minimum range
    0 references
    Voronoi diagrams
    0 references

    Identifiers