Gossip-based aggregate computation: computing faster with non address-oblivious schemes
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Latency of opportunistic forwarding in finite regular wireless networks
Proceedings of the fifth international workshop on Foundations of mobile computing
Opportunistic forwarding in wireless networks with duty cycling
Proceedings of the third ACM workshop on Challenged networks
Cluster-based distributed consensus
IEEE Transactions on Wireless Communications
Gossip consensus algorithms via quantized communication
Automatica (Journal of IFAC)
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Probabilistic guarantees for rendezvous under noisy measurements
ACC'09 Proceedings of the 2009 conference on American Control Conference
Brief paper: Discrete-time dynamic average consensus
Automatica (Journal of IFAC)
Distributed averaging in dense wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Comparison of efficient random walk strategies for wireless multi-hop networks
Computer Communications
Brief paper: Quantized consensus in Hamiltonian graphs
Automatica (Journal of IFAC)
Brief paper: Optimal distributed linear averaging
Automatica (Journal of IFAC)
Consensus-based cooperative communications for clustered mobile wireless sensor-actuator networks
International Journal of Mobile Network Design and Innovation
Why rumors spread so quickly in social networks
Communications of the ACM
Automatica (Journal of IFAC)
BLOOGO: BLOOm filter based GOssip algorithm for wireless NDN
Proceedings of the 1st ACM workshop on Emerging Name-Oriented Mobile Networking Design - Architecture, Algorithms, and Applications
Distributed consensus over digital networks with limited bandwidth and time-varying topologies
Automatica (Journal of IFAC)
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
The cost of fault tolerance in multi-party communication complexity
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
On distributed computation of information potentials
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
An Eulerian Approach to the Analysis of Krause's Consensus Models
SIAM Journal on Control and Optimization
Mean Square Performance of Consensus-Based Distributed Estimation over Regular Geometric Graphs
SIAM Journal on Control and Optimization
Gossip Coverage Control for Robotic Networks: Dynamical Systems on the Space of Partitions
SIAM Journal on Control and Optimization
The worst case behavior of randomized gossip
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
On backward product of stochastic matrices
Automatica (Journal of IFAC)
Distributed QR factorization based on randomized algorithms
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Distributed parametric and nonparametric regression with on-line performance bounds computation
Automatica (Journal of IFAC)
An adaptive epidemic information dissemination model for wireless sensor networks
Pervasive and Mobile Computing
Asynchronous rumor spreading in preferential attachment graphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Networked computing in wireless sensor networks for structural health monitoring
IEEE/ACM Transactions on Networking (TON)
Average consensus on general strongly connected digraphs
Automatica (Journal of IFAC)
Decentralized indoor wireless localization using compressed sensing of signal-strength fingerprints
Proceedings of the 7th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Randomized optimal consensus of multi-agent systems
Automatica (Journal of IFAC)
Prioritized gossip in vehicular networks
Ad Hoc Networks
An early-stopping protocol for computing aggregate functions in Sensor Networks
Journal of Parallel and Distributed Computing
Distributed sequential algorithms for regional source localization
Automatica (Journal of IFAC)
Linear coordinate-descent message passing for quadratic optimization
Neural Computation
Fault tolerant decentralised K-Means clustering for asynchronous large-scale networks
Journal of Parallel and Distributed Computing
Experimental analysis of rumor spreading in social networks
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Journal of the ACM (JACM)
Analysis of accelerated gossip algorithms
Automatica (Journal of IFAC)
Cultural polarization and the role of extremist agents: a simple simulation model
SBP'13 Proceedings of the 6th international conference on Social Computing, Behavioral-Cultural Modeling and Prediction
Think globally, act locally: on the reshaping of information landscapes
Proceedings of the 12th international conference on Information processing in sensor networks
Algorithms for determining network robustness
Proceedings of the 2nd ACM international conference on High confidence networked systems
Mitigation of complex behavior over networked systems: Analysis of spatially invariant structures
Automatica (Journal of IFAC)
Multimedia contents dissemination with gossip algorithms in distributed social networks
Proceedings of the Fifth International Conference on Internet Multimedia Computing and Service
Randomized information dissemination in dynamic environments
IEEE/ACM Transactions on Networking (TON)
Compression in wireless sensor networks: A survey and comparative evaluation
ACM Transactions on Sensor Networks (TOSN)
Gossip-Based Self-Organising Agent Societies and the Impact of False Gossip
Minds and Machines
Reprint of "Prioritized gossip in vehicular networks"
Ad Hoc Networks
Randomised broadcasting: Memory vs. randomness
Theoretical Computer Science
Distributed Delay and Sum Beamformer for Speech Enhancement via Randomized Gossip
IEEE/ACM Transactions on Audio, Speech and Language Processing (TASLP)
Hi-index | 754.88 |
Motivated by applications to sensor, peer-to-peer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join and old nodes leave the network. Algorithms for such networks need to be robust against changes in topology. Additionally, nodes in sensor networks operate under limited computational, communication, and energy resources. These constraints have motivated the design of "gossip" algorithms: schemes which distribute the computational burden and in which a node communicates with a randomly chosen neighbor. We analyze the averaging problem under the gossip constraint for an arbitrary network graph, and find that the averaging time of a gossip algorithm depends on the second largest eigenvalue of a doubly stochastic matrix characterizing the algorithm. Designing the fastest gossip algorithm corresponds to minimizing this eigenvalue, which is a semidefinite program (SDP). In general, SDPs cannot be solved in a distributed fashion; however, exploiting problem structure, we propose a distributed subgradient method that solves the optimization problem over the network. The relation of averaging time to the second largest eigenvalue naturally relates it to the mixing time of a random walk with transition probabilities derived from the gossip algorithm. We use this connection to study the performance and scaling of gossip algorithms on two popular networks: Wireless Sensor Networks, which are modeled as Geometric Random Graphs, and the Internet graph under the so-called Preferential Connectivity (PC) model.