{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:43Z","timestamp":1750220203628,"version":"3.41.0"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2023,2,3]],"date-time":"2023-02-03T00:00:00Z","timestamp":1675382400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2018YFB1802401"],"award-info":[{"award-number":["2018YFB1802401"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61872295"],"award-info":[{"award-number":["61872295"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Shaanxi Natural Science Foundation","award":["2020JM-416"],"award-info":[{"award-number":["2020JM-416"]}]},{"name":"Open Foundation of State key Laboratory of Networking and Switching Technology","award":["SKLNST-2020-2-03"],"award-info":[{"award-number":["SKLNST-2020-2-03"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2023,5,31]]},"abstract":"<jats:p>Age-of-Information (AoI) has been recently reckoned as a suitable parameter to evaluate the freshness of collected information, which is essential for data retrieval in Internet of Things, especially the monitoring tasks, e.g., the operating situation of equipments. To motivate a large number of sensor nodes and solicit more up-to-date information from these nodes, the control center usually allocates rewards to nodes according to their proportional contributions. This induces intense competitions among nodes who try to gain high payoffs by carefully balancing the rewards and the costs. In this article, we propose a novel stochastic game model to formulate the competition among sensor nodes, which considers AoI as a metric used by the control center to quantify the contributions of nodes. We also take into account the uncertainty of channel quality, which affects the transmission success ratio of packets generated by nodes. Finally, we design an \u03f5-Nash learning algorithm, which adopts the \u03b8-greedy exploration strategy, to derive the \u03f5-approximate Nash equilibrium such that nodes can maximize their long-term payoffs. Our substantive simulation results and analysis verify that the proposed algorithm outperforms baseline algorithms in bringing higher payoffs to nodes and more fresh information to the control center.<\/jats:p>","DOI":"10.1145\/3565022","type":"journal-article","created":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T11:47:18Z","timestamp":1664452038000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Harmony or Involution: Game Inspiring Age-of-Information Optimization for Edge Data Gathering in Internet of Things"],"prefix":"10.1145","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3265-2954","authenticated-orcid":false,"given":"Xiaoyan","family":"Yin","sequence":"first","affiliation":[{"name":"School of Information Science and Technology, Northwest University, State key Laboratory of Networking and Switching Technology (Beijing University of Posts and Telecommunications), and Shaanxi International Joint Research Centre for the Battery-Free Internet of Things, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0928-4735","authenticated-orcid":false,"given":"Xiaoqian","family":"Mi","sequence":"additional","affiliation":[{"name":"China Unicom Software Research Institute, Xi\u2019an, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0968-8158","authenticated-orcid":false,"given":"Sijia","family":"Yu","sequence":"additional","affiliation":[{"name":"Computer Engineering, State University of New York at Stony Brook, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1382-0679","authenticated-orcid":false,"given":"Yanjiao","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Electrical Engineering, Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2404-0974","authenticated-orcid":false,"given":"Baochun","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Toronto, Toronto, Canada"}]}],"member":"320","published-online":{"date-parts":[[2023,2,3]]},"reference":[{"key":"e_1_3_1_2_2","first-page":"2569","volume-title":"Proceedings of the IEEE International Symposium on Information Theory (ISIT\u201916)","author":"Bedewy Ahmed M.","year":"2016","unstructured":"Ahmed M. Bedewy, Yin Sun, and Ness B. Shroff. 2016. Optimizing data freshness, throughput, and delay in multi-server information-update systems. In Proceedings of the IEEE International Symposium on Information Theory (ISIT\u201916). 2569\u20132573."},{"key":"e_1_3_1_3_2","first-page":"1","volume-title":"Proceedings of the IEEE Global Communications Conference (GLOBECOM\u201915)","author":"Chen Yanjiao","year":"2015","unstructured":"Yanjiao Chen, Fan Zhang, Kaishun Wu, and Qian Zhang. 2015. QoE-aware dynamic video rate adaptation. In Proceedings of the IEEE Global Communications Conference (GLOBECOM\u201915). 1\u20136."},{"doi-asserted-by":"publisher","key":"e_1_3_1_4_2","DOI":"10.1016\/j.geb.2009.05.004"},{"key":"e_1_3_1_5_2","volume-title":"Proceedings of the IEEE International Conference on Communication Workshop","author":"Chiumento Alessandro","year":"2015","unstructured":"Alessandro Chiumento, Mehdi Bennis, Claude Desset, Andre Bourdoux, Liesbet Van Der Perre, and Sofie Pollin. 2015. Gaussian process regression for CSI and feedback estimation in LTE. In Proceedings of the IEEE International Conference on Communication Workshop."},{"key":"e_1_3_1_6_2","first-page":"131","volume-title":"Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc\u201919)","author":"Hao Shugang","year":"2019","unstructured":"Shugang Hao and Lingjie Duan. 2019. Economics of age of information management under network externalities. In Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc\u201919). 131\u2013140."},{"key":"e_1_3_1_7_2","first-page":"242","volume-title":"Proceedings of the International Conference on Machine Learning (ICML\u201998)","volume":"98","author":"Hu Junling","year":"1998","unstructured":"Junling Hu and Michael P. Wellman. 1998. Multiagent reinforcement learning: Theoretical framework and an algorithm. In Proceedings of the International Conference on Machine Learning (ICML\u201998), Vol. 98. Citeseer, 242\u2013250."},{"doi-asserted-by":"publisher","key":"e_1_3_1_8_2","DOI":"10.5555\/945365.964288"},{"key":"e_1_3_1_9_2","first-page":"1844","volume-title":"Proceedings of the IEEE Conference on Computer Communications (INFOCOM\u201918)","author":"Kadota Igor","year":"2018","unstructured":"Igor Kadota, Abhishek Sinha, and Eytan Modiano. 2018. Optimizing age of information in wireless networks with throughput constraints. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM\u201918). 1844\u20131852."},{"key":"e_1_3_1_10_2","first-page":"2731","volume-title":"Proceedings of the IEEE Conference on Computer Communications (INFOCOM\u201912)","author":"Kaul Sanjit","year":"2012","unstructured":"Sanjit Kaul, Roy Yates, and Marco Gruteser. 2012. Real-time status: How often should one update. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM\u201912). 2731\u20132735."},{"key":"e_1_3_1_11_2","first-page":"118","volume-title":"Proceedings of the IEEE Conference on Computer Communications (INFOCOM\u201919)","author":"Li Chengzhang","year":"2019","unstructured":"Chengzhang Li, Shaoran Li, and Y. Thomas Hou. 2019. A general model for minimizing age of information at network edge. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM\u201919). 118\u2013126."},{"unstructured":"Xiaomin Lin Stephen C. Adams and Peter A. Beling. 2018. Multi-agent Inverse Reinforcement Learning for General-sum Stochastic Games. arXiv preprint arXiv:1806.09795 (2018).","key":"e_1_3_1_12_2"},{"doi-asserted-by":"publisher","key":"e_1_3_1_13_2","DOI":"10.5555\/3091574.3091594"},{"key":"e_1_3_1_14_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-010-0189-2","volume-title":"Stochastic Games and Applications","author":"Neyman Abraham","year":"2003","unstructured":"Abraham Neyman, Sylvain Sorin, and S. Sorin. 2003. Stochastic Games and Applications, Vol. 570. Springer Science & Business Media."},{"key":"e_1_3_1_15_2","first-page":"1371","volume-title":"Proceedings of the International Conference on Autonomous Agents and Multiagent Systems","author":"Prasad H. L.","year":"2015","unstructured":"H. L. Prasad, L. A. Prashanth, and Shalabh Bhatnagar. 2015. Two-timescale algorithms for learning Nash equilibria in general-sum stochastic games. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems. International Foundation for Autonomous Agents and Multiagent Systems, 1371\u20131379."},{"doi-asserted-by":"publisher","key":"e_1_3_1_16_2","DOI":"10.1073\/pnas.39.10.1953"},{"doi-asserted-by":"publisher","key":"e_1_3_1_17_2","DOI":"10.1109\/JSAC.2011.110418"},{"key":"e_1_3_1_18_2","first-page":"2328","volume-title":"Proceedings of the IEEE Conference on Computer Communications (INFOCOM\u201914)","author":"Wang Wei","year":"2014","unstructured":"Wei Wang and Qian Zhang. 2014. A stochastic game for privacy preserving context sensing on mobile phone. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM\u201914). 2328\u20132336."},{"key":"e_1_3_1_19_2","volume-title":"Proceedings of the IEEE International Symposium on Information Theory (ISIT\u201919)","author":"Wang Xuehe","year":"2019","unstructured":"Xuehe Wang and Lingjie Duan. 2019. Dynamic pricing for controlling age of information. In Proceedings of the IEEE International Symposium on Information Theory (ISIT\u201919)."},{"doi-asserted-by":"publisher","key":"e_1_3_1_20_2","DOI":"10.1109\/TNET.2020.2973410"},{"issue":"11","key":"e_1_3_1_21_2","doi-asserted-by":"crossref","first-page":"7492","DOI":"10.1109\/TIT.2017.2735804","article-title":"Update or wait: How to keep your data fresh","volume":"63","author":"Yin Sun","year":"2017","unstructured":"Sun Yin, Elif Uysal-Biyikoglu, Roy D. Yates, C. Emre Koksal, and Ness B. Shroff. 2017. Update or wait: How to keep your data fresh. IEEE Trans. Info. Theory 63, 11 (2017), 7492\u20137508.","journal-title":"IEEE Trans. Info. Theory"},{"key":"e_1_3_1_22_2","volume-title":"Proceedings of the International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT\u201919)","author":"Zhang Meng","year":"2019","unstructured":"Meng Zhang, Ahmed Arafa, Jianwei Huang, and H. Vincent Poor. 2019. How to price fresh data. In Proceedings of the International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT\u201919)."}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3565022","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3565022","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:52Z","timestamp":1750186972000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3565022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,3]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,5,31]]}},"alternative-id":["10.1145\/3565022"],"URL":"https:\/\/doi.org\/10.1145\/3565022","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"type":"print","value":"1550-4859"},{"type":"electronic","value":"1550-4867"}],"subject":[],"published":{"date-parts":[[2023,2,3]]},"assertion":[{"value":"2022-01-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-09-21","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}