Version Age of Information in Clustered Gossip Networks

09/17/2021
by   Baturalp Buyukates, et al.
0

We consider a network consisting of a single source and n 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 local gossiping. We use the version age 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 n. Our results indicate that per node average version age scalings of O(√(n)), O(n^1/3), and O(log n) are achievable in disconnected, ring, and fully connected cluster models, respectively. Next, we increase connectivity in the network and allow gossiping among the cluster heads to improve version age at the nodes. With that, we show that when the cluster heads form a ring network among themselves, we obtain per node average version age scalings of O(n^1/3), O(n^1/4), and O(log n) in disconnected, ring, and fully connected cluster models, respectively. Next, focusing on a ring network topology in each cluster, we introduce hierarchy to the considered clustered gossip network model and show that when we employ two levels of hierarchy, we can achieve the same O(n^1/4) scaling without using dedicated cluster heads. We generalize this result for h levels of hierarchy and show that per user average version age scaling of O(n^1/2h) is achievable in the case of a ring network in each cluster across all hierarchy levels.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/06/2021

Age of Gossip in Networks with Community Structure

We consider a network consisting of a single source and n receiver nodes...
research
07/17/2023

Age of Gossip on a Grid

We consider a gossip network consisting of a source generating updates a...
research
07/29/2021

Gossiping with Binary Freshness Metric

We consider the binary freshness metric for gossip networks that consist...
research
12/29/2022

Timestomping Vulnerability of Age-Sensitive Gossip Networks

We consider gossip networks consisting of a source that maintains the cu...
research
05/06/2019

Age of Information Scaling in Large Networks with Hierarchical Cooperation

Given n randomly located source-destination (S-D) pairs on a fixed area ...
research
08/23/2023

Age of Gossip on Generalized Rings

We consider a gossip network consisting of a source forwarding updates a...
research
05/06/2022

Age of Gossip in Ring Networks in the Presence of Jamming Attacks

We consider a system with a source which maintains the most current vers...

Please sign up or login with your details

Forgot password? Click here to reset