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

Authors:
Adil I. Erzin;Roman V. Plotnikov
Affiliations:
Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia and Novosibirsk State University, Novosibirsk, Russia;Novosibirsk State University, Novosibirsk, Russia
Venue:
ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V
Year:
2011

Citing 4
Cited 0

Derandomized graph products

Computational Complexity
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.