3 papers
cs.IT2026
Transmit or Idle: Efficient AoI Optimal Transmission Policy for Gossiping Receivers
Irtiza Hasan, Ahmed Arafa
We study the optimal transmission and scheduling policy for a transmitter (source) communicating with two gossiping receivers aiming at tracking the source's status over time using…
cs.IT2025
RC-Gossip: Information Freshness in Clustered Networks with Rate-Changing Gossip
Irtiza Hasan, Ahmed Arafa
A clustered gossip network is considered in which a source updates its information over time, and end-nodes, organized in clusters through clusterheads, are keeping track of it. Th…
cs.IT2025
Version Age of Information with Contact Mobility in Gossip Networks
Irtiza Hasan, Ahmed Arafa
A gossip network is considered in which a source node updates its status while other nodes in the network aim at keeping track of it as it varies over time. Information gets dissem…