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

Author:

Yin Xiaoyan1ORCID,Mi Xiaoqian2ORCID,Yu Sijia3ORCID,Chen Yanjiao4ORCID,Li Baochun5ORCID

Affiliation:

1. 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

2. China Unicom Software Research Institute, Xi’an, China

3. Computer Engineering, State University of New York at Stony Brook, NY, USA

4. College of Electrical Engineering, Zhejiang University, Hangzhou, China

5. Department of Electrical and Computer Engineering, University of Toronto, Toronto, Canada

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.

Funder

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

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications

Reference21 articles.

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. Convergence to approximate Nash equilibria in congestion games

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.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3