论文标题
在上行链路MIMO系统中最小化信息时代的多源时间安排
Multiuser Scheduling for Minimizing Age of Information in Uplink MIMO Systems
论文作者
论文摘要
本文研究了多源多输入多输出(MIMO)状态更新系统中的用户调度问题,其中多个单人体设备旨在通过共享无线通道将其最新状态发送到多 - 安特纳纳信息融合访问点(AP)。被考虑的系统中的信息新鲜度通过最近提出的指标,称为信息年龄(AOI)。得益于AP的多个天线带来的额外的空间自由度,可以在每个时插槽中同时传输多个设备。我们旨在寻求最佳的调度策略,该策略可以通过最佳确定在插槽开始时所有设备的瞬时AOI值的瞬时AOI值来确定要在每个插槽中安排哪种设备或一组设备,以最大程度地减少网络范围内的AOI。为此,我们将Multiuser调度问题提出为Markov决策过程(MDP)。我们通过解决配制的MDP问题并制定低复杂性次优政策来实现最佳政策。仿真结果表明,所提出的最佳和亚最佳策略的表现明显优于最先进的基准方案。
This paper studies the user scheduling problem in a multiuser multiple-input multi-output (MIMO) status update system, in which multiple single-antenna devices aim to send their latest statuses to a multiple-antenna information-fusion access point (AP) via a shared wireless channel. The information freshness in the considered system is quantified by a recently proposed metric, termed age of information (AoI). Thanks to the extra spatial degrees-of-freedom brought about by the multiple antennas at the AP, multiple devices can be granted to transmit simultaneously in each time slot. We aim to seek the optimal scheduling policy that can minimize the network-wide AoI by optimally deciding which device or group of devices to be scheduled for transmission in each slot given the instantaneous AoI values of all devices at the beginning of the slot. To that end, we formulate the multiuser scheduling problem as a Markov decision process (MDP). We attain the optimal policy by resolving the formulated MDP problem and develop a low-complexity sub-optimal policy. Simulation results show that the proposed optimal and sub-optimal policies significantly outperform the state-of-the-art benchmark schemes.