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

arXiv: https://arxiv.org/abs/2205.03328 · HTML: https://mlsanity.com/paper/2205.03328/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 6 May 2022.

## Built on by (most cited first, 1 of 1)

- [A Learning Based Scheme for Fair Timeliness in Sparse Gossip Networks](https://mlsanity.com/paper/2310.01396/) (2023)

## Abstract (arXiv)

We consider a system with a source which maintains the most current version of a file, and a ring network of n user nodes that wish to acquire the latest version of the file. The source gets updated with newer file versions as a point process, and forwards them to the user nodes, which further forward them to their neighbors using a memoryless gossip protocol. We study the average version age of this network in the presence of tilden jammers that disrupt inter-node communications. To this purpose, we construct an alternate system model of mini-rings and prove that the version age of the original model can be sandwiched between constant multiples of the version age of the alternate model. We show that when the number of jammers scales as a fractional power of the network size, i.e., tilde n= cnα, the version age scales as √n when α < frac12, and as nα when α ≥ frac12. As the version age of a ring network without any jammers scales as √n, our result implies that the version age with gossiping is robust against up to √n jammers in a ring network.