On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains

DOI10.1134/S199047891901006XzbMath1438.52038OpenAlexW2942455196MaRDI QIDQ4973240

Sh. I. Galiev, A. V. Khorkov

Publication date: 2 December 2019

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s199047891901006x

zbMATH Keywords

wireless sensor networkmultiple coveringarrangement of sensorsk-covering with circles of given radiusk-fold coveringnumber of sensors for monitoring of given area

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Challenges and opportunities of connected \(k\)-covered wireless sensor networks. From sensor deployment to data gathering
• A fast approximation algorithm for the multicovering problem
• Covering a rectangle with equal circles
• Improved coverings of a square with six and eight equal circles
• Rounding algorithms for covering problems
• On the complexity of asymptotically optimal coverings and packings
• Covering a square by equal circles
• Covering a rectangle with six and seven circles
• Linear models for the approximate solution of the problem of packing equal circles into a given domain
• The minimum equitable radius location problem with continuous demand
• Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles
• Coverage problems in sensor networks
• Optimization of multiple covering of a bounded set with circles
• On the Complexity of Some Common Geometric Location Problems
• Approximation schemes for covering and packing problems in image processing and VLSI
• Multiple packing and covering of the plane with circles
• Loosest Circle Coverings of an Equilateral Triangle
• A computational algorithm for optimally covering a plane region
• A Heuristic Method for the Set Covering Problem
• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

This page was built for publication: On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains