An on-demand energy-efficient routing algorithm for wireless ad hoc networks

  • Authors:

  • Hong-Ryeol Gil;Joon Yoo;Jong-Won Lee

  • Affiliations:

  • School of Computer Science & Engineering, Seoul National University, Seoul, Korea;School of Computer Science & Engineering, Seoul National University, Seoul, Korea;School of CS & EE, Handong University, Republic of Korea

  • Venue:
  • HSI'03 Proceedings of the 2nd international conference on Human.society@internet
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Ad hoc networks are non-infrastructure networks which consist of mobile nodes. Since the mobile nodes have limited battery power, it is very important to use energy efficiently in ad hoc networks. In order to maximize the lifetime of ad hoc networks, traffic should be sent via a route that can be avoid nodes with low energy while minimizing the total transmission power. In addition, considering that the nodes of ad hoc networks are mobile, on-demand routing protocols are preferred for ad hoc networks. However, most existing power-aware routing algorithms do not meet these requirements. Although some power-aware routing algorithms try to compromise between two objectives, they have difficulty in implementation into on-demand version. In this paper, we propose a novel on-demand power aware routing algorithm called DEAR. DEAR prolongs its network lifetime by compromising between minimum energy consumption and fair energy consumption without additional control packets. DEAR also improves its data packet delivery ratio.