Maximum energy welfare routing in wireless sensor networks

  • Authors:
  • Changsoo Ok;Prasenjit Mitra;Seokcheon Lee;Soundar Kumara

  • Affiliations:
  • The Department of Industrial Engineering, The Pennsylvania State University, University Park, PA;College of Information Sciences and Technology, The Pennsylvania State University, University Park, PA;The School of Industrial Engineering, Purdue University, West Lafayette, IN;The Department of Industrial Engineering, The Pennsylvania State University, University Park, PA

  • Venue:
  • NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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.