论文标题
频道记忆对数据新鲜度的影响
Impact of Channel Memory on the Data Freshness
论文作者
论文摘要
在这封信中，我们研究了通道记忆对在第一次登上的（FCFS）和吉尔伯特 - 埃利奥特（GE）擦除渠道的策略的平均信息（AOI）对具有各种数据包到达模型的网络的影响。对于具有Bernoulli到达模型的网络，我们首先在PLGFS排队策略下得出平均AOI，然后表征FCFS和PLGFS策略之间的AOI间隙。对于Bernoulli到达并生成即将到达模型的网络，FCFS和PLGFS策略下的AOI性能是明确得出的。对于具有定期到达模型的网络，我们在PLGFS下在一般GE通道下得出了平均AOI的闭合形式表达式，并提出了一种数值算法，用于在FCF下有效地计算该算法。据透露，对于PLGFS策略，平均AOI在$ \fracη{1-η} $上通过信道存储器$η$单调增加。对于FCF，由于排队延迟，平均AOI增加了甚至更快的速度，其额外的术语与数据包到达率有关。
In this letter, we investigate the impact of channel memory on the average age of information (AoI) for networks with various packet arrival models under first-come-first-served (FCFS) and preemptive last-generated-first-served (pLGFS) policies over Gilbert-Elliott (GE) erasure channel. For networks with Bernoulli arrival model, we first derive the average AoI under the pLGFS queuing policy, and then characterize the AoI gap between the FCFS and pLGFS policies. For networks with Bernoulli arrival and generate-at-will arrival models, the AoI performances under the FCFS and pLGFS policies are derived explicitly. For networks with periodic arrival model, we derive the closed-form expression for the average AoI under pLGFS over a general GE channel and propose a numerical algorithm for calculating that under FCFS efficiently. It is revealed that for pLGFS policy, the average AoI increases monotonically with channel memory $η$ at $\fracη{1-η}$ over the symmetric GE channel. For FCFS, the average AoI increases even faster due to the queuing delay, with an additional term related to the packet arrival rate.
