Precoding and Scheduling for AoI Minimization in MIMO Broadcast Channels
Songtao Feng, Jing Yang

TL;DR
This paper investigates optimal precoding and scheduling strategies to minimize the age of information in MIMO broadcast channels with perfect CSI, identifying optimal schemes under various system configurations.
Contribution
It provides the first comprehensive analysis of age-optimal precoding and scheduling strategies for different MIMO broadcast channel scenarios.
Findings
Round-robin updating scheme is optimal for N=1.
Framed updating schemes are optimal for certain two-user configurations.
A framed alternating updating scheme is 2-optimal in other two-user cases.
Abstract
In this paper, we consider a status updating system where updates are generated at a constant rate at sources and sent to the corresponding recipients through a noise-free broadcast channel. We assume that perfect channel state information (CSI) is available at the transmitter before each transmission, and the transmitter is able to utilize the CSI information to precode the updates. Our object is to design optimal precoding schemes to minimize the summed average \emph{age of information} (AoI) at the recipients. Under various assumptions on the size of each update , the number of transmit antennas , and the number of receive antennas at each user, this paper identifies the corresponding age-optimal precoding and transmission scheduling strategies. Specifically, for the case when , a round-robin based updating scheme is shown to be optimal. For the two-user systems…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAge of Information Optimization · IoT Networks and Protocols · Advanced MIMO Systems Optimization
