Maximum lifetime coverage problem with battery recovery effect

Norie Fu, Naonori Kakimura, Kei Kimura, Vorapong Suppakitpaisarn

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Scheduling sensors to prolong the lifetime of target coverage is one of the central problems faced in wireless sensor networks. This problem, called the maximum lifetime coverage problem (MLCP), can be formulated as a linear program with exponential size and has a polynomial-time approximation scheme (PTAS). In reality, however, sensor batteries are subject to the recovery effect, which means that the deliverable energy in a battery can replenish itself if it is left idle for a sufficient duration. Thanks to this effect, we can obtain much longer sensor lifetime if each sensor is intermittently forced to turn off for some interval. In this study, we introduce two models that extend the MLCP to incorporate the battery recovery effect. The first model, called as duty cycle model, represents the battery recovery effect in a deterministic way. The second one, called as linear recovery model, uses a probabilistic model to imitate this effect. We propose two efficient algorithms that work for both models, adapting greedy and Garg–Könemann-based algorithms for the original MLCP. In our numerical experiments, our greedy algorithm performs best in the duty cycle model, while our Garg–Könemann-based algorithm performs best in the linear recovery model. For each network, we compare the longest lifetime obtained from our algorithms with the longest lifetime obtained from algorithms for the original MLCP. As a result, we found that our lifetime is 10–40% longer.

Original languageEnglish
Pages (from-to)1-13
Number of pages13
JournalSustainable Computing: Informatics and Systems
Volume18
DOIs
Publication statusPublished - 2018 Jun 1

Fingerprint

Recovery
Sensors
Wireless sensor networks
Scheduling
Polynomials
Experiments

Keywords

  • Approximation algorithms
  • Battery recovery effect
  • Maximum lifetime coverage problem (MLCP)
  • Wireless sensor networks

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

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

In: Sustainable Computing: Informatics and Systems, Vol. 18, 01.06.2018, p. 1-13.

Research output: Contribution to journalArticle

Fu, Norie ; Kakimura, Naonori ; Kimura, Kei ; Suppakitpaisarn, Vorapong. / Maximum lifetime coverage problem with battery recovery effect. In: Sustainable Computing: Informatics and Systems. 2018 ; Vol. 18. pp. 1-13.
@article{1f71574b19bc45e9bb7933dcfa91e0b5,
title = "Maximum lifetime coverage problem with battery recovery effect",
abstract = "Scheduling sensors to prolong the lifetime of target coverage is one of the central problems faced in wireless sensor networks. This problem, called the maximum lifetime coverage problem (MLCP), can be formulated as a linear program with exponential size and has a polynomial-time approximation scheme (PTAS). In reality, however, sensor batteries are subject to the recovery effect, which means that the deliverable energy in a battery can replenish itself if it is left idle for a sufficient duration. Thanks to this effect, we can obtain much longer sensor lifetime if each sensor is intermittently forced to turn off for some interval. In this study, we introduce two models that extend the MLCP to incorporate the battery recovery effect. The first model, called as duty cycle model, represents the battery recovery effect in a deterministic way. The second one, called as linear recovery model, uses a probabilistic model to imitate this effect. We propose two efficient algorithms that work for both models, adapting greedy and Garg–K{\"o}nemann-based algorithms for the original MLCP. In our numerical experiments, our greedy algorithm performs best in the duty cycle model, while our Garg–K{\"o}nemann-based algorithm performs best in the linear recovery model. For each network, we compare the longest lifetime obtained from our algorithms with the longest lifetime obtained from algorithms for the original MLCP. As a result, we found that our lifetime is 10–40{\%} longer.",
keywords = "Approximation algorithms, Battery recovery effect, Maximum lifetime coverage problem (MLCP), Wireless sensor networks",
author = "Norie Fu and Naonori Kakimura and Kei Kimura and Vorapong Suppakitpaisarn",
year = "2018",
month = "6",
day = "1",
doi = "10.1016/j.suscom.2018.02.007",
language = "English",
volume = "18",
pages = "1--13",
journal = "Sustainable Computing: Informatics and Systems",
issn = "2210-5379",
publisher = "Elsevier USA",

}

TY - JOUR

T1 - Maximum lifetime coverage problem with battery recovery effect

AU - Fu, Norie

AU - Kakimura, Naonori

AU - Kimura, Kei

AU - Suppakitpaisarn, Vorapong

PY - 2018/6/1

Y1 - 2018/6/1

N2 - Scheduling sensors to prolong the lifetime of target coverage is one of the central problems faced in wireless sensor networks. This problem, called the maximum lifetime coverage problem (MLCP), can be formulated as a linear program with exponential size and has a polynomial-time approximation scheme (PTAS). In reality, however, sensor batteries are subject to the recovery effect, which means that the deliverable energy in a battery can replenish itself if it is left idle for a sufficient duration. Thanks to this effect, we can obtain much longer sensor lifetime if each sensor is intermittently forced to turn off for some interval. In this study, we introduce two models that extend the MLCP to incorporate the battery recovery effect. The first model, called as duty cycle model, represents the battery recovery effect in a deterministic way. The second one, called as linear recovery model, uses a probabilistic model to imitate this effect. We propose two efficient algorithms that work for both models, adapting greedy and Garg–Könemann-based algorithms for the original MLCP. In our numerical experiments, our greedy algorithm performs best in the duty cycle model, while our Garg–Könemann-based algorithm performs best in the linear recovery model. For each network, we compare the longest lifetime obtained from our algorithms with the longest lifetime obtained from algorithms for the original MLCP. As a result, we found that our lifetime is 10–40% longer.

AB - Scheduling sensors to prolong the lifetime of target coverage is one of the central problems faced in wireless sensor networks. This problem, called the maximum lifetime coverage problem (MLCP), can be formulated as a linear program with exponential size and has a polynomial-time approximation scheme (PTAS). In reality, however, sensor batteries are subject to the recovery effect, which means that the deliverable energy in a battery can replenish itself if it is left idle for a sufficient duration. Thanks to this effect, we can obtain much longer sensor lifetime if each sensor is intermittently forced to turn off for some interval. In this study, we introduce two models that extend the MLCP to incorporate the battery recovery effect. The first model, called as duty cycle model, represents the battery recovery effect in a deterministic way. The second one, called as linear recovery model, uses a probabilistic model to imitate this effect. We propose two efficient algorithms that work for both models, adapting greedy and Garg–Könemann-based algorithms for the original MLCP. In our numerical experiments, our greedy algorithm performs best in the duty cycle model, while our Garg–Könemann-based algorithm performs best in the linear recovery model. For each network, we compare the longest lifetime obtained from our algorithms with the longest lifetime obtained from algorithms for the original MLCP. As a result, we found that our lifetime is 10–40% longer.

KW - Approximation algorithms

KW - Battery recovery effect

KW - Maximum lifetime coverage problem (MLCP)

KW - Wireless sensor networks

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

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

U2 - 10.1016/j.suscom.2018.02.007

DO - 10.1016/j.suscom.2018.02.007

M3 - Article

AN - SCOPUS:85042446778

VL - 18

SP - 1

EP - 13

JO - Sustainable Computing: Informatics and Systems

JF - Sustainable Computing: Informatics and Systems

SN - 2210-5379

ER -