Dynamic Average Diffusion With Randomized Coordinate Updates

Abstract

This work derives and analyzes an online learning strategy for tracking the average of time-varying distributed signals by relying on randomized coordinate-descent updates. During each iteration, each agent selects or observes a random entry of the observation vector, and different agents may select different entries of their observations before engaging in a consultation step. Careful coordination of the interactions among agents is necessary to avoid bias and ensure convergence. We provide a convergence analysis for the proposed methods, and illustrate the results by means of simulations.Index Termsdynamic average diffusion, consensus, pushsum algorithm, coordinate descent, exact diffusion.

Distributed Secondary Control Based on Dynamic Diffusion Algorithm for Current Sharing and Average Voltage Regulation in DC Microgrids

“…Thus, by substituting (4) into (3), a variant of diffusion to track the average of samples, DDA, is obtained as [41]:…”

Selection Square Combining: A Fully-Distributed Radio Source Detector for Fast Fading Channels Based on Energy Measurements

“…Assuming that the nodes communicate only with their neighbors through error-free channels, the spatial average can be computed cooperatively such as in [25], [53], [54]. Consider the following graph which models the sensor network G = (N , E) consisting of a set of nodes N and a set of edges E, where each edge {i, j} ∈ E is an unordered pair of distinct nodes.…”