Distributed energy-adaptive routing for wireless sensor networks

Changsoo Ok, Pransenjit Mitra, Seokcheon Lee, Soundar Kumara

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

10 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 Adaptive Routing (DEAR) algorithm devised to balance the data traffic of sensor networks in a decentralized manner and consequently prolong the lifetime of the networks. DEAR 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
Title of host publicationProceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007
Pages905-910
Number of pages6
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007 - Scottsdale, AZ, United States
Duration: 22 Sep 200725 Sep 2007

Other

Other3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007
CountryUnited States
CityScottsdale, AZ
Period22/9/0725/9/07

Fingerprint

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

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Ok, C., Mitra, P., Lee, S., & Kumara, S. (2007). Distributed energy-adaptive routing for wireless sensor networks. In Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007 (pp. 905-910). [4341766] https://doi.org/10.1109/COASE.2007.4341766

Distributed energy-adaptive routing for wireless sensor networks. / Ok, Changsoo; Mitra, Pransenjit; Lee, Seokcheon; Kumara, Soundar.

Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007. 2007. p. 905-910 4341766.

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

Ok, C, Mitra, P, Lee, S & Kumara, S 2007, Distributed energy-adaptive routing for wireless sensor networks. in Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007., 4341766, pp. 905-910, 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007, Scottsdale, AZ, United States, 22/9/07. https://doi.org/10.1109/COASE.2007.4341766
Ok C, Mitra P, Lee S, Kumara S. Distributed energy-adaptive routing for wireless sensor networks. In Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007. 2007. p. 905-910. 4341766 https://doi.org/10.1109/COASE.2007.4341766
Ok, Changsoo ; Mitra, Pransenjit ; Lee, Seokcheon ; Kumara, Soundar. / Distributed energy-adaptive routing for wireless sensor networks. Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007. 2007. pp. 905-910
@inproceedings{6fc8281b81aa4e2487797836cfa5e788,
title = "Distributed energy-adaptive 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 Adaptive Routing (DEAR) algorithm devised to balance the data traffic of sensor networks in a decentralized manner and consequently prolong the lifetime of the networks. DEAR 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.",
author = "Changsoo Ok and Pransenjit Mitra and Seokcheon Lee and Soundar Kumara",
year = "2007",
doi = "10.1109/COASE.2007.4341766",
language = "English",
isbn = "1424411548",
pages = "905--910",
booktitle = "Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007",

}

TY - GEN

T1 - Distributed energy-adaptive routing for wireless sensor networks

AU - Ok, Changsoo

AU - Mitra, Pransenjit

AU - Lee, Seokcheon

AU - Kumara, Soundar

PY - 2007

Y1 - 2007

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 Adaptive Routing (DEAR) algorithm devised to balance the data traffic of sensor networks in a decentralized manner and consequently prolong the lifetime of the networks. DEAR 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 Adaptive Routing (DEAR) algorithm devised to balance the data traffic of sensor networks in a decentralized manner and consequently prolong the lifetime of the networks. DEAR 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.

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

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

U2 - 10.1109/COASE.2007.4341766

DO - 10.1109/COASE.2007.4341766

M3 - Conference contribution

AN - SCOPUS:44449151201

SN - 1424411548

SN - 9781424411542

SP - 905

EP - 910

BT - Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007

ER -