计算机科学
计算机网络
网络数据包
自动重复请求
选择性重复ARQ
继电器
线性网络编码
混合自动重复请求
电信线路
物理层
实时计算
无线
电信
量子力学
物理
功率(物理)
作者
Haoyuan Pan,Tse-Tin Chan,Victor C. M. Leung,Jianqiang Li
标识
DOI:10.1109/tmc.2022.3166155
摘要
This paper investigates the information freshness of two-way relay networks (TWRNs) operated with physical-layer network coding (PNC). Information freshness is quantified by age of information (AoI), defined as the time elapsed since the generation time of the latest received information update. PNC reduces the communication latency of TWRNs by turning superimposed electromagnetic waves into network-coded messages so that end users can send update packets to each other more frequently via the relay. While sending update packets more frequently has the potential to reduce AoI, how to handle packet corruption in TWRNs has not been investigated. Specifically, if an old packet is corrupted in any hop of a TWRN, one needs to decide whether to drop or to retransmit the old packet, e.g., a new packet has more recent information but may take more time to be delivered. Therefore, we study the average AoI with and without automatic repeat request (ARQ) in PNC-enabled TWRNs. Interestingly, our analysis shows that neither the non-ARQ scheme nor the pure ARQ scheme achieves a good average AoI. Hence, we put forth an uplink-lost-then-drop (ULTD) protocol that combines packet drop and ARQ. Experiments on software-defined radios indicate that ULTD significantly outperforms non-ARQ and pure ARQ schemes in terms of average AoI, especially when the two end users have imbalanced channel conditions. We believe the insight of ULTD on TWRNs generally applies to other two-hop networks: to achieve high information freshness, when packets are corrupted in the first hop, new packets should be generated and sent (i.e., old packets are discarded); when packets are corrupted in the second hop, old packets should be retransmitted until they are successfully received.
科研通智能强力驱动
Strongly Powered by AbleSci AI