Abstract:
We study the problem of constructing a regular covering of a strip of the least density with the identical sectors that arises in design of wireless sensor networks. Three coverage models are proposed and the comparative analysis was performed that allowed us to obtain, in particular, an upper bound on the minimum density of a covering of a strip with sectors. Tab. 1, ill. 6, bibliogr. 21.
Keywords:regular coverage, minimization of density, sensor networks.