Age Optimal Sampling and Routing under Intermittent Links and Energy Constraints (2512.00985v1)

Abstract: Links in practical systems, such as satellite-terrestrial integrated networks, exhibit distinct delay distributions, intermittent availability, and heterogeneous energy costs. These characteristics pose significant challenges to maintaining timely and energy-efficient status updates. While link availability restricts feasible transmission routes, routing decisions determine the actual delay and energy expenditure. This paper tackles these challenges by jointly optimizing sampling and routing decisions to minimize monotonic, nonlinear Age of Information (AoI). The proposed formulation incorporates key system features, including multiple routes with correlated random delays, stochastic link availability, and route-dependent energy consumption. We model the problem as an infinite-horizon constrained semi-Markov decision process (CSMDP) with a hybrid state-action space and develop an efficient nested algorithm, termed Bisec-ReaVI, to solve this problem. We reveal a well-defined jointly optimal policy structure: (i) the optimal routing policy is a monotonic handover policy that adapts to the availability of routes and their mean delays; and (ii) the optimal sampling policy is a piecewise linear waiting policy, with at most "N choose 2 + N" breakpoints given N routes. Numerical experiments in a satellite-terrestrial integrated routing scenario demonstrate that the proposed scheme efficiently balances energy usage and information freshness, and reveal a counter-intuitive insight: even routes with higher average delay, higher delay variance, or lower availability can still play a critical role in minimizing monotonic functions of AoI.