New algorithms are presented to optimally place storage nodes in a sensor network consisting of a path so as to minimize the communication cost of convergecasting towards the sink the data gathered into storage nodes in reply to queries. Such algorithms are faster than previously known algorithms and require optimal running time for finding the optimal storage placement.
Bertossi, A.A., Diodati, D., Pinotti, C.M. (2015). Storage Placement in Path Networks. IEEE TRANSACTIONS ON COMPUTERS, 64(4), 1201-1207 [10.1109/TC.2014.2315642].
Storage Placement in Path Networks
BERTOSSI, ALAN ALBERT;
2015
Abstract
New algorithms are presented to optimally place storage nodes in a sensor network consisting of a path so as to minimize the communication cost of convergecasting towards the sink the data gathered into storage nodes in reply to queries. Such algorithms are faster than previously known algorithms and require optimal running time for finding the optimal storage placement.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
