Throughput Maximization with an Average Age of Information Constraint in Fading Channels
Rajshekhar Vishweshwar Bhat, Rahul Vaze, Mehul Motani

TL;DR
This paper investigates maximizing data throughput in fading channels while maintaining an average age of information constraint, proposing simple policies that perform within a guaranteed bound of the optimal solutions under different channel knowledge scenarios.
Contribution
It introduces age-independent randomized policies for throughput maximization under AoI constraints, providing performance guarantees regardless of channel state information availability.
Findings
AI-SRP policies achieve at least half of the optimal throughput.
Performance bounds are independent of problem parameters.
Policies are effective with or without channel state information at the transmitter.
Abstract
In the emerging fifth generation (5G) technology, communication nodes are expected to support two crucial classes of information traffic, namely, the enhanced mobile broadband (eMBB) traffic with high data rate requirements, and ultra-reliable low-latency communications (URLLC) traffic with strict requirements on latency and reliability. The URLLC traffic, which is usually analyzed by a metric called the age of information (AoI), is assigned the first priority over the resources at a node. Motivated by this, we consider long-term average throughput maximization problems subject to average AoI and power constraints in a single user fading channel, when (i) perfect and (ii) no channel state information at the transmitter (CSIT) is available. We propose simple age-independent stationary randomized policies (AI-SRP), which allocate powers at the transmitter based only on the channel state…
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.
