Wireless sensor network's lifetime maximization problem in case of given set of covers

Abstract

We consider a wireless sensor network's lifetime maximization problem as an integer linear programming problem when the redundant set of covers is given, and it is necessary to choose a lifetime of each cover subject to the limited sensor's resources. Irrespective of the function of any sensor in a cover, we suppose that the sensor may be active during some time, and the number of time rounds when it is active we call the sensor's resource. We proved that the considered problem is strong NP-hard; proposed the ways to reduce the problem; shown that the problem is not approximable within the 0.997; found special cases when it is in the class APX; proposed several heuristics and performed a simulation. © 2011 Springer-Verlag.