scispace - formally typeset
D

Daniele Munaretto

Researcher at University of Padua

Publications -  62
Citations -  1255

Daniele Munaretto is an academic researcher from University of Padua. The author has contributed to research in topics: Network packet & Cellular network. The author has an hindex of 18, co-authored 59 publications receiving 1166 citations. Previous affiliations of Daniele Munaretto include NTT DoCoMo.

Papers
More filters
Proceedings ArticleDOI

On the interplay between routing and signal representation for Compressive Sensing in wireless sensor networks

TL;DR: This work addresses the data gathering problem in WSNs, where routing is used in conjunction with CS to transport random projections of the data, and considers a number of popular transformations and finds that none of them are able to sparsify the data while being at the same time incoherent with respect to the routing matrix.
Proceedings ArticleDOI

Effective Delay Control in Online Network Coding

TL;DR: This work re-define the encoding rules in order to break the chains of linear combinations that cannot be decoded after one of the packets is lost and shows that sending uncoded packets at key times ensures that all the receivers are able to meet specific delay requirements with very high probability.
Proceedings ArticleDOI

Data Acquisition through Joint Compressive Sensing and Principal Component Analysis

TL;DR: The approach dynamically adapts to non-stationary real world signals through the online estimation of their correlation properties in space and time and can be readily applied to other types of network infrastructures that require the online approximation of large and distributed data sets.
Journal ArticleDOI

Multi-Access Edge Computing: The Driver Behind the Wheel of 5G-Connected Cars

TL;DR: In this paper, the authors highlight the automotive use cases that are relevant for MEC, providing insights into the technologies specified and investigated by the ETSI Industry Specification Group MEC.
Proceedings ArticleDOI

Informed network coding for minimum decoding delay

TL;DR: This work considers several algorithms that minimize the decoding delay and shows that a greedy algorithm, whose encodings maximize the number of nodes at which a coded packet is immediately decodable significantly outperforms existing network coding protocols.