4.8 Article

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

Journal

IEEE INTERNET OF THINGS JOURNAL
Volume 8, Issue 16, Pages 13115-13125

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JIOT.2021.3082281

Keywords

Sensors; Task analysis; Optimization; Bandwidth; Channel allocation; Wireless sensor networks; Wireless communication; Channel allocation; computation offloading; edge computing; information update

Funding

  1. National Key Research and Development Program of China [2018YFE0205503]
  2. National Science Foundation of China [61902036, 61922017, 61921003]
  3. Fundamental Research Funds for the Central Universities
  4. Open Research Fund of Key Laboratory of Space Utilization, Chinese Academy of Sciences [LSU-KFJJ-2019-03]

Ask authors/readers for more resources

Mobile-edge computing is a promising paradigm that aims to reduce delay and outsourcing traffic, but addressing the conflict between computation offloading cost and maintaining fresh information is a challenge. The proposed algorithm in this article jointly optimizes channel allocation and computation offloading decisions in order to reduce computation offloading cost while meeting freshness requirements.
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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available