论文标题
在对手面前的信息年龄
Age of Information in the Presence of an Adversary
论文作者
论文摘要
我们考虑了一个通信系统，基站在无线频道上一次为$ n $用户提供服务，一个用户。我们考虑每个用户通过信息度量的及时性。受约束的对手最多可以阻止给定的分数，即$α$，即$ t $插槽的时间插槽的时间插槽，即，它最多可以阻止最多$αT$插槽。我们表明，最佳对手阻止随机选择的用户的$αt$连续插槽。被阻塞的时间插槽的有趣连续特性是由于年龄度量的累积性质。
We consider a communication system where a base station serves $N$ users, one user at a time, over a wireless channel. We consider the timeliness of the communication of each user via the age of information metric. A constrained adversary can block at most a given fraction, $α$, of the time slots over a horizon of $T$ slots, i.e., it can block at most $αT$ slots. We show that an optimum adversary blocks $αT$ consecutive time slots of a randomly selected user. The interesting consecutive property of the blocked time slots is due to the cumulative nature of the age metric.
