Max-min-path energy-efficient routing algorithm - A novel approach to enhance network lifetime of MANETs

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

Abstract

Power-aware routing in wireless ad-hoc networks has to typically compensate with the utilization of energy consumed during communication. Most of the energy efficient routing algorithms try to improve the network lifetime but it lacks to guarantee the life time of individual nodes in the network. A novel and an optimal routing protocol Max-Min-Path (MMP) have been proposed that guarantee to maximize the network lifetime which is NP-hard problem. This routing strategy remains sustainable even in a non-monotonic sequence of the energy path cost and the residual energy of the individual nodes and, thereby enhancing the network lifetime with low computational complexity. A classical relationship between the total energy path and the residual energy of individual nodes has been proved. The simulation results prove that the proposed work outperforms the existing energy-efficient routing algorithms by evaluating the energy-aware performance metrics. © 2014 Springer-Verlag.

Cite

CITATION STYLE

APA

Ponnuswamy, V., Anand John Francis, S., & Dinakaran, J. A. (2014). Max-min-path energy-efficient routing algorithm - A novel approach to enhance network lifetime of MANETs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8314 LNCS, pp. 512–518). https://doi.org/10.1007/978-3-642-45249-9_35

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