ASUMAN: Age Sense Updating Multiple Access in Networks
Purbesh Mitra, Sennur Ulukus

TL;DR
The paper introduces ASUMAN, a distributed gossiping scheme that adaptively prioritizes nodes with higher age to minimize information age in a network, achieving a constant average age.
Contribution
It proposes a novel age-aware gossiping protocol that significantly improves information freshness compared to fixed-rate gossiping schemes.
Findings
Average age scales as O(1) with ASUMAN.
ASUMAN outperforms fixed-rate gossiping with age scaling as O(log n).
The scheme effectively utilizes constrained gossip rates for timely updates.
Abstract
We consider a fully-connected wireless gossip network which consists of a source and receiver nodes. The source updates itself with a Poisson process and also sends updates to the nodes as Poisson arrivals. Upon receiving the updates, the nodes update their knowledge about the source. The nodes gossip the data among themselves in the form of Poisson arrivals to disperse their knowledge about the source. The total gossiping rate is bounded by a constraint. The goal of the network is to be as timely as possible with the source. In this work, we propose ASUMAN, a distributed opportunistic gossiping scheme, where after each time the source updates itself, each node waits for a time proportional to its current age and broadcasts a signal to the other nodes of the network. This allows the nodes in the network which have higher age to remain silent and only the low-age nodes to gossip,…
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 · Opportunistic and Delay-Tolerant Networks · Advanced MIMO Systems Optimization
