Multiscale Gossip for Efficient Decentralized Averaging in Wireless Packet Networks

This paper describes and analyzes a hierarchical gossip algorithm for solving the distributed average consensus problem in wireless sensor networks. The network is recursively partitioned into subnetworks. Initially, nodes at the finest scale gossip to compute local averages. Then, using geographic routing to enable gossip between nodes that are not directly connected, these local averages are progressively fused up the hierarchy until the global average is computed. We show that the proposed hierarchical scheme with $k$ levels of hierarchy is competitive with state-of-the-art randomized gossip algorithms, in terms of message complexity, achieving $\epsilon$-accuracy with high probability after $O\big(n \log \log n \log \frac{kn}{\epsilon} \big)$ messages. Key to our analysis is the way in which the network is recursively partitioned. We find that the optimal scaling law is achieved when subnetworks at scale $j$ contain $O(n^{(2/3)^j})$ nodes; then the message complexity at any individual scale is $O(n \log \frac{kn}{\epsilon})$, and the total number of scales in the hierarchy grows slowly, as $\Theta(\log \log n)$. Another important consequence of hierarchical construction is that the longest distance over which messages are exchanged is $O(n^{1/3})$ hops (at the highest scale), and most messages (at lower scales) travel shorter distances. In networks that use link-level acknowledgements, this results in less congestion and resource usage by reducing message retransmissions. Simulations illustrate that the proposed scheme is more message-efficient than existing state-of-the-art randomized gossip algorithms based on averaging along paths.

💡 Research Summary

The paper tackles the classic distributed average‑consensus problem in wireless sensor networks (WSNs) by introducing a hierarchical gossip protocol called Multiscale Gossip. The authors observe that conventional randomized gossip algorithms, while simple, suffer from two major drawbacks in wireless settings: (1) the total number of exchanged messages grows quickly with network size, and (2) many messages must travel long distances, leading to high collision probability, retransmissions, and excessive energy consumption. To mitigate these issues, the authors propose a recursive partitioning of the network into a hierarchy of subnetworks (or “scales”).

At the lowest scale (scale 0) the network is divided into many small clusters, each containing roughly (O\big(n^{(2/3)^0}\big)=O(n^{2/3})) nodes. Within each cluster, standard pairwise gossip is performed until a local average is obtained. The size of a cluster at scale (j) is chosen to be (O\big(n^{(2/3)^j}\big)); consequently the number of clusters shrinks dramatically as we move up the hierarchy. After the local averages are computed, the algorithm uses geographic routing—a lightweight, stateless routing scheme that exploits node position information—to exchange these averages between clusters that are not directly connected. This “long‑range” gossip is applied only at higher scales, where the clusters are larger but far fewer in number. The process repeats: at each scale the cluster averages are fused, and the result is passed to the next higher scale, until the topmost level (scale (k-1)) computes the global average.

The authors provide a rigorous probabilistic analysis of the algorithm’s convergence and communication cost. They prove that, with high probability (i.e., probability at least (1-O(1/n))), the algorithm reaches an (\epsilon)-accurate estimate of the global average after
\