Gossip Algorithms for Distributed Signal Processing
نویسندگان
چکیده
منابع مشابه
Distributed Signal Processing Algorithms for Wireless Networks
Distributed signal processing algorithms have become a key approach for statistical inference in wireless networks and applications such as wireless sensor networks and smart grids. It is well known that distributed processing techniques deal with the extraction of information from data collected at nodes that are distributed over a geographic area. In this context, for each specific node, a se...
متن کاملAccelerated Gossip Algorithms for Distributed Computation
We introduce a technique for accelerating the gossip algorithm of Boyd et. al. (INFOCOM 2005) for distributed averaging in a network. By employing memory in the form of a small shift-register in the computation at each node, we can speed up the algorithm’s convergence by a factor of 10. Our accelerated algorithm is inspired by the observation that the original gossip algorithm is analogous to t...
متن کاملDistributed Signal Processing Algorithms for the Sensor Broadcast Problem
We consider the design of efficient algorithms for the sensor broadcast problem. In this problem, sensors are deployed on a field, and they collect (correlated) samples of a stochastic process that unfolds over the field—the goal then is for each sensor to broadcast a rate constrained encoding of its sample to every other sensor, so that all nodes are able to form an estimate of the entire fiel...
متن کاملGossip-based distributed stochastic bandit algorithms
The multi-armed bandit problem has attracted remarkable attention in the machine learning community and many efficient algorithms have been proposed to handle the so-called exploitationexploration dilemma in various bandit setups. At the same time, significantly less effort has been devoted to adapting bandit algorithms to particular architectures, such as sensor networks, multi-core machines, ...
متن کاملAsynchronous Gossip-Based Random Projection Algorithms for Fully Distributed Problems
We consider fully distributed constrained convex optimization problems over a network, where each network agent has a distinct objective and constraint set. We discuss a gossipbased random projection algorithm (GRP) with uncoordinated diminishing stepsizes. We prove that, when the problem has a solution, the iterates of all network agents converge to the same optimal point with probability 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the IEEE
سال: 2010
ISSN: 0018-9219,1558-2256
DOI: 10.1109/jproc.2010.2052531