On maximization of sensor network's lifetime subject to the limited resources

A sensor network's lifetime maximization problem subject to the limited resources of sensors is considered as an integer linear programming problem when the set of covers is given and it is necessary to find a lifetime of each cover. Meanwhile sensor's resource is given as a number of time rounds during which it can be active. We proved strong NP-hardness of the problem; proposed the ways of its reduction; estimated a limit of approximability; found the special cases when the problem is polynomially solvable; proposed the heuristics for constructing approximate solutions and performed a posteriori analysis. Tab. 1, bibliogr. 18.