skip to main content
research-article

Harmony or Involution: Game Inspiring Age-of-Information Optimization for Edge Data Gathering in Internet of Things

Published: 03 February 2023 Publication History

Abstract

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 ϵ-Nash learning algorithm, which adopts the θ-greedy exploration strategy, to derive the ϵ-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.

References

[1]
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’16). 2569–2573.
[2]
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’15). 1–6.
[3]
Steve Chien and Alistair Sinclair. 2011. Convergence to approximate nash equilibria in congestion games. Games Econ. Behav. 71, 2 (2011), 315–327.
[4]
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.
[5]
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’19). 131–140.
[6]
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’98), Vol. 98. Citeseer, 242–250.
[7]
Junling Hu and Michael P. Wellman. 2003. Nash Q-learning for general-sum stochastic games. J. Mach. Learn. Res. 4 (Nov. 2003), 1039–1069.
[8]
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’18). 1844–1852.
[9]
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’12). 2731–2735.
[10]
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’19). 118–126.
[11]
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).
[12]
Michael L. Littman. 1994. Markov games as a framework for multi-agent reinforcement learning. In Proceedings of the 11th International Conference on Machine Learning. Elsevier, 157–163.
[13]
Abraham Neyman, Sylvain Sorin, and S. Sorin. 2003. Stochastic Games and Applications, Vol. 570. Springer Science & Business Media.
[14]
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–1379.
[15]
Lloyd S. Shapley. 1953. Stochastic games. Proc. Natl. Acad. Sci. U.S.A. 39, 10 (1953), 1095–1100.
[16]
Beibei Wang, Yongle Wu, K. J. Ray Liu, and T. Charles Clancy. 2011. An anti-jamming stochastic game for cognitive radio networks. IEEE J. Select. Areas Commun. 29, 4 (2011), 877–889.
[17]
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’14). 2328–2336.
[18]
Xuehe Wang and Lingjie Duan. 2019. Dynamic pricing for controlling age of information. In Proceedings of the IEEE International Symposium on Information Theory (ISIT’19).
[19]
Shuangke Wu, Yanjiao Chen, Minghui Li, Xiangyang Luo, Zhe Liu, and Lan Liu. 2020. Survive and thrive: A stochastic game for DDoS attacks in bitcoin mining pools. IEEE/ACM Trans. Netw. 28, 2 (2020), 874–887.
[20]
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–7508.
[21]
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’19).

Cited By

View all

Index Terms

  1. Harmony or Involution: Game Inspiring Age-of-Information Optimization for Edge Data Gathering in Internet of Things

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Transactions on Sensor Networks
      ACM Transactions on Sensor Networks  Volume 19, Issue 2
      May 2023
      599 pages
      ISSN:1550-4859
      EISSN:1550-4867
      DOI:10.1145/3575873
      Issue’s Table of Contents

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Journal Family

      Publication History

      Published: 03 February 2023
      Online AM: 29 September 2022
      Accepted: 21 September 2022
      Revised: 24 August 2022
      Received: 06 January 2022
      Published in TOSN Volume 19, Issue 2

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. Age-of-Information
      2. game theory
      3. learning
      4. Internet of Things

      Qualifiers

      • Research-article
      • Refereed

      Funding Sources

      • National Key Research and Development Program of China
      • National Natural Science Foundation of China
      • Shaanxi Natural Science Foundation
      • Open Foundation of State key Laboratory of Networking and Switching Technology (Beijing University of Posts and Telecommunications)

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)103
      • Downloads (Last 6 weeks)9
      Reflects downloads up to 15 Sep 2024

      Other Metrics

      Citations

      Cited By

      View all

      View Options

      Get Access

      Login options

      Full Access

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Full Text

      View this article in Full Text.

      Full Text

      HTML Format

      View this article in HTML Format.

      HTML Format

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media