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.
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.
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.