Abstract:This paper is devoted to the construction of regular min-density plane coverings with ellipses of one, two and three types. This problem is relevant, for example, to power-efficient surface sensing by autonomous above-grade sensors. A similar problem, for which discs are used to cover a planar region, has been well studied. On the one hand, the use of ellipses generalizes a mathematical problem; on the other hand, it is necessary to solve these types of problems in real applications of wireless sensor networks… Show more
“…To evaluate the sign of the difference f( ) -g( ) it is sufficient to study the function is smaller. So, comparing three values, we find the minimum value of the objective function (6), and the optimal number of sectors covering one tile. Statement 2 is proved too.…”
Section: Supposementioning
confidence: 99%
“…An optimal cover with disks in the class COV3(4, 2) is proposed in [22]. In [6], several new regular covers with ellipses of one, two or three types are introduced. As a result, the optimal covers and upper bounds for the minimal density in the different classes are found.…”
Section: Introductionmentioning
confidence: 99%
“…The cover of a plane region A is such set of figures C, that each point in A belongs to at least one figure in C. It is believed that the sensor's energy consumption is proportional to the covered area [2,3,5,6,18,24].…”
In the regular covers, a region in the plane is split into the equal regular polygons (tiles), and all the tiles are covered equally with some geometric figures. In this paper, a tile is an equilateral triangle. We proposed and analyzed the regular covers with equal sectors in which the number of sectors per unit area is minimal. The problem of minimizing the number of sectors per unit area is closely related to the problem of the least dense coverage, but does not coincide with it completely. We found the optimal number of sectors covering one tile in the case when every sector is involved in covering only one tile, and the vertices of the sectors which cover one tile are located in one point.The results can be used in different applications, for example, for design of the cost-effective sensor networks with equal directed sensors when the coverage area of the sensor is a sector.
“…To evaluate the sign of the difference f( ) -g( ) it is sufficient to study the function is smaller. So, comparing three values, we find the minimum value of the objective function (6), and the optimal number of sectors covering one tile. Statement 2 is proved too.…”
Section: Supposementioning
confidence: 99%
“…An optimal cover with disks in the class COV3(4, 2) is proposed in [22]. In [6], several new regular covers with ellipses of one, two or three types are introduced. As a result, the optimal covers and upper bounds for the minimal density in the different classes are found.…”
Section: Introductionmentioning
confidence: 99%
“…The cover of a plane region A is such set of figures C, that each point in A belongs to at least one figure in C. It is believed that the sensor's energy consumption is proportional to the covered area [2,3,5,6,18,24].…”
In the regular covers, a region in the plane is split into the equal regular polygons (tiles), and all the tiles are covered equally with some geometric figures. In this paper, a tile is an equilateral triangle. We proposed and analyzed the regular covers with equal sectors in which the number of sectors per unit area is minimal. The problem of minimizing the number of sectors per unit area is closely related to the problem of the least dense coverage, but does not coincide with it completely. We found the optimal number of sectors covering one tile in the case when every sector is involved in covering only one tile, and the vertices of the sectors which cover one tile are located in one point.The results can be used in different applications, for example, for design of the cost-effective sensor networks with equal directed sensors when the coverage area of the sensor is a sector.
“…Then the main goal in WSN is lifetime maximization [5,8,9,10,15,17,20,23]. If only sensing energy consumption is taken into account, then the problem can be reduced to the construction of the least density covers [3,5,7,16,21,23].…”
Section: Introductionmentioning
confidence: 99%
“…A cover of a plane region is fully specified if one knows the figures included in the cover, the location of each figure and its orientation. For example, if the figures in a cover are ellipses, then it is sufficient to know the semi-axes, the location of the centre and the slope of the axis of each ellipse [7].…”
We suppose that in the sensor network, the sensing areas of the sensors are equal sectors, and consider the problem of regular covering of the plane with minimal number of identical sensors per unit area. In the regular cover, the plane is split into the equal regular polygons -"tiles" (equilateral triangles, squares or regular hexagons), and all the tiles are covered equally. We solved the problem for the special case when every sensor covers one tile, and all the sensors covering one tile are placed in one point.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.