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

10Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Gil, H. R., Yoo, J., & Lee, J. W. (2003). An on-demand energy-efficient routing algorithm for wireless ad hoc networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2713, 302–311. https://doi.org/10.1007/3-540-45036-x_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free