arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.09774cs.ITcs.LGmath.IT
收藏

基于HARQ的多用户网络信息年龄强化学习方法

A Reinforcement Learning Approach to Age of Information in Multi-User Networks with HARQ

Imperial College London(伦敦帝国理工学院);Middle East Technical University(中东技术大学);DeepMind

Elif Tugce Ceran, Deniz Gunduz, Andras Gyorgy

摘要:

调度传输的时间-敏感信息从一个源节点到多个用户在易出错的通信信道进行了研究,目标是最小化的长期平均年龄的信息(AoI)在用户。一个长期的平均资源约束施加在源上,这限制了平均传输次数。源在每个时隙只能向单个用户发送,并且在每次发送之后,它从预期接收器接收瞬时ACK/NACK反馈,并且决定何时以及向哪个用户发送下一次更新。假设信道统计是已知的,最优调度策略的标准自动重传请求(ARQ)和混合ARQ(HARQ)协议进行了研究。然后,一个强化学习(RL)的方法被引入到找到一个接近最优的政策,它不假设任何先验信息的随机过程中的信道状态。通过数值模拟,应用并比较了不同的强化学习方法,包括线性函数近似(LFA)的平均成本SARSA、上置信度强化学习(UCRL 2)和深度Q网络(DQN

英文摘要:

Scheduling the transmission of time-sensitive information from a source node to multiple users over error-prone communication channels is studied with the goal of minimizing the long-term average age of information (AoI) at the users. A long-term average resource constraint is imposed on the source, which limits the average number of transmissions. The source can transmit only to a single user at each time slot, and after each transmission, it receives an instantaneous ACK/NACK feedback from the intended receiver, and decides when and to which user to transmit the next update. Assuming the channel statistics are known, the optimal scheduling policy is studied for both the standard automatic repeat request (ARQ) and hybrid ARQ (HARQ) protocols. Then, a reinforcement learning(RL) approach is introduced to find a near-optimal policy, which does not assume any a priori information on the random processes governing the channel states. Different RL methods including average-cost SARSAwith linear function approximation (LFA), upper confidence reinforcement learning (UCRL2), and deep Q-network (DQN) are applied and compared through numerical simulations

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑