We address the problem of computing an optimal schedule for maximizing the average coverage of a wireless sensor network. We show that a time-discretized version of the problem achieves the same optimal solution as one where nodes are allowed to wake up at any arbitrary time.
Aligned Schedules are Optimal / Palopoli, Luigi; Passerone, Roberto. - ELETTRONICO. - (2008), pp. 1-7.
Aligned Schedules are Optimal
Palopoli, Luigi;Passerone, Roberto
2008-01-01
Abstract
We address the problem of computing an optimal schedule for maximizing the average coverage of a wireless sensor network. We show that a time-discretized version of the problem achieves the same optimal solution as one where nodes are allowed to wake up at any arbitrary time.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
DISI-08-044.pdf
accesso aperto
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
169.1 kB
Formato
Adobe PDF
|
169.1 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
