A Distance-based Energy Aware Routing algorithm for wireless sensor networks

Energy efficiency and balancing is one of the primary challenges for wireless sensor networks (WSNs) since the tiny sensor nodes cannot be easily recharged once they are deployed. Up to now, many energy efficient routing algorithms or protocols have been proposed with techniques like clustering, dat...

Full description

Saved in:
Bibliographic Details
Published inSensors (Basel, Switzerland) Vol. 10; no. 10; pp. 9493 - 9511
Main Authors Wang, Jin, Kim, Jeong-Uk, Shu, Lei, Niu, Yu, Lee, Sungyoung
Format Journal Article
LanguageEnglish
Published Switzerland MDPI AG 01.10.2010
Molecular Diversity Preservation International (MDPI)
Subjects
Algorithms
Automatic Data Processing - instrumentation
Automatic Data Processing - methods
Cluster Analysis
Computer Communication Networks
Computer Simulation
Energy consumption
Energy efficiency
Energy-Generating Resources
hop number
hotspot
network lifetime
routing
Sensors
Telemetry - instrumentation
Telemetry - methods
wireless sensor networks
routing
wireless sensor networks
hop number
hotspot
network lifetime
energy efficiency
Online AccessGet full text

Cover

More Information
Summary:Energy efficiency and balancing is one of the primary challenges for wireless sensor networks (WSNs) since the tiny sensor nodes cannot be easily recharged once they are deployed. Up to now, many energy efficient routing algorithms or protocols have been proposed with techniques like clustering, data aggregation and location tracking etc. However, many of them aim to minimize parameters like total energy consumption, latency etc., which cause hotspot nodes and partitioned network due to the overuse of certain nodes. In this paper, a Distance-based Energy Aware Routing (DEAR) algorithm is proposed to ensure energy efficiency and energy balancing based on theoretical analysis of different energy and traffic models. During the routing process, we consider individual distance as the primary parameter in order to adjust and equalize the energy consumption among involved sensors. The residual energy is also considered as a secondary factor. In this way, all the intermediate nodes will consume their energy at similar rate, which maximizes network lifetime. Simulation results show that the DEAR algorithm can reduce and balance the energy consumption for all sensor nodes so network lifetime is greatly prolonged compared to other routing algorithms.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1424-8220
1424-8220
DOI:10.3390/s101009493