Abstract
It is important to provide energy-balanced routing protocols, since a critical limiting factor for a mobile host is its operation time, which is restricted by its battery capacity. We propose a scheme in which each mobile host maintains an energy tree and uses it to evaluate the amount of energy remaining in other mobile hosts. Our proposed algorithm extends the lifetime and upgrades the performance of the system, in that the amount of energy consumed by each mobile host in wireless ad-hoc network is balanced, thereby prolonging the lifetime of those mobile hosts whose energy capacity is limited. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Kim, H. H., Kim, J. H., Kang, Y. H., & Eom, Y. I. (2005). An energy-tree based routing algorithm in wireless ad-hoc network environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3728 LNCS, pp. 156–165). Springer Verlag. https://doi.org/10.1007/11556930_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
