Distributed energy balanced routing for wireless sensor networks

Chang Soo Ok, Seokcheon Lee, Prasenjit Mitra, Soundar Kumara

Research output: Contribution to journalArticle

102 Citations (Scopus)

Abstract

Most routing algorithms for sensor networks focus on finding energy efficient paths to prolong the lifetime of sensor networks. As a result, the power of sensors on efficient paths depletes quickly, and consequently sensor networks become incapable of monitoring events from some parts of their target areas. In many sensor network applications, the events that must be tracked occur at random locations and have non-deterministic generation patterns. Therefore, ideally, routing algorithms should consider not only energy efficiency, but also the amount of energy remaining in each sensor, thus avoiding non-functioning sensors due to early power depletion. This paper introduces a new metric, energy cost, devised to consider a balance of sensors' remaining energies, as well as energy efficiency. This metric gives rise to the design of the distributed energy balanced routing (DEBR) algorithm devised to balance the data traffic of sensor networks in a decentralized manner and consequently prolong the lifetime of the networks. DEBR is scalable in the number of sensors and also robust to the variations in the dynamics of event generation. We demonstrate the effectiveness of the proposed algorithm by comparing three existing routing algorithms: direct communication approach, minimum transmission energy, and self-organized routing and find that energy balance should be considered to extend lifetime of sensor network and increase robustness of sensor network for diverse event generation patterns.

Original languageEnglish
Pages (from-to)125-135
Number of pages11
JournalComputers and Industrial Engineering
Volume57
Issue number1
DOIs
Publication statusPublished - Aug 2009
Externally publishedYes

Fingerprint

Sensor networks
Wireless sensor networks
Routing algorithms
Sensors
Energy efficiency
Energy balance
Monitoring
Communication
Costs

Keywords

  • Distributed control
  • Energy adaptive routing
  • Energy balancing
  • Robustness
  • Wireless sensor network

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

Distributed energy balanced routing for wireless sensor networks. / Ok, Chang Soo; Lee, Seokcheon; Mitra, Prasenjit; Kumara, Soundar.

In: Computers and Industrial Engineering, Vol. 57, No. 1, 08.2009, p. 125-135.

Research output: Contribution to journalArticle

Ok, Chang Soo ; Lee, Seokcheon ; Mitra, Prasenjit ; Kumara, Soundar. / Distributed energy balanced routing for wireless sensor networks. In: Computers and Industrial Engineering. 2009 ; Vol. 57, No. 1. pp. 125-135.
@article{6140f547d6f74f57b09bb99b8f5b6537,
title = "Distributed energy balanced routing for wireless sensor networks",
abstract = "Most routing algorithms for sensor networks focus on finding energy efficient paths to prolong the lifetime of sensor networks. As a result, the power of sensors on efficient paths depletes quickly, and consequently sensor networks become incapable of monitoring events from some parts of their target areas. In many sensor network applications, the events that must be tracked occur at random locations and have non-deterministic generation patterns. Therefore, ideally, routing algorithms should consider not only energy efficiency, but also the amount of energy remaining in each sensor, thus avoiding non-functioning sensors due to early power depletion. This paper introduces a new metric, energy cost, devised to consider a balance of sensors' remaining energies, as well as energy efficiency. This metric gives rise to the design of the distributed energy balanced routing (DEBR) algorithm devised to balance the data traffic of sensor networks in a decentralized manner and consequently prolong the lifetime of the networks. DEBR is scalable in the number of sensors and also robust to the variations in the dynamics of event generation. We demonstrate the effectiveness of the proposed algorithm by comparing three existing routing algorithms: direct communication approach, minimum transmission energy, and self-organized routing and find that energy balance should be considered to extend lifetime of sensor network and increase robustness of sensor network for diverse event generation patterns.",
keywords = "Distributed control, Energy adaptive routing, Energy balancing, Robustness, Wireless sensor network",
author = "Ok, {Chang Soo} and Seokcheon Lee and Prasenjit Mitra and Soundar Kumara",
year = "2009",
month = "8",
doi = "10.1016/j.cie.2009.01.013",
language = "English",
volume = "57",
pages = "125--135",
journal = "Computers and Industrial Engineering",
issn = "0360-8352",
publisher = "Elsevier Limited",
number = "1",

}

TY - JOUR

T1 - Distributed energy balanced routing for wireless sensor networks

AU - Ok, Chang Soo

AU - Lee, Seokcheon

AU - Mitra, Prasenjit

AU - Kumara, Soundar

PY - 2009/8

Y1 - 2009/8

N2 - Most routing algorithms for sensor networks focus on finding energy efficient paths to prolong the lifetime of sensor networks. As a result, the power of sensors on efficient paths depletes quickly, and consequently sensor networks become incapable of monitoring events from some parts of their target areas. In many sensor network applications, the events that must be tracked occur at random locations and have non-deterministic generation patterns. Therefore, ideally, routing algorithms should consider not only energy efficiency, but also the amount of energy remaining in each sensor, thus avoiding non-functioning sensors due to early power depletion. This paper introduces a new metric, energy cost, devised to consider a balance of sensors' remaining energies, as well as energy efficiency. This metric gives rise to the design of the distributed energy balanced routing (DEBR) algorithm devised to balance the data traffic of sensor networks in a decentralized manner and consequently prolong the lifetime of the networks. DEBR is scalable in the number of sensors and also robust to the variations in the dynamics of event generation. We demonstrate the effectiveness of the proposed algorithm by comparing three existing routing algorithms: direct communication approach, minimum transmission energy, and self-organized routing and find that energy balance should be considered to extend lifetime of sensor network and increase robustness of sensor network for diverse event generation patterns.

AB - Most routing algorithms for sensor networks focus on finding energy efficient paths to prolong the lifetime of sensor networks. As a result, the power of sensors on efficient paths depletes quickly, and consequently sensor networks become incapable of monitoring events from some parts of their target areas. In many sensor network applications, the events that must be tracked occur at random locations and have non-deterministic generation patterns. Therefore, ideally, routing algorithms should consider not only energy efficiency, but also the amount of energy remaining in each sensor, thus avoiding non-functioning sensors due to early power depletion. This paper introduces a new metric, energy cost, devised to consider a balance of sensors' remaining energies, as well as energy efficiency. This metric gives rise to the design of the distributed energy balanced routing (DEBR) algorithm devised to balance the data traffic of sensor networks in a decentralized manner and consequently prolong the lifetime of the networks. DEBR is scalable in the number of sensors and also robust to the variations in the dynamics of event generation. We demonstrate the effectiveness of the proposed algorithm by comparing three existing routing algorithms: direct communication approach, minimum transmission energy, and self-organized routing and find that energy balance should be considered to extend lifetime of sensor network and increase robustness of sensor network for diverse event generation patterns.

KW - Distributed control

KW - Energy adaptive routing

KW - Energy balancing

KW - Robustness

KW - Wireless sensor network

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

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

U2 - 10.1016/j.cie.2009.01.013

DO - 10.1016/j.cie.2009.01.013

M3 - Article

VL - 57

SP - 125

EP - 135

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

SN - 0360-8352

IS - 1

ER -