This article is cited in 2 scientific papers (total in 2 papers)
On maximization of sensor network's lifetime subject to the limited resources
A. I. Erzinab, R. V. Plotnikovb
a S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
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.
sensor network, lifetime maximization, energy consumption, integer linear programming.
PDF file (292 kB)
A. I. Erzin, R. V. Plotnikov, “On maximization of sensor network's lifetime subject to the limited resources”, Diskretn. Anal. Issled. Oper., 18:6 (2011), 17–32
Citation in format AMSBIB
\by A.~I.~Erzin, R.~V.~Plotnikov
\paper On maximization of sensor network's lifetime subject to the limited resources
\jour Diskretn. Anal. Issled. Oper.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
I. I. Takhonov, “O nekotorykh zadachakh pokrytiya ploskosti krugami”, Diskretn. analiz i issled. oper., 21:1 (2014), 84–102
I. I. Takhonov, “Multilevel Regular Coverings of the Plane by Discs”, J. Math. Sci., 211:6 (2015), 886–901
|Number of views:|