当前位置: X-MOL 学术arXiv.cs.SI › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Timely Broadcasting in Erasure Networks: Age-Rate Tradeoffs
arXiv - CS - Social and Information Networks Pub Date : 2021-02-17 , DOI: arxiv-2102.08926
Xingran Chen, Renpu Liu, Shaochong Wang, Shirin Saeedi Bidokhti

The interplay between timeliness and rate efficiency is investigated in packet erasure broadcast channels with feedback. A scheduling framework is proposed in which coding actions, as opposed to users, are scheduled to attain desired tradeoffs between rate and age of information (AoI). This tradeoff is formalized by an upper bound on AoI as a function of the target rate constraints and two lower bounds: one as a function of the communication rate and one as a function of the arrival rate. Simulation results show that (i) coding can be beneficial in reducing AoI in the regime of moderate arrival rates even without rate constraints and the benefit increases with the number of users, and (ii) AoI increases with both the target rate constraint and the arrival rate when either is kept fixed, but decreases with them when they are set to be equal.

中文翻译:

擦除网络中的及时广播:年龄比率的权衡

在具有反馈的分组擦除广播信道中研究了时效性和速率效率之间的相互作用。提出了一种调度框架,在该框架中,与用户相反,对编码动作进行了调度,以在信息的速率和使用期限(AoI)之间获得所需的权衡。这种权衡通过AoI的上限(取决于目标速率约束)和两个下限来形式化:一个作为通信速率的函数,另一个是到达速率的函数。仿真结果表明,(i)编码即使在没有速率限制的情况下,也可以在中等到达速率的情况下降低AoI,并且受益随着用户数量的增加而增加;(ii)在目标速率限制和到达时,AoI都增加当两者保持固定时的比率,但当它们设置为相等时,比率随它们降低。
更新日期:2021-02-18
down
wechat
bug