Инд. авторы:	Astrakov S.N.
Заглавие:	Coverings of sets with restrictions on the arrangement of circles
Библ. ссылка:	Astrakov S.N. Coverings of sets with restrictions on the arrangement of circles // CEUR Workshop Proceedings. - 2017. - Vol.1987. - P.67-72. - ISSN 1613-0073.
Внешние системы:	SCOPUS: 2-s2.0-85036647810;
Реферат:	eng: Coverings of sets and domains by a system of circles whose centers have restrictions on their arrangement are considered. From the sensorrelated perspective, this corresponds to the sensor coverage problem, where the network sensors control objects or a region of space, but are located outside the control area. Formalizing the problem, we arrive at the problem of discrete geometry to determine the optimal number of circles, their sizes and locations, which provide the minimum coverage density of a given set. New results for the optimal outer covering of a circle, a square and a regular triangle are presented. The study of these models opens a possibility of building a sensor network with a minimal energy consumption. © Copyright by the paper's authors.
Ключевые слова:	Sensor coverage problem; Optimal number; Network sensors; Minimum coverage; Minimal energy; Discrete geometry; Control objects; Control area; Energy utilization; Sensor networks;
Издано:	2017
Физ. характеристика:	с.67-72
Конференция:	Название: 8th International Conference on Optimization and Applications Аббревиатура: OPTIMA 2017 Город: Petrovac Страна: Montenegro Даты проведения: 2017-10-02 - 2017-10-07