{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T16:25:29Z","timestamp":1781367929275,"version":"3.54.1"},"reference-count":39,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2024,11,25]],"date-time":"2024-11-25T00:00:00Z","timestamp":1732492800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Swedish Research Council (VR)","award":["101096526"],"award-info":[{"award-number":["101096526"]}]},{"name":"Swedish Research Council (VR)","award":["101120135"],"award-info":[{"award-number":["101120135"]}]},{"name":"Swedish Research Council (VR)","award":["101131481"],"award-info":[{"award-number":["101131481"]}]},{"name":"Swedish Research Council (VR)","award":["2022-03664"],"award-info":[{"award-number":["2022-03664"]}]},{"name":"ELLIIT","award":["101096526"],"award-info":[{"award-number":["101096526"]}]},{"name":"ELLIIT","award":["101120135"],"award-info":[{"award-number":["101120135"]}]},{"name":"ELLIIT","award":["101131481"],"award-info":[{"award-number":["101131481"]}]},{"name":"ELLIIT","award":["2022-03664"],"award-info":[{"award-number":["2022-03664"]}]},{"name":"European Union","award":["101096526"],"award-info":[{"award-number":["101096526"]}]},{"name":"European Union","award":["101120135"],"award-info":[{"award-number":["101120135"]}]},{"name":"European Union","award":["101131481"],"award-info":[{"award-number":["101131481"]}]},{"name":"European Union","award":["2022-03664"],"award-info":[{"award-number":["2022-03664"]}]},{"name":"Swedish Research Council","award":["101096526"],"award-info":[{"award-number":["101096526"]}]},{"name":"Swedish Research Council","award":["101120135"],"award-info":[{"award-number":["101120135"]}]},{"name":"Swedish Research Council","award":["101131481"],"award-info":[{"award-number":["101131481"]}]},{"name":"Swedish Research Council","award":["2022-03664"],"award-info":[{"award-number":["2022-03664"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In this work, we consider the problem of jointly minimizing the average cost of sampling and transmitting status updates by users over a wireless channel subject to average Age of Information (AoI) constraints. Errors in the transmission may occur and a policy has to decide if the users sample a new packet or attempt to retransmission the packet sampled previously. The cost consists of both sampling and transmission costs. The sampling of a new packet after a failure imposes an additional cost on the system. We formulate a stochastic optimization problem with the average cost in the objective under average AoI constraints. To solve this problem, we propose three scheduling policies: (a) a dynamic policy, which is centralized and requires full knowledge of the state of the system and (b) two stationary randomized policies that require no knowledge of the state of the system. We utilize tools from Lyapunov optimization theory and Discrete-Time Markov Chain (DTMC) to provide the dynamic policy and the randomized ones, respectively. Simulation results show the importance of providing the option to transmit an old packet in order to minimize the total average cost.<\/jats:p>","DOI":"10.3390\/e26121018","type":"journal-article","created":{"date-parts":[[2024,11,25]],"date-time":"2024-11-25T11:25:33Z","timestamp":1732533933000},"page":"1018","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Joint Sampling and Transmission Policies for Minimizing Cost Under Age of Information Constraints"],"prefix":"10.3390","volume":"26","author":[{"given":"Emmanouil","family":"Fountoulakis","sequence":"first","affiliation":[{"name":"Ericsson, 16483 Stockholm, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0210-4375","authenticated-orcid":false,"given":"Marian","family":"Codreanu","sequence":"additional","affiliation":[{"name":"Department of Science and Technology, Link\u00f6ping University, 60174 Norrk\u00f6ping, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anthony","family":"Ephremides","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Maryland, College Park, MD 20742, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4416-7702","authenticated-orcid":false,"given":"Nikolaos","family":"Pappas","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, Link\u00f6ping University, 60174 Link\u00f6ping, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2024,11,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1561\/1300000060","article-title":"Age of information: A new concept, metric, and tool","volume":"12","author":"Kosta","year":"2017","journal-title":"Found. Trends\u00ae Netw."},{"key":"ref_2","first-page":"1","article-title":"Age of Information: A New Metric for Information Freshness","volume":"12","author":"Sun","year":"2019","journal-title":"Synth. Lect. Commun. Netw."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1109\/JSAC.2021.3065072","article-title":"Age of Information: An Introduction and Survey","volume":"39","author":"Yates","year":"2021","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Kaul, S., Yates, R., and Gruteser, M. (2012, January 25\u201330). Real-time status: How often should one update?. Proceedings of the 2012 Proceedings IEEE INFOCOM, Orlando, FL, USA.","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1360","DOI":"10.1109\/TIT.2015.2511791","article-title":"Effect of message transmission path diversity on status age","volume":"62","author":"Kam","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/JCN.2019.000039","article-title":"Age of Information Performance of Multiaccess Strategies with Packet Management","volume":"21","author":"Kosta","year":"2019","journal-title":"J. Commun. Netw."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1743","DOI":"10.1109\/TIT.2020.3046412","article-title":"Age-delay tradeoffs in queueing systems","volume":"67","author":"Talak","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Pappas, N., and Kountouris, M. (2019, January 2\u20135). Delay violation probability and age of information interplay in the two-user multiple access channel. Proceedings of the 2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Cannes, France.","DOI":"10.1109\/SPAWC.2019.8815559"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"357","DOI":"10.23919\/JCN.2022.000010","article-title":"Information Freshness and Packet Drop Rate Interplay in a Two-User Multi-Access Channel","volume":"24","author":"Fountoulakis","year":"2022","journal-title":"J. Commun. Netw."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1109\/TNET.2020.2971350","article-title":"On the age of information in a CSMA environment","volume":"28","author":"Maatouk","year":"2020","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1109\/TMC.2019.2959774","article-title":"Minimizing the age of information in wireless networks with stochastic arrivals","volume":"20","author":"Kadota","year":"2021","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2556","DOI":"10.1109\/TNET.2018.2870896","article-title":"Wireless scheduling for information freshness and synchrony: Drift-based design and heavy-traffic analysis","volume":"26","author":"Joo","year":"2018","journal-title":"IEEE\/ACM Trans. Net."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Qian, Z., Wu, F., Pan, J., Srinivasan, K., and Shroff, N.B. (2020, January 6\u20139). Minimizing Age of Information in Multi-channel Time-sensitive Information Update Systems. Proceedings of the IEEE INFOCOM 2020\u2014IEEE Conference on Computer Communications, Toronto, ON, Canada.","DOI":"10.1109\/INFOCOM41043.2020.9155420"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1765","DOI":"10.1109\/TNET.2020.2996237","article-title":"Improving age of information in wireless networks with perfect channel state information","volume":"28","author":"Talak","year":"2020","journal-title":"IEEE\/ACM Trans. Net."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1109\/OJCOMS.2021.3062678","article-title":"Optimizing Information Freshness in a Multiple Access Channel with Heterogeneous Devices","volume":"2","author":"Chen","year":"2021","journal-title":"IEEE Open J. Commun. Soc."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1109\/TCOMM.2020.3036672","article-title":"Power minimization for age of information constrained dynamic control in wireless sensor networks","volume":"69","author":"Moltafet","year":"2021","journal-title":"IEEE Trans. Commun."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Tripathi, V., and Modiano, E. (2019, January 24\u201327). A whittle index approach to minimizing functions of age of information. Proceedings of the 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA.","DOI":"10.1109\/ALLERTON.2019.8919842"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Ceran, E.T., G\u00fcnd\u00fcz, D., and Gy\u00f6rgy, A. (May, January 29). Reinforcement learning to minimize age of information with an energy harvesting sensor with HARQ and sensing cost. Proceedings of the IEEE INFOCOM 2019\u2014IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Paris, France.","DOI":"10.1109\/INFCOMW.2019.8845182"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"14110","DOI":"10.1109\/TVT.2020.3029018","article-title":"AoI-optimal joint sampling and updating for wireless powered communication systems","volume":"69","author":"Dhillon","year":"2020","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"7468","DOI":"10.1109\/TCOMM.2019.2931538","article-title":"Joint status sampling and updating for minimizing age of information in the Internet of Things","volume":"67","author":"Zhou","year":"2019","journal-title":"IEEE Trans. Commun."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"5315","DOI":"10.1109\/JIOT.2020.2976690","article-title":"Optimal Policies for Status Update Generation in an IoT Device with Heterogeneous Traffic","volume":"7","author":"Stamatakis","year":"2020","journal-title":"IEEE Internet Things J."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1359","DOI":"10.1109\/TNET.2019.2918736","article-title":"Scheduling algorithms for optimizing age of information in wireless networks with throughput constraints","volume":"27","author":"Kadota","year":"2019","journal-title":"IEEE\/ACM Trans. Net."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"4019","DOI":"10.1109\/TIT.2021.3060387","article-title":"Optimal Sampling and Scheduling for Timely Status Updates in Multi-source Networks","volume":"67","author":"Bedewy","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_24","unstructured":"Yao, G., Bedewy, A.M., and Shroff, N.B. (2020). Age Minimization Transmission Scheduling over Time-Correlated Fading Channel under An Average Energy Constraint. arXiv."},{"key":"ref_25","unstructured":"Fountoulakis, E., Charalambous, T., Ephremides, A., and Pappas, N. (2021). A Dynamic Scheduling Policy for a Network with Heterogeneous Time-Sensitive Traffic. arXiv."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"3490","DOI":"10.1109\/TWC.2020.2974225","article-title":"Real-time remote estimation with hybrid ARQ in wireless networked control","volume":"19","author":"Huang","year":"2020","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Kam, C., Kompella, S., and Ephremides, A. (2020, January 6\u20139). Age of incorrect information for remote estimation of a binary markov source. Proceedings of the IEEE INFOCOM 2020\u2014IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Toronto, ON, Canada.","DOI":"10.1109\/INFOCOMWKSHPS50562.2020.9162726"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Inoue, Y., and Takine, T. (May, January 29). AoI perspective on the accuracy of monitoring systems for continuous-time markovian sources. Proceedings of the IEEE INFOCOM 2019\u2014IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Paris, France.","DOI":"10.1109\/INFCOMW.2019.8845262"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Ornee, T.Z., and Sun, Y. (2019, January 3\u20137). Sampling for remote estimation through queues: Age of information and beyond. Proceedings of the 2019 International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT), Avignon, France.","DOI":"10.23919\/WiOPT47501.2019.9144087"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Huang, K., Liu, W., Li, Y., and Vucetic, B. (2019, January 20\u201324). To retransmit or not: Real-time remote estimation in wireless networked control. Proceedings of the ICC 2019\u20142019 IEEE International Conference on Communications (ICC), Shanghai, China.","DOI":"10.1109\/ICC.2019.8761710"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/MCOM.001.2000604","article-title":"Semantics-empowered communication for networked intelligent systems","volume":"59","author":"Kountouris","year":"2021","journal-title":"IEEE Commun. Mag."},{"key":"ref_32","unstructured":"Maatouk, A., Assaad, M., and Ephremides, A. (2020). The Age of Incorrect Information: An Enabler of Semantics-Empowered Communication. arXiv."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s41745-020-00165-6","article-title":"Semantic-effectiveness filtering and control for post-5G wireless connectivity","volume":"100","author":"Popovski","year":"2020","journal-title":"J. Indian Inst. Sci."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"1412","DOI":"10.1109\/JSAC.2021.3065057","article-title":"A Reinforcement Learning Approach to Age of Information in Multi-User Networks with HARQ","volume":"39","author":"Ceran","year":"2021","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"1263","DOI":"10.1109\/TWC.2020.3032237","article-title":"On the optimality of the Whittle\u2019s index policy for minimizing the age of information","volume":"20","author":"Maatouk","year":"2020","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"8335","DOI":"10.1109\/TCOMM.2021.3114681","article-title":"AoI minimization in status update control with energy harvesting sensors","volume":"69","author":"Hatami","year":"2021","journal-title":"IEEE Trans. Commun."},{"key":"ref_37","first-page":"1","article-title":"Stochastic network optimization with application to communication and queueing systems","volume":"3","author":"Neely","year":"2010","journal-title":"Synth. Lect. Commun. Netw."},{"key":"ref_38","unstructured":"Neely, M.J. (2010). Queue stability and probability 1 convergence via Lyapunov optimization. arXiv."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Meyn, S., and Tweedie, R.L. (2010). Markov Chains and Stochastic Stability, Cambridge University Press. [2nd ed.].","DOI":"10.1017\/CBO9780511626630"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/12\/1018\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T16:39:16Z","timestamp":1760114356000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/12\/1018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,25]]},"references-count":39,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["e26121018"],"URL":"https:\/\/doi.org\/10.3390\/e26121018","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,25]]}}}