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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Funken, S., Laue, S., Lotker, Z., Naujoks, R.: Power assignment problems in wireless communication: covering points by disks, reaching few receivers quickly, and energy efficient travelling salesman tours. Elsevier Ad Hoc Networks 8, 1028–1035 (2011)
Yu, C., Lee, B., Yong Youn, H.: Energy efficient routing protocols for mobile ad hoc networks. Wireless Communications and Mobile Computing 3, 959–973 (2003)
Jarry, A., Leone, P., Nikoletseas, S., Rolim, J.: Optimal data gathering paths and energy-balance mechanicms in wireless networks. Elsevier Ad Hoc Networks 9, 1036–2046 (2010)
Mohanoor, A.B., Radhakrishnan, S., Sarangan, V.: Online energy aware routing in wireless networks. Elsevier Ad Hoc Networks 7, 918–931 (2009)
Li, Q., Aslam, J., Rus, D.: Online power-aware routing in wireless ad hoc networks. In: Proceedings of the 7th Annual International Conference on Mobile Computing and Networking (MobiCom), pp. 97–107 (2001)
Wei, X., Chen, G., Wan, Y., Mtenzi, F.: Optimized priority based energy efficient routing algorithm for mobile ad hoc networks. Elsevier Ad Hoc Networks 2 (2004)
Liang, W., Liu, Y.: Online disjoint path routing for network capacity maximization in energy constrained ad hoc networks. Elsevier Ad Hoc Networks 5 (2007)
Miller, M.J., Vaidya, N.H.: Ad hoc Routing for Multiple Power Save Protocols, Pro. Elsevier Ad Hoc Networks 6 (2008)
Rubin, I., Zhang, R.: Robust throughput and routing for mobile ad hoc wireless networks. Elsevier Ad Hoc Networks 7, 265–280 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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: Chatterjee, M., Cao, Jn., Kothapalli, K., Rajsbaum, S. (eds) Distributed Computing and Networking. ICDCN 2014. Lecture Notes in Computer Science, vol 8314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45249-9_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-45249-9_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45248-2
Online ISBN: 978-3-642-45249-9
eBook Packages: Computer ScienceComputer Science (R0)