In this paper we propose an adaptive random walk for wireless networks. The lifetime of the walk is varied in such a way that at least a given fraction of nodes is covered, in expectation. The only parameter of the random walk, a, depends on the nominal network size N and on the required coverage. For sizes lower than N the required coverage is satisfied with lifetime slightly higher than the optimal one. The paper reports performance results obtained through analytical study backed up with simulations.
An Adapting Random Walk for Ad hoc and Sensor Networks / Adnan Noor, Mian; Baldoni, Roberto; Beraldi, Roberto. - (2009), pp. 153-157. (Intervento presentato al convegno 29th IEEE International Conference on Distributed Computing Systems tenutosi a Montreal; Canada nel JUN 22-26, 2009) [10.1109/icdcsw.2009.81].
An Adapting Random Walk for Ad hoc and Sensor Networks
BALDONI, Roberto;BERALDI, ROBERTO
2009
Abstract
In this paper we propose an adaptive random walk for wireless networks. The lifetime of the walk is varied in such a way that at least a given fraction of nodes is covered, in expectation. The only parameter of the random walk, a, depends on the nominal network size N and on the required coverage. For sizes lower than N the required coverage is satisfied with lifetime slightly higher than the optimal one. The paper reports performance results obtained through analytical study backed up with simulations.| File | Dimensione | Formato | |
|---|---|---|---|
|
VE_2009_11573-212261.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
174.77 kB
Formato
Adobe PDF
|
174.77 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
