Grouping-Based Cyclic Scheduling Under Age of Correlated Information Constraints
Lists
Only you see this
Abstract
This paper studies an internet of things (IoT) network where a fusion center relies on multi-view and correlated information generated by multiple sources to monitor various regions. Each region possesses hard age of correlated information (AoCI) constraints for information update, and accordingly we propose a scheduling policy to satisfy such needs and minimize the required wireless resources. We first approximate the problem to a dual bin-packing problem. Secondly, efficient scheduling policies are identified when the age constraints possess special mathematical properties, where the number of channels at most required is analyzed. Optimality conditions of the proposed policies are presented. For general constraints, a two-step grouping algorithm for multi-view (TGAM) is proposed to establish scheduling policies. Under TGAM, the constraints are mapped into a combination of the special constraints. To quickly identify an optimized mapping from a vast solution space, TGAM heuristically groups the regions according to their constraints and then searches for the optimal mapping for each group. Numerical results demonstrate that, compared to a derived lower bound, the proposed TGAM requires only 1.07% more channels. Additionally, the number of regions that can be served by TGAM is significantly larger than the state-of-the art algorithm, given the number of channels.
BibTeX
@article{wang2025grouping,
author = {Lehan Wang and Jingzhou Sun and Yuxuan Sun and Sheng Zhou and Zhisheng Niu and Miao Jiang and Lu Geng},
title = {{Grouping-Based Cyclic Scheduling Under Age of Correlated Information Constraints}},
journal = {IEEE Transactions on Information Theory},
year = {2025},
doi = {10.1109/tit.2025.3529497},
}Loading related content...