Maximum lifetime coverage problems with battery recovery effects

Norie Fu, Vorapong Suppakitpaisarn, Kei Kimura, Naonori Kakimura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

Scheduling sensors to prolong the lifetime of covering targets in the field is one of the central problems in wireless sensor networks. This problem, called the maximum lifetime coverage problem (MLCP), can be formulated as a linear programming problem with exponential size, and has a constant-factor approximation algorithm. In reality, however, batteries of sensors have recovery effects, which is a phenomenon that the deliverable energy in batteries can be replenished by itself if it is left idling for sufficient duration. Thanks to that effects, we can obtain much longer lifetime of sensors if each sensor is forced to take a sleep at some interval. In this paper, we introduce two models that extend the MLCP, incorporating battery recovery effects. The first model represents battery recovery effects in a deterministic way, while the second one uses a probabilistic model to imitate the effects. We then propose efficient algorithms that work for both models by extending approximation algorithms for the original MLCP. Numerical experiments show that the lifetime of our schedule is 10-40% longer than one without battery recovery effects.

Original languageEnglish
Title of host publication2014 IEEE Global Communications Conference, GLOBECOM 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages118-124
Number of pages7
ISBN (Electronic)9781479935116
DOIs
Publication statusPublished - 2014 Feb 9
Externally publishedYes
Event2014 IEEE Global Communications Conference, GLOBECOM 2014 - Austin, United States
Duration: 2014 Dec 82014 Dec 12

Other

Other2014 IEEE Global Communications Conference, GLOBECOM 2014
CountryUnited States
CityAustin
Period14/12/814/12/12

Fingerprint

coverage
Recovery
Sensors
Approximation algorithms
Linear programming
Wireless sensor networks
Scheduling
sleep
scheduling
programming
energy
Experiments
experiment

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Communication

Cite this

Fu, N., Suppakitpaisarn, V., Kimura, K., & Kakimura, N. (2014). Maximum lifetime coverage problems with battery recovery effects. In 2014 IEEE Global Communications Conference, GLOBECOM 2014 (pp. 118-124). [7036794] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/GLOCOM.2014.7036794

Maximum lifetime coverage problems with battery recovery effects. / Fu, Norie; Suppakitpaisarn, Vorapong; Kimura, Kei; Kakimura, Naonori.

2014 IEEE Global Communications Conference, GLOBECOM 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 118-124 7036794.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fu, N, Suppakitpaisarn, V, Kimura, K & Kakimura, N 2014, Maximum lifetime coverage problems with battery recovery effects. in 2014 IEEE Global Communications Conference, GLOBECOM 2014., 7036794, Institute of Electrical and Electronics Engineers Inc., pp. 118-124, 2014 IEEE Global Communications Conference, GLOBECOM 2014, Austin, United States, 14/12/8. https://doi.org/10.1109/GLOCOM.2014.7036794
Fu N, Suppakitpaisarn V, Kimura K, Kakimura N. Maximum lifetime coverage problems with battery recovery effects. In 2014 IEEE Global Communications Conference, GLOBECOM 2014. Institute of Electrical and Electronics Engineers Inc. 2014. p. 118-124. 7036794 https://doi.org/10.1109/GLOCOM.2014.7036794
Fu, Norie ; Suppakitpaisarn, Vorapong ; Kimura, Kei ; Kakimura, Naonori. / Maximum lifetime coverage problems with battery recovery effects. 2014 IEEE Global Communications Conference, GLOBECOM 2014. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 118-124
@inproceedings{256f6e75af8d4ac3beb00c3ad45fe8b7,
title = "Maximum lifetime coverage problems with battery recovery effects",
abstract = "Scheduling sensors to prolong the lifetime of covering targets in the field is one of the central problems in wireless sensor networks. This problem, called the maximum lifetime coverage problem (MLCP), can be formulated as a linear programming problem with exponential size, and has a constant-factor approximation algorithm. In reality, however, batteries of sensors have recovery effects, which is a phenomenon that the deliverable energy in batteries can be replenished by itself if it is left idling for sufficient duration. Thanks to that effects, we can obtain much longer lifetime of sensors if each sensor is forced to take a sleep at some interval. In this paper, we introduce two models that extend the MLCP, incorporating battery recovery effects. The first model represents battery recovery effects in a deterministic way, while the second one uses a probabilistic model to imitate the effects. We then propose efficient algorithms that work for both models by extending approximation algorithms for the original MLCP. Numerical experiments show that the lifetime of our schedule is 10-40{\%} longer than one without battery recovery effects.",
author = "Norie Fu and Vorapong Suppakitpaisarn and Kei Kimura and Naonori Kakimura",
year = "2014",
month = "2",
day = "9",
doi = "10.1109/GLOCOM.2014.7036794",
language = "English",
pages = "118--124",
booktitle = "2014 IEEE Global Communications Conference, GLOBECOM 2014",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Maximum lifetime coverage problems with battery recovery effects

AU - Fu, Norie

AU - Suppakitpaisarn, Vorapong

AU - Kimura, Kei

AU - Kakimura, Naonori

PY - 2014/2/9

Y1 - 2014/2/9

N2 - Scheduling sensors to prolong the lifetime of covering targets in the field is one of the central problems in wireless sensor networks. This problem, called the maximum lifetime coverage problem (MLCP), can be formulated as a linear programming problem with exponential size, and has a constant-factor approximation algorithm. In reality, however, batteries of sensors have recovery effects, which is a phenomenon that the deliverable energy in batteries can be replenished by itself if it is left idling for sufficient duration. Thanks to that effects, we can obtain much longer lifetime of sensors if each sensor is forced to take a sleep at some interval. In this paper, we introduce two models that extend the MLCP, incorporating battery recovery effects. The first model represents battery recovery effects in a deterministic way, while the second one uses a probabilistic model to imitate the effects. We then propose efficient algorithms that work for both models by extending approximation algorithms for the original MLCP. Numerical experiments show that the lifetime of our schedule is 10-40% longer than one without battery recovery effects.

AB - Scheduling sensors to prolong the lifetime of covering targets in the field is one of the central problems in wireless sensor networks. This problem, called the maximum lifetime coverage problem (MLCP), can be formulated as a linear programming problem with exponential size, and has a constant-factor approximation algorithm. In reality, however, batteries of sensors have recovery effects, which is a phenomenon that the deliverable energy in batteries can be replenished by itself if it is left idling for sufficient duration. Thanks to that effects, we can obtain much longer lifetime of sensors if each sensor is forced to take a sleep at some interval. In this paper, we introduce two models that extend the MLCP, incorporating battery recovery effects. The first model represents battery recovery effects in a deterministic way, while the second one uses a probabilistic model to imitate the effects. We then propose efficient algorithms that work for both models by extending approximation algorithms for the original MLCP. Numerical experiments show that the lifetime of our schedule is 10-40% longer than one without battery recovery effects.

UR - http://www.scopus.com/inward/record.url?scp=84988287130&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84988287130&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2014.7036794

DO - 10.1109/GLOCOM.2014.7036794

M3 - Conference contribution

AN - SCOPUS:84988287130

SP - 118

EP - 124

BT - 2014 IEEE Global Communications Conference, GLOBECOM 2014

PB - Institute of Electrical and Electronics Engineers Inc.

ER -