Energy aware routing with dynamic probability scaling

  • Authors:
  • Geunyoung Park;Sangho Yi;Junyoung Heo;Woong Chul Choi;Gwangil Jeon;Yookun Cho;Charlie Shim

  • Affiliations:
  • Seoul National University;Seoul National University;Seoul National University;KwangWoon University;Korea Polytechnic University;Seoul National University;South Dakota State University

  • Venue:
  • RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The goal of energy aware routing algorithms is to increase the lifetime and long-term connectivity of the wireless sensor networks. However, most of those algorithms do not use the newest states of nodes for retrieving routing information. In this paper, we propose an efficient energy-aware routing algorithm for wireless sensor networks. In our algorithm, the energy drain rate and residual energy of each sensor node are used for selecting candidate routes. Information is retrieved with energy awareness per almost every communication. Simulation results show that our approach outperforms the previous works with respect to long term connectivity by as much as 30%.