Freshness-Aware Information Update and Computation Offloading in Mobile-Edge Computing

被引:20
作者
Ma, Xiao [1 ]
Zhou, Ao [1 ]
Sun, Qibo [1 ]
Wang, Shangguang [1 ]
机构
[1] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China
基金
美国国家科学基金会;
关键词
Sensors; Task analysis; Optimization; Bandwidth; Channel allocation; Wireless sensor networks; Wireless communication; computation offloading; edge computing; information update; INTERNET; THINGS; AGE;
D O I
10.1109/JIOT.2021.3082281
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Mobile-edge computing is a promising computing paradigm with the advantages of reduced delay and relieved outsourcing traffic to the core network. In mobile-edge computing, reducing the computation offloading cost of mobile users and maintaining fresh information at edge nodes are two critical while conflicted objectives, as both consume the limited wireless bandwidth of edge nodes. Although extensive efforts have been devoted to optimizing computation offloading decisions and some works have investigated freshness-aware channel allocation issues recently, no prior works have considered the above conflict. This article is the first work to jointly optimize the channel allocation and computation offloading decisions, aiming at reducing the computation offloading cost within freshness requirements of sensors. We analyze the recursiveness of Age of Information (AoI) in analogy to the evolvement of a queue and formulate the problem as a nonlinear integer dynamic optimization problem. To overcome the challenges of AoI-computation cost tradeoff, AoI time dependency and high complexity caused by the heterogeneity of users, we propose an algorithm to solve the problem with reduced computation complexity. Specifically, we first transform the original problem into a static optimization problem in each time slot (which is NP-hard) based on Lyapunov optimization techniques. To reduce the computation complexity, we exploit the finite improvement property of potential games and further enforce centralized control to reduce the number of improvement iterations. Simulations have been conducted and the results demonstrate that the proposed algorithm shows good effectiveness and scalability.
引用
收藏
页码:13115 / 13125
页数:11
相关论文
共 32 条
  • [1] Balasubramanian N, 2009, IMC'09: PROCEEDINGS OF THE 2009 ACM SIGCOMM INTERNET MEASUREMENT CONFERENCE, P280
  • [2] Barbera MV, 2013, IEEE INFOCOM SER, P1285
  • [3] Champati J. P., 2020, MINIMUM ACHIEVABLE A
  • [4] Computation Peer Offloading for Energy-Constrained Mobile Edge Computing in Small-Cell Networks
    Chen, Lixing
    Zhou, Sheng
    Xu, Jie
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2018, 26 (04) : 1619 - 1632
  • [5] Age of Information Aware Radio Resource Management in Vehicular Networks: A Proactive Deep Reinforcement Learning Perspective
    Chen, Xianfu
    Wu, Celimuge
    Chen, Tao
    Zhang, Honggang
    Liu, Zhi
    Zhang, Yan
    Bennis, Mehdi
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2020, 19 (04) : 2268 - 2281
  • [6] Efficient Multi-User Computation Offloading for Mobile-Edge Cloud Computing
    Chen, Xu
    Jiao, Lei
    Li, Wenzhong
    Fu, Xiaoming
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (05) : 2827 - 2840
  • [7] Decentralized Computation Offloading Game for Mobile Cloud Computing
    Chen, Xu
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2015, 26 (04) : 974 - 983
  • [8] Corneo L, 2019, IEEE INFOCOM SER, P2476, DOI [10.1109/infocom.2019.8737497, 10.1109/INFOCOM.2019.8737497]
  • [9] A Theory of QoS for Wireless
    Hou, I-Hong
    Borkar, Vivek
    Kumar, P. R.
    [J]. IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, : 486 - +
  • [10] A Dynamic Offloading Algorithm for Mobile Computing
    Huang, Dong
    Wang, Ping
    Niyato, Dusit
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2012, 11 (06) : 1991 - 1995