A myopic mobile sink migration strategy for maximizing lifetime of wireless sensor networks

Keontaek Lee, Young Hun Kim, Hak Jin Kim, Seungjae Han

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

Network lifetime maximization is challenging particularly for large-scale wireless sensor networks. The sensor nodes near the sink node tend to suffer high energy consumption due to heavy traffic relay operations, becoming vulnerable to energy depletion. The rationale of the sink mobility approach is that as the sink node moves around, such risk of energy depletion at some nodes can be alleviated. In this paper, we first obtain the optimal mobile sink sojourning pattern by solving a linear programming model and then we mathematically analyze why the optimal solution exhibits such sojourning pattern. We use the insights from this analysis to design a simple practical heuristic algorithm for sink mobility, which utilizes only local information. Our heuristic is very different from the existing algorithms which often use the traffic volume as the main decision factor, in that we consider the variance of residual energy of neighboring sensor nodes. The simulation results show that our scheme achieves near-optimal network lifetime even with the relatively low moving speed of the mobile sink.

Original languageEnglish
Pages (from-to)313-318
Number of pages6
JournalWireless Networks
Volume20
Issue number2
DOIs
Publication statusPublished - 2014 Feb 1

Fingerprint

Sensor nodes
Wireless sensor networks
Heuristic algorithms
Linear programming
Energy utilization

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{49863ae226484969817727926501e7d3,
title = "A myopic mobile sink migration strategy for maximizing lifetime of wireless sensor networks",
abstract = "Network lifetime maximization is challenging particularly for large-scale wireless sensor networks. The sensor nodes near the sink node tend to suffer high energy consumption due to heavy traffic relay operations, becoming vulnerable to energy depletion. The rationale of the sink mobility approach is that as the sink node moves around, such risk of energy depletion at some nodes can be alleviated. In this paper, we first obtain the optimal mobile sink sojourning pattern by solving a linear programming model and then we mathematically analyze why the optimal solution exhibits such sojourning pattern. We use the insights from this analysis to design a simple practical heuristic algorithm for sink mobility, which utilizes only local information. Our heuristic is very different from the existing algorithms which often use the traffic volume as the main decision factor, in that we consider the variance of residual energy of neighboring sensor nodes. The simulation results show that our scheme achieves near-optimal network lifetime even with the relatively low moving speed of the mobile sink.",
author = "Keontaek Lee and Kim, {Young Hun} and Kim, {Hak Jin} and Seungjae Han",
year = "2014",
month = "2",
day = "1",
doi = "10.1007/s11276-013-0606-9",
language = "English",
volume = "20",
pages = "313--318",
journal = "Wireless Networks",
issn = "1022-0038",
publisher = "Springer Netherlands",
number = "2",

}

A myopic mobile sink migration strategy for maximizing lifetime of wireless sensor networks. / Lee, Keontaek; Kim, Young Hun; Kim, Hak Jin; Han, Seungjae.

In: Wireless Networks, Vol. 20, No. 2, 01.02.2014, p. 313-318.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A myopic mobile sink migration strategy for maximizing lifetime of wireless sensor networks

AU - Lee, Keontaek

AU - Kim, Young Hun

AU - Kim, Hak Jin

AU - Han, Seungjae

PY - 2014/2/1

Y1 - 2014/2/1

N2 - Network lifetime maximization is challenging particularly for large-scale wireless sensor networks. The sensor nodes near the sink node tend to suffer high energy consumption due to heavy traffic relay operations, becoming vulnerable to energy depletion. The rationale of the sink mobility approach is that as the sink node moves around, such risk of energy depletion at some nodes can be alleviated. In this paper, we first obtain the optimal mobile sink sojourning pattern by solving a linear programming model and then we mathematically analyze why the optimal solution exhibits such sojourning pattern. We use the insights from this analysis to design a simple practical heuristic algorithm for sink mobility, which utilizes only local information. Our heuristic is very different from the existing algorithms which often use the traffic volume as the main decision factor, in that we consider the variance of residual energy of neighboring sensor nodes. The simulation results show that our scheme achieves near-optimal network lifetime even with the relatively low moving speed of the mobile sink.

AB - Network lifetime maximization is challenging particularly for large-scale wireless sensor networks. The sensor nodes near the sink node tend to suffer high energy consumption due to heavy traffic relay operations, becoming vulnerable to energy depletion. The rationale of the sink mobility approach is that as the sink node moves around, such risk of energy depletion at some nodes can be alleviated. In this paper, we first obtain the optimal mobile sink sojourning pattern by solving a linear programming model and then we mathematically analyze why the optimal solution exhibits such sojourning pattern. We use the insights from this analysis to design a simple practical heuristic algorithm for sink mobility, which utilizes only local information. Our heuristic is very different from the existing algorithms which often use the traffic volume as the main decision factor, in that we consider the variance of residual energy of neighboring sensor nodes. The simulation results show that our scheme achieves near-optimal network lifetime even with the relatively low moving speed of the mobile sink.

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

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

U2 - 10.1007/s11276-013-0606-9

DO - 10.1007/s11276-013-0606-9

M3 - Article

VL - 20

SP - 313

EP - 318

JO - Wireless Networks

JF - Wireless Networks

SN - 1022-0038

IS - 2

ER -