Matrix analysis
Mathematical Programming: Series A and B - Special issue: Festschrift in Honor of Philip Wolfe part II: studies in nonlinear programming
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Scalable Fault-Tolerant Aggregation in Large Process Groups
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Local Divergence of Markov Chains and the Analysis of Iterative Load-Balancing Schemes
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Scalable and Secure Resource Location
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 4 - Volume 4
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Impact of Network Density on Data Aggregation in Wireless Sensor Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
On Certain Connectivity Properties of the Internet Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
SIAM Journal on Optimization
Convex Optimization
A decentralized algorithm for spectral analysis
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Fastest Mixing Markov Chain on a Graph
SIAM Review
The capacity of wireless networks
IEEE Transactions on Information Theory
Hierarchical spatial gossip for multi-resolution representations in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Gossiping in distributed systems
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Compositional gossip: a conceptual architecture for designing gossip-based applications
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Distributed event-region detection in wireless sensor networks
EURASIP Journal on Advances in Signal Processing
Communication constraints in the average consensus problem
Automatica (Journal of IFAC)
On the complexity of asynchronous gossip
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Computing Frequent Elements Using Gossip
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Near-perfect load balancing by randomized rounding
Proceedings of the forty-first annual ACM symposium on Theory of computing
Supporting asynchronous update for distributed data cubes
Journal of Network and Computer Applications
Foundations and Trends® in Networking
Brief announcement: locality-based aggregate computation in wireless sensor networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Agent organized networks redux
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Polynomial filtering for fast convergence in distributed consensus
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Accelerated distributed average consensus via localized node state prediction
IEEE Transactions on Signal Processing
Active wireless sensing: a versatile framework for information retrieval in sensor networks
IEEE Transactions on Signal Processing
Broadcast gossip algorithms for consensus
IEEE Transactions on Signal Processing
IEEE Transactions on Circuits and Systems Part I: Regular Papers
WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
Defensive configuration with game theory
IM'09 Proceedings of the 11th IFIP/IEEE international conference on Symposium on Integrated Network Management
Asynchronous gossip algorithms for stochastic optimization
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Decentralized Aggregation Protocols in Peer-to-Peer Networks: A Survey
MACE '09 Proceedings of the 4th IEEE International Workshop on Modelling Autonomic Communications Environments
ICT'09 Proceedings of the 16th international conference on Telecommunications
Network computing capacity for the reverse butterfly network
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
On quantized consensus by means of gossip algorithm: part i: convergence proof
ACC'09 Proceedings of the 2009 conference on American Control Conference
ACC'09 Proceedings of the 2009 conference on American Control Conference
Load balancing over heterogeneous networks with gossip-based algorithms
ACC'09 Proceedings of the 2009 conference on American Control Conference
Multiagent coverage algorithms with gossip communication: control systems on the space of partitions
ACC'09 Proceedings of the 2009 conference on American Control Conference
ACC'09 Proceedings of the 2009 conference on American Control Conference
On quantized consensus by means of gossip algorithm: part ii: convergence time
ACC'09 Proceedings of the 2009 conference on American Control Conference
On consensus over stochastically switching directed topologies
ACC'09 Proceedings of the 2009 conference on American Control Conference
Power-delay analysis of consensus algorithms on wireless networks with interference
International Journal of Systems, Control and Communications
Distributed throughput maximization in wireless networks via random power allocation
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
A local view management protocol for network-wide view construction in wireless networks
GIIS'09 Proceedings of the Second international conference on Global Information Infrastructure Symposium
Asymptotic optimality of running consensus in testing binary hypotheses
IEEE Transactions on Signal Processing
Fast distributed average consensus algorithms based on advection-diffusion processes
IEEE Transactions on Signal Processing
Estimation of target location via likelihood approximation in sensor networks
IEEE Transactions on Signal Processing
Distributed consensus algorithms in sensor networks: quantized data and random link failures
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
On mixing and edge expansion properties in randomized broadcasting
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Optimization and analysis of distributed averaging with memory
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Reaching consensus in wireless networks with probabilistic broadcast
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Asymptotic analysis of quadratic error of consensus in large-scale random directed networks
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Probabilistic flooding for efficient information dissemination in random graph topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal gossip-based aggregate computation
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Optimization and analysis of distributed averaging with short node memory
IEEE Transactions on Signal Processing
Computing along routes via gossiping
IEEE Transactions on Signal Processing
Distributed averaging via lifted Markov chains
IEEE Transactions on Information Theory
Convergence speed of binary interval consensus
INFOCOM'10 Proceedings of the 29th conference on Information communications
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Exploiting scale invariant dynamics for efficient information propagation in large teams
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Broadcast-based dynamic consensus propagation in wireless sensor networks
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Prioritized gossip in vehicular networks
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Convergence of consensus models with stochastic disturbances
IEEE Transactions on Information Theory
Greedy gossip with eavesdropping
IEEE Transactions on Signal Processing
Weight optimization for consensus algorithms with correlated switching topology
IEEE Transactions on Signal Processing
Decentralized sparse signal recovery for compressive sleeping wireless sensor networks
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Linear-speed interior-path algorithms for distributed control of information networks
Performance Evaluation
Order-optimal consensus through randomized path averaging
IEEE Transactions on Information Theory
Identifying frequent items in a network using gossip
Journal of Parallel and Distributed Computing
An analytical model for multi-epidemic information dissemination
Journal of Parallel and Distributed Computing
Information theoretic bounds for distributed computation over networks of point-to-point channels
IEEE Transactions on Information Theory
Location-aided fast distributed consensus in wireless networks
IEEE Transactions on Information Theory
Consensus-based Page's test in sensor networks
Signal Processing
Efficient broadcasting in random power law networks
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Epidemic-based information dissemination in wireless mobile sensor networks
IEEE/ACM Transactions on Networking (TON)
Hierarchical Spatial Gossip for Multiresolution Representations in Sensor Networks
ACM Transactions on Sensor Networks (TOSN)
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Order optimal information spreading using algebraic gossip
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Research note: On the uniformity of peer sampling based on view shuffling
Journal of Parallel and Distributed Computing
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
A probabilistic mechanism for agent discovery and pairing using domain-specific data
COIN@AAMAS'10 Proceedings of the 6th international conference on Coordination, organizations, institutions, and norms in agent systems
Consensus acceleration in multiagent systems with the Chebyshev semi-iterative method
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
An investigation of the vulnerabilities of scale invariant dynamics in large teams
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
ChurnDetect: a gossip-based churn estimator for large-scale dynamic networks
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
Analysis of latency of stateless opportunistic forwarding in intermittently connected networks
IEEE/ACM Transactions on Networking (TON)
Brief paper: A majorization inequality and its application to distributed Kalman filtering
Automatica (Journal of IFAC)
Rumor spreading and vertex expansion
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Ultra-fast rumor spreading in social networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Randomised broadcasting: memory vs. randomness
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Fast information spreading in graphs with large weak conductance
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Rumor spreading and vertex expansion on regular graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Robust distributed orthogonalization based on randomized aggregation
Proceedings of the second workshop on Scalable algorithms for large-scale systems
Distributed stochastic approximation for constrained and unconstrained optimization
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Low-Cost Identifiers for Ubiquitous Computing
Wireless Personal Communications: An International Journal
Fast decentralized averaging via multi-scale gossip
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Fault-Tolerant aggregation: flow-updating meets mass-distribution
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Analysis of gossip-based information propagation in wireless mesh networks
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
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
Survey: Streaming techniques and data aggregation in networks of tiny artefacts
Computer Science Review
LossEstimate: Distributed failure estimation in wireless networks
Journal of Systems and Software
Distributed online flash-crowd detection in P2P swarming systems
Computer Communications
Hi-index | 0.36 |
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.