[Paper Review] Optimizing Information Freshness in a Multiple Access Channel with Heterogeneous Devices

Zheng Chen, Νικόλαος Παππάς+2 more|arXiv (Cornell University)|Oct 10, 2019

Age of Information Optimization44 references4 citations

TL;DR

This paper proposes age-optimal scheduling for a multiple access channel with one grid-connected source and one energy-harvesting (EH) sensor, minimizing the EH node's average age of information (AoI) under queue stability constraints. It introduces a Probabilistic Random Access (PRA) policy with closed-form optimal solutions and a Drift-Plus-Penalty (DPP) policy using Lyapunov optimization, showing the DPP policy outperforms PRA, especially under low multi-packet reception capability.

ABSTRACT

In this work, we study age-optimal scheduling with stability constraints in a multiple access channel with two heterogeneous source nodes transmitting to a common destination. The first node is connected to a power grid and it has randomly arriving data packets. Another energy harvesting (EH) sensor monitors a stochastic process and sends status updates to the destination. We formulate an optimization problem that aims at minimizing the average age of information (AoI) of the EH node subject to the queue stability condition of the grid-connected node. First, we consider a Probabilistic Random Access (PRA) policy where both nodes make independent transmission decisions based on some fixed probability distributions. We show that with this policy, the average AoI is equal to the average peak AoI, if the EH node only sends freshly generated samples. In addition, we derive the optimal solution in closed form, which reveals some interesting properties of the considered system. Furthermore, we consider a Drift-Plus-Penalty (DPP) policy and develop AoI-optimal and peak-AoI-optimal scheduling algorithms using the Lyapunov optimization theory. Simulation results show that the DPP policy outperforms the PRA policy in various scenarios, especially when the destination node has low multi-packet reception capabilities.

Motivation & Objective

• To minimize the average age of information (AoI) for an energy-harvesting (EH) sensor in a multiple access channel (MAC) with a grid-connected source.
• To ensure queue stability for the grid-connected source under random data arrivals.
• To design age-optimal scheduling policies that balance freshness and reliability in heterogeneous IoT networks with mixed traffic types.
• To evaluate performance under varying multi-packet reception (MPR) capabilities at the destination.

Proposed method

• Formulates an optimization problem minimizing the EH node's average AoI subject to queue stability of the grid-connected node.
• Proposes a Probabilistic Random Access (PRA) policy where both nodes independently decide transmission based on fixed probabilities.
• Shows that under PRA, average AoI equals peak AoI when the EH node transmits only fresh samples, enabling closed-form optimal solutions.
• Applies Lyapunov optimization to develop a Drift-Plus-Penalty (DPP) policy that jointly minimizes age and stabilizes queues.
• Derives scheduling algorithms for both AoI-optimal and peak-AoI-optimal operation using conditional expectation minimization of the DPP upper bound.
• Uses a two-step decision rule: (1) maximize $ Z(t)H(t)p_2(t) + Q(t)p_1(t) $, (2) set $ \alpha(t) = \alpha_{\text{max}} $ if $ Z(t) \leq V $, else 0.

Experimental results

Research questions

• RQ1 How can age-optimal scheduling be achieved in a MAC with one EH sensor and one grid-connected source under queue stability constraints?
• RQ2 What is the performance gain of a DPP-based policy over a PRA policy in terms of average AoI, especially under limited multi-packet reception?
• RQ3 Under what conditions does the average AoI equal the peak AoI in a PRA-based system with fresh sampling?
• RQ4 How does the Lyapunov-based DPP policy ensure queue stability while minimizing AoI?
• RQ5 What are the structural properties of the optimal transmission probabilities and energy allocation in the presence of heterogeneous energy sources?

Key findings

• The DPP policy achieves better average AoI performance than the PRA policy, particularly when the destination has low multi-packet reception capability.
• Under the PRA policy, the average AoI equals the peak AoI if the EH node transmits only newly generated samples, enabling a closed-form optimal solution.
• The DPP-based scheduling algorithm stabilizes the queue of the grid-connected source, with the queue backlog bounded by $ \frac{C + V}{\epsilon} $ in the long run.
• The DPP policy minimizes the upper bound of the drift-plus-penalty expression, ensuring stability and near-optimal age performance.
• The optimal transmission probability for the EH node and the energy allocation are derived in closed form under the PRA policy, revealing insights into system tradeoffs.
• Theoretical analysis proves that the DPP policy achieves strong queue stability and asymptotic optimality in minimizing age and satisfying stability constraints.