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.
A Local Decision Algorithm for Maximum Lifetime in Ad Hoc Networks
D. D'Agostino;GIANUZZI, VITTORIA
2002-01-01
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
