Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
We propose an adaptive diffusion strategy with limited communication overhead by cutting off all links but one for each node in the network. We keep the “best” neighbor that has the smallest estimated variance-product measure and ignore the other neighbors. The combination coefficients for the interacting nodes are calculated via a maximal-ratio-combining rule to minimize the steady-state meansquare-deviation. Simulation results illustrate that, with less communication overhead and less computations, the proposed algorithm performs well and outperforms other related methods with similar overheads.
Fabio Nobile, Yoshihito Kazashi, Fabio Zoccolan
Paolo Ricci, Justin Richard Ball, Louis Nicolas Stenger, Rogério Manuel Cabete De Jesus Jorge, Baptiste Jimmy Frei, Antoine Cyril David Hoffmann