{'fraction_non_alphanumeric': 0.020187454938716654, 'fraction_numerical': 0.0, 'mean_word_length': 5.455813953488372, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Optimal Transmission-Constrained Scheduling of Spatio-Temporally Dependent Observations Using Age-of-Information

This paper proposes an optimal scheduling policy for broadcasting spatio-temporally dependent observations to two remote estimators over a finite time horizon. The system comprises a scheduler that can broadcast one observation from one out of two spatio-temporally dependent processes at each time instant. Since the number of broadcasting instants for each sensor is constrained, the scheduler must plan the broadcasting that minimizes the time-averaged estimation error. As the scheduler cannot observe the measurements, it determines the expected estimation error based on the age-of information (AoI). Using AoI as a state variable, we derive a set of optimal scheduling policies that minimizes the average mean squared error (MSE) for any given time horizon. The policies provide the optimal number of transmission instances for each sensor and time-varying AoI thresholds for when to be scheduled. By studying how the MSE evolves with respect to the AoI generated by a given scheduling sequence, we can obtain an optimal policy using a low-complexity numerical method. Numerical results validate the theory and demonstrate how utilizing spatio-temporal dependencies together with AoI can enhance the estimation accuracy in a communication-constrained sensor network.