Version Age of Information in Clustered Gossip Networks
Baturalp Buyukates, Melih Bastopcu, Sennur Ulukus

TL;DR
This paper analyzes how the age of information metric scales in clustered gossip networks with various topologies, showing how increased connectivity and hierarchy can improve information freshness as network size grows.
Contribution
It provides a comprehensive characterization of version age scaling laws in clustered gossip networks with different topologies and hierarchical structures, introducing new bounds and hierarchical strategies.
Findings
Disconnection, ring, and full connectivity achieve different age scalings: O(√n), O(n^{1/3}), and O(log n).
Adding gossip among cluster heads improves age scaling to O(n^{1/3}), O(n^{1/4}), and O(log n).
Hierarchical structures can achieve age scaling of O(n^{1/(2h)}) with h levels, without dedicated cluster heads.
Abstract
We consider a network consisting of a single source and receiver nodes that are grouped into equal-sized clusters. We use cluster heads in each cluster to facilitate communication between the source and the nodes within that cluster. Inside clusters, nodes are connected to each other according to a given network topology. Based on the connectivity among the nodes, each node relays its current stored version of the source update to its neighboring nodes by . We use the metric to assess information freshness at the nodes. We consider disconnected, ring, and fully connected network topologies for each cluster. For each network topology, we characterize the average version age at each node and find the average version age scaling as a function of the network size . Our results indicate that per node average version age scalings of ,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAge of Information Optimization · Dementia and Cognitive Impairment Research · Opportunistic and Delay-Tolerant Networks
