Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Daniele Diodati"'
Publikováno v:
2022 IEEE International Smart Cities Conference (ISC2).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d30ad9cbc1bd0e50426b229be5a721f
https://doi.org/10.1109/isc255366.2022.9921928
https://doi.org/10.1109/isc255366.2022.9921928
Publikováno v:
Theoretical Computer Science. 596:102-108
In standard sensor network applications, sensors generate raw data that have to be sent to a sink node. In order to save energy, special intermediate storage nodes can be exploited in order to compress data before forwarding them to the sink. We cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8c064c4c739ef1239c0f1e771938641
https://doi.org/10.1016/j.tcs.2015.06.049
https://doi.org/10.1016/j.tcs.2015.06.049
Publikováno v:
SMARTCOMP
We consider the problem of allocating N uniform data to K transmission channels so as the average Expected Delay (AED) is minimized. This problem arises in designing efficient data-diffusion broadcast algorithms in a smart environment. We show that t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2dfd1179078274c7de136e3efe882efa
https://doi.org/10.1109/smartcomp.2016.7501711
https://doi.org/10.1109/smartcomp.2016.7501711
In a sensor network, data might be stored in so-called storage nodes, which receive raw data from other nodes, compress them, and send them toward a sink . We consider the problem of locating $k$ storage nodes in order to minimize the energy consumed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b355ad3b44bd8e0231fa562c3daf7462
http://hdl.handle.net/11391/1383014
http://hdl.handle.net/11391/1383014
Publikováno v:
Experimental Algorithms ISBN: 9783319200859
SEA
SEA
We propose a new variant of the more standard online knapsack problem where the only information missing to the provided instances is the capacity $$B$$ of the knapsack. We refer to this problem as the online Knapsack of Unknown Capacity problem. Any
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::79dc1db5b4a9b26753065f985a705318
https://doi.org/10.1007/978-3-319-20086-6_13
https://doi.org/10.1007/978-3-319-20086-6_13
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 algorit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::644b38d618ce77f44d8000b998478292
http://hdl.handle.net/11585/515663
http://hdl.handle.net/11585/515663
Autor:
Daniele Diodati, Cristina M. Pinotti, Jukka K. Nurminen, Bruno Crispo, Taavi Teemaa, Mauro Conti
Publikováno v:
Conti, M, Crispo, B, Diodati, D, Nurminen, J K, Pinotti, C M & Teemaa, T 2015, ' Leveraging Parallel Communications for Minimizing Energy Consumption on Smartphones ', IEEE Transactions on Parallel and Distributed Systems, vol. 26, pp. 2778-2790 . https://doi.org/10.1109/TPDS.2014.2360693
Recent energy measurements on smartphones have shown that parallel communications (e.g., data transfer and voice call) require less energy than their stand-alone execution. Guided by these results, we investigate the possibility of scheduling communi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dfa8d6a0866222d22631d15ca6ee86ef
http://hdl.handle.net/11577/2965707
http://hdl.handle.net/11577/2965707
Publikováno v:
Algorithms for Sensor Systems ISBN: 9783642453458
ALGOSENSORS
ALGOSENSORS
Sensor networks are widely used to collect data that are required for future information retrieval. Data might be aggregated in a predefined number \(k\) of special nodes in the network, called storage nodes, which, for replying to external queries,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::439356f9458a30e1e147c628bb3c766b
https://doi.org/10.1007/978-3-642-45346-5_10
https://doi.org/10.1007/978-3-642-45346-5_10