1 citations · 3 across the 16 of their papers we have counts for
5 papers · 1 filter
Age-Based Cache Updating Under Timestomping
Subhankar Banerjee, Priyanka Kaswan, Sennur Ulukus
We consider a slotted communication system consisting of a source, a cache, a user and a timestomping adversary. The time horizon consists of total time slots, such that the so…
To Re-transmit or Not to Re-transmit for Freshness
Subhankar Banerjee, Sennur Ulukus, Anthony Ephremides
We consider a time slotted communication network with a base station (BS) and a user. At each time slot a fresh update packet arrives at the BS with probability . When the BS…
The Freshness Game: Timely Communications in the Presence of an Adversary
Subhankar Banerjee, Sennur Ulukus
We consider a communication system where a base station (BS) transmits update packets to users, one user at a time, over a wireless channel. We investigate the age of this stat…
Minimizing the Age of Information Over an Erasure Channel for Random Packet Arrivals With a Storage Option at the Transmitter
Subhankar Banerjee, Sennur Ulukus, Anthony Ephremides
We consider a time slotted communication system consisting of a base station (BS) and a user. At each time slot an update packet arrives at the BS with probability , and the BS…
Age of Information of a Power Constrained Scheduler in the Presence of a Power Constrained Adversary
Subhankar Banerjee, Sennur Ulukus, Anthony Ephremides
We consider a time slotted communication network consisting of a base station (BS), an adversary, users and communication channels. Both the BS and the adversary have ave…