Processing math: 33%
Version Age of Information in Clustered Gossip Networks | IEEE Journals & Magazine | IEEE Xplore

Version Age of Information in Clustered Gossip Networks


Abstract:

We consider a network consisting of a single source and n receiver nodes that are grouped into equal-sized clusters. Each cluster corresponds to a distinct community ...Show More

Abstract:

We consider a network consisting of a single source and n receiver nodes that are grouped into equal-sized clusters. Each cluster corresponds to a distinct community such that nodes that belong to different communities cannot exchange information. We use dedicated 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 levels within clusters, each node relays its current stored version of the source update to its neighboring nodes by local gossiping. We consider disconnected, ring, and fully connected network topologies for each cluster. For each of these network topologies, we characterize the average version age at each node and find the average version age scaling as a function of the network size n . Next, by allowing gossiping among the cluster heads, we improve the version age scaling at the receiver nodes. Then, focusing on a ring network topology in each cluster, we introduce hierarchy to the considered clustered gossip network model without using dedicated cluster heads. Finally, we find the version age-optimum cluster sizes as a function of the source, cluster head, and node update rates through numerical evaluations.
Published in: IEEE Journal on Selected Areas in Information Theory ( Volume: 3, Issue: 1, March 2022)
Page(s): 85 - 97
Date of Publication: 15 March 2022
Electronic ISSN: 2641-8770

Funding Agency:


References

References is not available for this document.