Abstract
In this paper, we consider a status updating system where updates are generated at a constant rate at K sources and sent to the corresponding recipients through a broadcast channel. We assume that perfect channel state information (CSI) is available at the transmitter before each transmission, and the additive noise is negligible at the receivers. Under various assumptions on the number of antennas at the transmitter and the size of updates, our object is to design precoding and transmission scheduling schemes for the minimization of the summed time-average Age of Information (AoI) at the recipients. We show that when the transmitter has a single antenna, precoding is unnecessary, and the optimal policy is to update each recipient in a greedy round-robin fashion. When the transmitter has multiple antennas, updating with round-robin precoding is age-optimal.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
