Distributed routing in wireless sensor networks using energy welfare metric

Changsoo Ok, Seokcheon Lee, Prasenjit Mitra, Soundar Kumara

Research output: Contribution to journalArticle

52 Citations (Scopus)

Abstract

There are several requirements for a routing algorithm in wireless sensor networks. First, it should achieve both energy-efficiency and energy-balancing together, in order to prolong the lifetime of sensor networks. Second, the algorithm should follow a distributed control scheme so that it is applicable to large-scale networks. Third, it needs to be robust to diverse potential event generation patterns. The routing algorithm, MaxEW, designed in this study satisfies such requirements. It adopts the social welfare function from social sciences to compute energy welfare as a goodness measure for energy populations. When each sensor tries to maximize energy welfare of its local society, it collectively leads to globally efficient energy-balancing. This emergent property consequently supports preparedness and hence robustness to diverse event generation patterns. We demonstrate the effectiveness of the proposed routing algorithm through extensive simulation-based experiments, by comparing with other existing algorithms as well as optimal routing solutions.

Original languageEnglish (US)
Pages (from-to)1656-1670
Number of pages15
JournalInformation Sciences
Volume180
Issue number9
DOIs
StatePublished - May 1 2010

Fingerprint

Routing algorithms
Welfare
Wireless Sensor Networks
Wireless sensor networks
Routing
Routing Algorithm
Metric
Energy
Balancing
Social sciences
Sensor networks
Energy efficiency
Requirements
Distributed Control
Social Sciences
Energy Efficiency
Energy Efficient
Sensor Networks
Lifetime
Maximise

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Cite this

@article{a185c7ebefc8466ab3983454e5528527,
title = "Distributed routing in wireless sensor networks using energy welfare metric",
abstract = "There are several requirements for a routing algorithm in wireless sensor networks. First, it should achieve both energy-efficiency and energy-balancing together, in order to prolong the lifetime of sensor networks. Second, the algorithm should follow a distributed control scheme so that it is applicable to large-scale networks. Third, it needs to be robust to diverse potential event generation patterns. The routing algorithm, MaxEW, designed in this study satisfies such requirements. It adopts the social welfare function from social sciences to compute energy welfare as a goodness measure for energy populations. When each sensor tries to maximize energy welfare of its local society, it collectively leads to globally efficient energy-balancing. This emergent property consequently supports preparedness and hence robustness to diverse event generation patterns. We demonstrate the effectiveness of the proposed routing algorithm through extensive simulation-based experiments, by comparing with other existing algorithms as well as optimal routing solutions.",
author = "Changsoo Ok and Seokcheon Lee and Prasenjit Mitra and Soundar Kumara",
year = "2010",
month = "5",
day = "1",
doi = "10.1016/j.ins.2010.01.019",
language = "English (US)",
volume = "180",
pages = "1656--1670",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",
number = "9",

}

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

In: Information Sciences, Vol. 180, No. 9, 01.05.2010, p. 1656-1670.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Distributed routing in wireless sensor networks using energy welfare metric

AU - Ok, Changsoo

AU - Lee, Seokcheon

AU - Mitra, Prasenjit

AU - Kumara, Soundar

PY - 2010/5/1

Y1 - 2010/5/1

N2 - There are several requirements for a routing algorithm in wireless sensor networks. First, it should achieve both energy-efficiency and energy-balancing together, in order to prolong the lifetime of sensor networks. Second, the algorithm should follow a distributed control scheme so that it is applicable to large-scale networks. Third, it needs to be robust to diverse potential event generation patterns. The routing algorithm, MaxEW, designed in this study satisfies such requirements. It adopts the social welfare function from social sciences to compute energy welfare as a goodness measure for energy populations. When each sensor tries to maximize energy welfare of its local society, it collectively leads to globally efficient energy-balancing. This emergent property consequently supports preparedness and hence robustness to diverse event generation patterns. We demonstrate the effectiveness of the proposed routing algorithm through extensive simulation-based experiments, by comparing with other existing algorithms as well as optimal routing solutions.

AB - There are several requirements for a routing algorithm in wireless sensor networks. First, it should achieve both energy-efficiency and energy-balancing together, in order to prolong the lifetime of sensor networks. Second, the algorithm should follow a distributed control scheme so that it is applicable to large-scale networks. Third, it needs to be robust to diverse potential event generation patterns. The routing algorithm, MaxEW, designed in this study satisfies such requirements. It adopts the social welfare function from social sciences to compute energy welfare as a goodness measure for energy populations. When each sensor tries to maximize energy welfare of its local society, it collectively leads to globally efficient energy-balancing. This emergent property consequently supports preparedness and hence robustness to diverse event generation patterns. We demonstrate the effectiveness of the proposed routing algorithm through extensive simulation-based experiments, by comparing with other existing algorithms as well as optimal routing solutions.

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

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

U2 - 10.1016/j.ins.2010.01.019

DO - 10.1016/j.ins.2010.01.019

M3 - Article

AN - SCOPUS:76349123798

VL - 180

SP - 1656

EP - 1670

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 9

ER -