Abstract
Mobile hosts of ad-hoc networks operate on battery, hence optimization of system lifetime, intended as maximization of the time until the first host drains-out its battery, is an important issue. Some routing algorithms have already been proposed, that require the knowledge of the future behavior of the system, and/or complex routing information. We propose a novel routing algorithm that allows each host to locally select the next routing hop, having only immediate neighbor information, to optimize the system lifetime. Simulation results of runs performed in different scenarios are finally shown.
Cite
CITATION STYLE
Clematis, A., D’Agostino, D., & Gianuzzi, V. (2002). A local decision algorithm for maximum lifetime in ad hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2400, pp. 947–956). Springer Verlag. https://doi.org/10.1007/3-540-45706-2_135
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
