RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., 2011, Volume 18, Number 6, Pages 17–32 (Mi da668)  

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

Abstract: 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.

Keywords: sensor network, lifetime maximization, energy consumption, integer linear programming.

Full text: PDF file (292 kB)
References: PDF file   HTML file

Bibliographic databases:

Document Type: Article
UDC: 519.8
Received: 12.04.2011
Revised: 16.06.2011

Citation: 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
\Bibitem{ErzPlo11}
\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.
\yr 2011
\vol 18
\issue 6
\pages 17--32
\mathnet{http://mi.mathnet.ru/da668}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2953798}
\zmath{https://zbmath.org/?q=an:1249.68004}


Linking options:
  • http://mi.mathnet.ru/eng/da668
  • http://mi.mathnet.ru/eng/da/v18/i6/p17

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. I. I. Takhonov, “O nekotorykh zadachakh pokrytiya ploskosti krugami”, Diskretn. analiz i issled. oper., 21:1 (2014), 84–102  mathnet  mathscinet
    2. I. I. Takhonov, “Multilevel Regular Coverings of the Plane by Discs”, J. Math. Sci., 211:6 (2015), 886–901  mathnet  crossref
  • Дискретный анализ и исследование операций
    Number of views:
    This page:242
    Full text:61
    References:36
    First page:4

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018