Effective Communication: When to Pull Updates? (2311.06432v2)
Abstract: We study a pull-based communication system where a sensing agent updates an actuation agent using a query control policy, which is adjusted in the evolution of an observed information source and the usefulness of each update for achieving a specific goal. For that, a controller decides whether to pull an update at each slot, predicting what is probably occurring at the source and how much effective impact that update could have at the endpoint. Thus, temporal changes in the source evolution could modify the query arrivals so as to capture important updates. The amount of impact is determined by a grade of effectiveness (GoE) metric, which incorporates both freshness and usefulness attributes of the communicated updates. Applying an iterative algorithm, we derive query decisions that maximize the long-term average GoE for the communicated packets, subject to cost constraints. Our analytical and numerical results show that the proposed query policy exhibits higher effectiveness than existing periodic and probabilistic query policies for a wide range of query arrival rates.
- M. Kountouris and N. Pappas, “Semantics-empowered communication for networked intelligent systems,” IEEE Commun. Mag., vol. 59, no. 6, 2021.
- P. Popovski, O. Simeone, F. Boccardi, D. Gündüz, and O. Sahin, “Semantic-effectiveness filtering and control for post-5G wireless connectivity,” Journ. Indian Inst. Sci., vol. 100, no. 2, 2020.
- B. Yin, S. Zhang, Y. Cheng, L. X. Cai, Z. Jiang, S. Zhou, and Z. Niu, “Only those requested count: Proactive scheduling policies for minimizing effective age-of-information,” in IEEE INFOCOM, 2019.
- F. Li, Y. Sang, Z. Liu, B. Li, H. Wu, and B. Ji, “Waiting but not aging: Optimizing information freshness under the pull model,” IEEE/ACM Trans. on Network., vol. 29, no. 1, 2021.
- J. Holm, A. E. Kalør, F. Chiariotti, B. Soret, S. K. Jensen, T. B. Pedersen, and P. Popovski, “Freshness on demand: Optimizing age of information for the query process,” in IEEE ICC, 2021.
- F. Chiariotti, J. Holm, A. E. Kalør, B. Soret, S. K. Jensen, T. B. Pedersen, and P. Popovski, “Query age of information: Freshness in pull-based communication,” IEEE Trans. on Commun., vol. 70, no. 3, 2022.
- M. E. Ildiz, O. T. Yavascan, E. Uysal, and O. T. Kartal, “Query age of information: Optimizing AoI at the right time,” in IEEE ISIT, 2022.
- O. T. Yavascan, E. T. Ceran, Z. Cakir, E. Uysal, and O. Kaya, “When to pull data for minimum age penalty,” in IEEE WiOpt, 2021.
- M. E. Ildiz, O. T. Yavascan, E. Uysal, and O. T. Kartal, “Pull or wait: How to optimize query age of information,” arXiv:2111.02309, 2021.
- C. E. Leiserson, “Systolic priority queues,” Proceedings of the Caltech Conference On Very Large Scale Integration, 1979.
- P. Agheli, N. Pappas, and M. Kountouris, “Semantic filtering and source coding in distributed wireless monitoring systems,” IEEE Trans. on Commun. (Early Access), 2024.
- N. Pappas and M. Kountouris, “Goal-oriented communication for real-time tracking in autonomous systems,” in IEEE ICAS, 2021.
- G. J. Stamatakis, N. Pappas, A. Fragkiadakis, and A. Traganitis, “Semantics-aware active fault detection in IoT,” in 20th WiOpt, 2022.
- M. Hatami, M. Leinonen, Z. Chen, N. Pappas, and M. Codreanu, “On-demand AoI minimization in resource-constrained cache-enabled IoT networks with energy harvesting sensors,” IEEE Trans. on Commun., vol. 70, no. 11, 2022.
- R. Bellman, “On the theory of dynamic programming,” Proceedings of The National Academy of Sciences, vol. 38, no. 8, 1952.
- F. J. Beutler and K. W. Ross, “Optimal policies for controlled Markov chains with a constraint,” Journ. Math. Anal. Appl., vol. 112, no. 1, 1985.