Satisfying the target network lifetime in wireless sensor networks

Keontaek Lee, Hak Jin Kim, Sunju Park, Seungjae Han

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Generally, the lifetime of a wireless sensor network (WSN) is defined as the duration until any sensor node dies due to battery exhaustion. If the traffic load is not properly balanced, the batteries of some sensor nodes may be depleted quickly, and the lifetime of the WSN will be shortened. While many energy-efficient routing schemes have been proposed for WSNs, they focus on maximizing the WSN lifetime. In this paper, we propose a scheme that satisfies a given 'target' lifetime. Because energy consumption depends on traffic volume, the target lifetime cannot be guaranteed through energy-efficient routing alone. We take an approach that jointly optimizes the sensing rate (i.e., controlling the sensor-traffic generation or duty cycle) and route selection. Satisfying the target lifetime while maximizing the sensing rate is a NP-hard problem. Our scheme is based on a simple Linear Programming (LP) model and clever heuristics are applied to compute a near-optimal result from the LP solution. We prove that the proposed scheme guarantees a 1/2-approximation to the optimal solution in the worst case. The simulation results indicate that the proposed scheme achieves near-optimality in various network configurations.

Original languageEnglish
Pages (from-to)41-55
Number of pages15
JournalComputer Networks
Volume65
DOIs
Publication statusPublished - 2014 Jun 2

Fingerprint

Wireless sensor networks
Sensor nodes
Linear programming
Computational complexity
Energy utilization
Sensors

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

@article{3efc396e657549e7a16ce897a2d8b8c5,
title = "Satisfying the target network lifetime in wireless sensor networks",
abstract = "Generally, the lifetime of a wireless sensor network (WSN) is defined as the duration until any sensor node dies due to battery exhaustion. If the traffic load is not properly balanced, the batteries of some sensor nodes may be depleted quickly, and the lifetime of the WSN will be shortened. While many energy-efficient routing schemes have been proposed for WSNs, they focus on maximizing the WSN lifetime. In this paper, we propose a scheme that satisfies a given 'target' lifetime. Because energy consumption depends on traffic volume, the target lifetime cannot be guaranteed through energy-efficient routing alone. We take an approach that jointly optimizes the sensing rate (i.e., controlling the sensor-traffic generation or duty cycle) and route selection. Satisfying the target lifetime while maximizing the sensing rate is a NP-hard problem. Our scheme is based on a simple Linear Programming (LP) model and clever heuristics are applied to compute a near-optimal result from the LP solution. We prove that the proposed scheme guarantees a 1/2-approximation to the optimal solution in the worst case. The simulation results indicate that the proposed scheme achieves near-optimality in various network configurations.",
author = "Keontaek Lee and Kim, {Hak Jin} and Sunju Park and Seungjae Han",
year = "2014",
month = "6",
day = "2",
doi = "10.1016/j.comnet.2014.03.001",
language = "English",
volume = "65",
pages = "41--55",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",

}

Satisfying the target network lifetime in wireless sensor networks. / Lee, Keontaek; Kim, Hak Jin; Park, Sunju; Han, Seungjae.

In: Computer Networks, Vol. 65, 02.06.2014, p. 41-55.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Satisfying the target network lifetime in wireless sensor networks

AU - Lee, Keontaek

AU - Kim, Hak Jin

AU - Park, Sunju

AU - Han, Seungjae

PY - 2014/6/2

Y1 - 2014/6/2

N2 - Generally, the lifetime of a wireless sensor network (WSN) is defined as the duration until any sensor node dies due to battery exhaustion. If the traffic load is not properly balanced, the batteries of some sensor nodes may be depleted quickly, and the lifetime of the WSN will be shortened. While many energy-efficient routing schemes have been proposed for WSNs, they focus on maximizing the WSN lifetime. In this paper, we propose a scheme that satisfies a given 'target' lifetime. Because energy consumption depends on traffic volume, the target lifetime cannot be guaranteed through energy-efficient routing alone. We take an approach that jointly optimizes the sensing rate (i.e., controlling the sensor-traffic generation or duty cycle) and route selection. Satisfying the target lifetime while maximizing the sensing rate is a NP-hard problem. Our scheme is based on a simple Linear Programming (LP) model and clever heuristics are applied to compute a near-optimal result from the LP solution. We prove that the proposed scheme guarantees a 1/2-approximation to the optimal solution in the worst case. The simulation results indicate that the proposed scheme achieves near-optimality in various network configurations.

AB - Generally, the lifetime of a wireless sensor network (WSN) is defined as the duration until any sensor node dies due to battery exhaustion. If the traffic load is not properly balanced, the batteries of some sensor nodes may be depleted quickly, and the lifetime of the WSN will be shortened. While many energy-efficient routing schemes have been proposed for WSNs, they focus on maximizing the WSN lifetime. In this paper, we propose a scheme that satisfies a given 'target' lifetime. Because energy consumption depends on traffic volume, the target lifetime cannot be guaranteed through energy-efficient routing alone. We take an approach that jointly optimizes the sensing rate (i.e., controlling the sensor-traffic generation or duty cycle) and route selection. Satisfying the target lifetime while maximizing the sensing rate is a NP-hard problem. Our scheme is based on a simple Linear Programming (LP) model and clever heuristics are applied to compute a near-optimal result from the LP solution. We prove that the proposed scheme guarantees a 1/2-approximation to the optimal solution in the worst case. The simulation results indicate that the proposed scheme achieves near-optimality in various network configurations.

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

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

U2 - 10.1016/j.comnet.2014.03.001

DO - 10.1016/j.comnet.2014.03.001

M3 - Article

VL - 65

SP - 41

EP - 55

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

ER -