Age of Information-Oriented Link Scheduling in Device-to-Device Networks

This paper focuses on optimizing the long-term average age of information (AoI) in device-to-device (D2D) networks through age-aware link scheduling. The problem is naturally formulated as a Markov decision process (MDP). However, finding the optimal policy for the formulated MDP in its original form is challenging due to the intertwined AoI dynamics of all D2D links. To address this, we employ the Lyapunov optimization framework to develop a dynamic age-aware scheduling policy. Specifically, we explore two scenarios: known statistical channel state information (CSI) and known instantaneous CSI. For the statistical CSI case, we propose a message passing neural network (MPNN)-based policy for real-time scheduling. The MPNN is trained in an unsupervised manner with a loss function designed to minimize per-slot Lyapunov drift. For the instantaneous CSI case, we introduce a Gurobi-based policy, using the solver to minimize per-slot Lyapunov drift for scheduling decisions. To further reduce the computational complexity, we also propose a greedy heuristic policy that approximates drift minimization. Extensive simulation results show that our proposed age-aware scheduling policies have superior performance compared to the baselines, and can be applied to large-scale D2D networks.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Wireless Communications
Published
2025-05-30
DOI
https://doi.org/10.1109/twc.2025.3572690
Citations
2
Primary Topic
Age of Information Optimization
Type
article
Field-Weighted Citation Impact
2.97
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Age of Information-Oriented Link Scheduling in Device-to-Device Networks

Lixin Wang, Shidong Zhou, He Henry Chen, Qian Wang
2 citations
IEEE Transactions on Wireless Communications
Age of Information Optimization
2.97
article

Age of Information-Oriented Link Scheduling in Device-to-Device Networks

Lixin Wang, Shidong Zhou, He Henry Chen, Qian Wang
article en
2 citations

Abstract

This paper focuses on optimizing the long-term average age of information (AoI) in device-to-device (D2D) networks through age-aware link scheduling. The problem is naturally formulated as a Markov decision process (MDP). However, finding the optimal policy for the formulated MDP in its original form is challenging due to the intertwined AoI dynamics of all D2D links. To address this, we employ the Lyapunov optimization framework to develop a dynamic age-aware scheduling policy. Specifically, we explore two scenarios: known statistical channel state information (CSI) and known instantaneous CSI. For the statistical CSI case, we propose a message passing neural network (MPNN)-based policy for real-time scheduling. The MPNN is trained in an unsupervised manner with a loss function designed to minimize per-slot Lyapunov drift. For the instantaneous CSI case, we introduce a Gurobi-based policy, using the solver to minimize per-slot Lyapunov drift for scheduling decisions. To further reduce the computational complexity, we also propose a greedy heuristic policy that approximates drift minimization. Extensive simulation results show that our proposed age-aware scheduling policies have superior performance compared to the baselines, and can be applied to large-scale D2D networks.

IEEE Transactions on Wireless CommunicationsVol. 24(11)
Chinese University of Hong Kong (HK), Hangzhou Dianzi University (CN), Tsinghua University (CN)
Openalex Percentile: Top 9%
Age of Information Optimization
2.97
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.