面向信息年龄的设备到设备网络概率链路调度
Age of Information-Oriented Probabilistic Link Scheduling for Device-to-Device Networks
AI总结:
针对D2D网络长期平均AoI优化问题,提出基于Lyapunov优化与MPNN无监督学习的感知年龄平稳随机调度策略,性能优于基线且具备可扩展性。
摘要:
本文聚焦于通过感知信息年龄的链路调度,优化设备到设备(D2D)网络中的长期平均信息年龄(AoI)。该问题被自然地建模为马尔可夫决策过程(MDP)。然而,由于所有D2D链路的AoI动态相互交织,为原始形式的已建模MDP找到最优策略极具挑战性。为解决这一问题,我们提出了一种感知信息年龄的平稳随机策略,该策略基于所有链路的AoI以及所有收发器之间的统计信道状态信息,确定每个时隙中调度每条链路的概率。通过采用Lyapunov优化框架,我们的策略旨在最小化每个时隙的Lyapunov漂移。尽管如此,由于D2D网络中的跨链路干扰,这种逐时隙最小化问题是非凸的,给实时决策带来了巨大挑战。在分析了逐时隙问题最优解的置换等变性质后,我们应用消息传递神经网络(MPNN,一种同样具有置换等变性的图神经网络),以无监督学习的方式优化该逐时隙问题。仿真结果表明,所提出的感知信息年龄的平稳随机策略性能优于各基线方法,并验证了我们方法的可扩展性。
英文摘要:
This paper focuses on optimizing the long-term average age of information (AoI) in device-to-device (D2D) networks through age-aware link scheduling. The problem is naturally formulated as a Markov decision process (MDP). However, finding the optimal policy for the formulated MDP in its original form is challenging due to the intertwined AoI dynamics of all D2D links. To address this, we propose an age-aware stationary randomized policy that determines the probability of scheduling each link in each time slot based on the AoI of all links and the statistical channel state information among all transceivers. By employing the Lyapunov optimization framework, our policy aims to minimize the Lyapunov drift in every time slot. Nonetheless, this per-slot minimization problem is nonconvex due to cross-link interference in D2D networks, posing significant challenges for real-time decision-making. After analyzing the permutation equivariance property of the optimal solutions to the per-slot problem, we apply a message passing neural network (MPNN), a type of graph neural network that also exhibits permutation equivariance, to optimize the per-slot problem in an unsupervised learning manner. Simulation results demonstrate the superior performance of the proposed age-aware stationary randomized policy over baselines and validate the scalability of our method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。