e3D: An energy-efficient routing algorithm for wireless sensor networks

Ioan Raicu, Loren Schwiebert, Scott Fowler, Sandeep Gupta

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

7 Citations (Scopus)

Abstract

One of the limitations of wireless sensor nodes is their inherent limited energy resource. Besides maximizing the lifetime of the sensor node, it is preferable to distribute the energy dissipated throughout the wireless sensor network in order to minimise maintenance and maximize overall system performance. Any communication protocol that involves synchronization of peer nodes incurs some overhead for setting up the communication. We introduce a new algorithm, e3D (energy-efficient Distributed Dynamic Diffusion routing algorithm), and compare it to two other algorithms, namely directed, and random clustering communication. We take into account the setup costs and analyze the energy-efficiency and the useful lifetime of the system. In order to better understand the characteristics of each algorithm and how well e3D really performs, we also compare e3D with its optimum counterpart and an optimum clustering algorithm. The benefit of introducing these ideal algorithms is to show the upper bound on performance at the cost of an astronomical prohibitive synchronization costs. We compare the algorithms in terms of system lifetime, power dissipation distribution, cost of synchronisation, and simplicity of the algorithm. Our simulation results show that e3D performs comparable to its optimal counterpart while having significantly less overhead.

Original languageEnglish (US)
Title of host publicationProceedings of the 2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, ISSNIP '04
EditorsM. Palaniswami, B. Krishnamachari, A. Sowmya, S. Challa, M. Palaniswami, B. Krishnamachari, A. Sowmya, S. Challa
Pages25-30
Number of pages6
StatePublished - 2004
Event2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, ISSNIP '04 - Melbourne, Australia
Duration: Dec 14 2004Dec 17 2004

Other

Other2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, ISSNIP '04
CountryAustralia
CityMelbourne
Period12/14/0412/17/04

Fingerprint

Routing algorithms
Wireless sensor networks
Synchronization
Sensor nodes
Costs
Communication
Energy resources
Clustering algorithms
Energy efficiency
Energy dissipation
Network protocols

Keywords

  • Clustering
  • Diffusion
  • e3D
  • Energy-efficient
  • Routing algorithm
  • Simulations
  • Wireless sensor networks

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Raicu, I., Schwiebert, L., Fowler, S., & Gupta, S. (2004). e3D: An energy-efficient routing algorithm for wireless sensor networks. In M. Palaniswami, B. Krishnamachari, A. Sowmya, S. Challa, M. Palaniswami, B. Krishnamachari, A. Sowmya, ... S. Challa (Eds.), Proceedings of the 2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, ISSNIP '04 (pp. 25-30)

e3D : An energy-efficient routing algorithm for wireless sensor networks. / Raicu, Ioan; Schwiebert, Loren; Fowler, Scott; Gupta, Sandeep.

Proceedings of the 2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, ISSNIP '04. ed. / M. Palaniswami; B. Krishnamachari; A. Sowmya; S. Challa; M. Palaniswami; B. Krishnamachari; A. Sowmya; S. Challa. 2004. p. 25-30.

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

Raicu, I, Schwiebert, L, Fowler, S & Gupta, S 2004, e3D: An energy-efficient routing algorithm for wireless sensor networks. in M Palaniswami, B Krishnamachari, A Sowmya, S Challa, M Palaniswami, B Krishnamachari, A Sowmya & S Challa (eds), Proceedings of the 2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, ISSNIP '04. pp. 25-30, 2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, ISSNIP '04, Melbourne, Australia, 12/14/04.
Raicu I, Schwiebert L, Fowler S, Gupta S. e3D: An energy-efficient routing algorithm for wireless sensor networks. In Palaniswami M, Krishnamachari B, Sowmya A, Challa S, Palaniswami M, Krishnamachari B, Sowmya A, Challa S, editors, Proceedings of the 2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, ISSNIP '04. 2004. p. 25-30
Raicu, Ioan ; Schwiebert, Loren ; Fowler, Scott ; Gupta, Sandeep. / e3D : An energy-efficient routing algorithm for wireless sensor networks. Proceedings of the 2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, ISSNIP '04. editor / M. Palaniswami ; B. Krishnamachari ; A. Sowmya ; S. Challa ; M. Palaniswami ; B. Krishnamachari ; A. Sowmya ; S. Challa. 2004. pp. 25-30
@inproceedings{b8f9656ceb1a4bd68fe044e51102cd53,
title = "e3D: An energy-efficient routing algorithm for wireless sensor networks",
abstract = "One of the limitations of wireless sensor nodes is their inherent limited energy resource. Besides maximizing the lifetime of the sensor node, it is preferable to distribute the energy dissipated throughout the wireless sensor network in order to minimise maintenance and maximize overall system performance. Any communication protocol that involves synchronization of peer nodes incurs some overhead for setting up the communication. We introduce a new algorithm, e3D (energy-efficient Distributed Dynamic Diffusion routing algorithm), and compare it to two other algorithms, namely directed, and random clustering communication. We take into account the setup costs and analyze the energy-efficiency and the useful lifetime of the system. In order to better understand the characteristics of each algorithm and how well e3D really performs, we also compare e3D with its optimum counterpart and an optimum clustering algorithm. The benefit of introducing these ideal algorithms is to show the upper bound on performance at the cost of an astronomical prohibitive synchronization costs. We compare the algorithms in terms of system lifetime, power dissipation distribution, cost of synchronisation, and simplicity of the algorithm. Our simulation results show that e3D performs comparable to its optimal counterpart while having significantly less overhead.",
keywords = "Clustering, Diffusion, e3D, Energy-efficient, Routing algorithm, Simulations, Wireless sensor networks",
author = "Ioan Raicu and Loren Schwiebert and Scott Fowler and Sandeep Gupta",
year = "2004",
language = "English (US)",
isbn = "0780388933",
pages = "25--30",
editor = "M. Palaniswami and B. Krishnamachari and A. Sowmya and S. Challa and M. Palaniswami and B. Krishnamachari and A. Sowmya and S. Challa",
booktitle = "Proceedings of the 2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, ISSNIP '04",

}

TY - GEN

T1 - e3D

T2 - An energy-efficient routing algorithm for wireless sensor networks

AU - Raicu, Ioan

AU - Schwiebert, Loren

AU - Fowler, Scott

AU - Gupta, Sandeep

PY - 2004

Y1 - 2004

N2 - One of the limitations of wireless sensor nodes is their inherent limited energy resource. Besides maximizing the lifetime of the sensor node, it is preferable to distribute the energy dissipated throughout the wireless sensor network in order to minimise maintenance and maximize overall system performance. Any communication protocol that involves synchronization of peer nodes incurs some overhead for setting up the communication. We introduce a new algorithm, e3D (energy-efficient Distributed Dynamic Diffusion routing algorithm), and compare it to two other algorithms, namely directed, and random clustering communication. We take into account the setup costs and analyze the energy-efficiency and the useful lifetime of the system. In order to better understand the characteristics of each algorithm and how well e3D really performs, we also compare e3D with its optimum counterpart and an optimum clustering algorithm. The benefit of introducing these ideal algorithms is to show the upper bound on performance at the cost of an astronomical prohibitive synchronization costs. We compare the algorithms in terms of system lifetime, power dissipation distribution, cost of synchronisation, and simplicity of the algorithm. Our simulation results show that e3D performs comparable to its optimal counterpart while having significantly less overhead.

AB - One of the limitations of wireless sensor nodes is their inherent limited energy resource. Besides maximizing the lifetime of the sensor node, it is preferable to distribute the energy dissipated throughout the wireless sensor network in order to minimise maintenance and maximize overall system performance. Any communication protocol that involves synchronization of peer nodes incurs some overhead for setting up the communication. We introduce a new algorithm, e3D (energy-efficient Distributed Dynamic Diffusion routing algorithm), and compare it to two other algorithms, namely directed, and random clustering communication. We take into account the setup costs and analyze the energy-efficiency and the useful lifetime of the system. In order to better understand the characteristics of each algorithm and how well e3D really performs, we also compare e3D with its optimum counterpart and an optimum clustering algorithm. The benefit of introducing these ideal algorithms is to show the upper bound on performance at the cost of an astronomical prohibitive synchronization costs. We compare the algorithms in terms of system lifetime, power dissipation distribution, cost of synchronisation, and simplicity of the algorithm. Our simulation results show that e3D performs comparable to its optimal counterpart while having significantly less overhead.

KW - Clustering

KW - Diffusion

KW - e3D

KW - Energy-efficient

KW - Routing algorithm

KW - Simulations

KW - Wireless sensor networks

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

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

M3 - Conference contribution

AN - SCOPUS:28844474968

SN - 0780388933

SN - 9780780388932

SP - 25

EP - 30

BT - Proceedings of the 2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, ISSNIP '04

A2 - Palaniswami, M.

A2 - Krishnamachari, B.

A2 - Sowmya, A.

A2 - Challa, S.

A2 - Palaniswami, M.

A2 - Krishnamachari, B.

A2 - Sowmya, A.

A2 - Challa, S.

ER -