Maximum energy welfare routing in wireless sensor networks

Changsoo Ok, Prasenjit Mitra, Seokcheon Lee, Soundar Kumara

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

5 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 sensors on the efficient paths are depleted quickly, and consequently the sensor networks become incapable of monitoring events from some parts of their target areas. In many sensor network applications, the events have uncertainties in positions and generation patterns. Therefore, routing algorithms should be designed to consider not only energy efficiency, but also the amount of energy left in each sensor to avoid sensors running out of power early. This paper introduces a new metric, called Energy-Welfare, devised to consider average and balance of sensors' remaining energies simultaneously. Using this metric, we design the Maximum Energy Welfare Routing algorithm, which achieves energy efficiency and energy balance of sensor networks simultaneously. Moreover, we demonstrate the effectiveness of the proposed routing algorithm by comparing with three existing routing algorithms.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages203-214
Number of pages12
Volume4479 LNCS
Publication statusPublished - 2007
Externally publishedYes
Event6th International IFIP-TC6 Networking Conference on NETWORKING 2007 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet - Atlanta, GA
Duration: 14 May 200718 May 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4479 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other6th International IFIP-TC6 Networking Conference on NETWORKING 2007 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet
CityAtlanta, GA
Period14/5/0718/5/07

Fingerprint

Routing algorithms
Welfare
Routing Algorithm
Sensor networks
Sensor Networks
Wireless Sensor Networks
Wireless sensor networks
Routing
Energy
Sensor
Sensors
Energy Efficiency
Energy efficiency
Metric
Path
Energy Balance
Energy balance
Energy Efficient
Uncertainty
Lifetime

Keywords

  • Distributed algorithm
  • Energy aware routing
  • Energy balance
  • Energy welfare
  • Sensor network
  • Social welfare

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Ok, C., Mitra, P., Lee, S., & Kumara, S. (2007). Maximum energy welfare routing in wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4479 LNCS, pp. 203-214). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4479 LNCS).

Maximum energy welfare routing in wireless sensor networks. / Ok, Changsoo; Mitra, Prasenjit; Lee, Seokcheon; Kumara, Soundar.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4479 LNCS 2007. p. 203-214 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4479 LNCS).

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

Ok, C, Mitra, P, Lee, S & Kumara, S 2007, Maximum energy welfare routing in wireless sensor networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4479 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4479 LNCS, pp. 203-214, 6th International IFIP-TC6 Networking Conference on NETWORKING 2007 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet, Atlanta, GA, 14/5/07.
Ok C, Mitra P, Lee S, Kumara S. Maximum energy welfare routing in wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4479 LNCS. 2007. p. 203-214. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Ok, Changsoo ; Mitra, Prasenjit ; Lee, Seokcheon ; Kumara, Soundar. / Maximum energy welfare routing in wireless sensor networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4479 LNCS 2007. pp. 203-214 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{fce7bcdcfa0b49e5ad5f4a46b208f087,
title = "Maximum energy welfare routing in 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 sensors on the efficient paths are depleted quickly, and consequently the sensor networks become incapable of monitoring events from some parts of their target areas. In many sensor network applications, the events have uncertainties in positions and generation patterns. Therefore, routing algorithms should be designed to consider not only energy efficiency, but also the amount of energy left in each sensor to avoid sensors running out of power early. This paper introduces a new metric, called Energy-Welfare, devised to consider average and balance of sensors' remaining energies simultaneously. Using this metric, we design the Maximum Energy Welfare Routing algorithm, which achieves energy efficiency and energy balance of sensor networks simultaneously. Moreover, we demonstrate the effectiveness of the proposed routing algorithm by comparing with three existing routing algorithms.",
keywords = "Distributed algorithm, Energy aware routing, Energy balance, Energy welfare, Sensor network, Social welfare",
author = "Changsoo Ok and Prasenjit Mitra and Seokcheon Lee and Soundar Kumara",
year = "2007",
language = "English",
isbn = "9783540726050",
volume = "4479 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "203--214",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Maximum energy welfare routing in wireless sensor networks

AU - Ok, Changsoo

AU - Mitra, Prasenjit

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 sensors on the efficient paths are depleted quickly, and consequently the sensor networks become incapable of monitoring events from some parts of their target areas. In many sensor network applications, the events have uncertainties in positions and generation patterns. Therefore, routing algorithms should be designed to consider not only energy efficiency, but also the amount of energy left in each sensor to avoid sensors running out of power early. This paper introduces a new metric, called Energy-Welfare, devised to consider average and balance of sensors' remaining energies simultaneously. Using this metric, we design the Maximum Energy Welfare Routing algorithm, which achieves energy efficiency and energy balance of sensor networks simultaneously. Moreover, we demonstrate the effectiveness of the proposed routing algorithm by comparing with three existing routing algorithms.

AB - Most routing algorithms for sensor networks focus on finding energy efficient paths to prolong the lifetime of sensor networks. As a result, the sensors on the efficient paths are depleted quickly, and consequently the sensor networks become incapable of monitoring events from some parts of their target areas. In many sensor network applications, the events have uncertainties in positions and generation patterns. Therefore, routing algorithms should be designed to consider not only energy efficiency, but also the amount of energy left in each sensor to avoid sensors running out of power early. This paper introduces a new metric, called Energy-Welfare, devised to consider average and balance of sensors' remaining energies simultaneously. Using this metric, we design the Maximum Energy Welfare Routing algorithm, which achieves energy efficiency and energy balance of sensor networks simultaneously. Moreover, we demonstrate the effectiveness of the proposed routing algorithm by comparing with three existing routing algorithms.

KW - Distributed algorithm

KW - Energy aware routing

KW - Energy balance

KW - Energy welfare

KW - Sensor network

KW - Social welfare

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

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

M3 - Conference contribution

SN - 9783540726050

VL - 4479 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 203

EP - 214

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -