Wireless sensor networks and covering of the stripe with equal sectors

This paper contains the results of constructing the least dense covers of the stripe with equal sectors. The problem is considered in the context of design an energy efficient wireless sensor network, which is an example of a distributed network of data collection and transmission. Arising in this connection computational geometry problems are intricate, so basically approximate solutions are proposed. We compare several new coverage models and find the accessible regions for sector´s parameters when one of these models has least density.