4.7 Article

Analysis on Computation-Intensive Status Update in Mobile Edge Computing

期刊

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
卷 69, 期 4, 页码 4353-4366

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TVT.2020.2974816

关键词

Age-of-information; mobile edge computing; computation-intensive

资金

  1. State's Key Project of Research and Development Plan [2017YFE0112600, 2017YFE0121300-6]
  2. NSFC [61771495]
  3. Science and Technology Program of Guangzhou [201707010166]
  4. Guangdong R&D Project in Key Areas [2019B010156004]
  5. Guangdong Provincial Special Fund For Modern Agriculture Industry Technology Innovation Teams [2019KJ122]

向作者/读者索取更多资源

In status update scenarios, the freshness of information is measured in terms of age-of-information (AoI), which essentially reflects the timeliness for real-time applications to transmit status update messages to a remote controller. For some applications, computational expensive and time consuming data processing is inevitable for status information of messages to be displayed. Mobile edge servers are equipped with adequate computation resources and they are placed close to users. Thus, mobile edge computing (MEC) can be a promising technology to reduce AoI for computation-intensive messages. In this paper, we study the AoI for computation-intensive messages with MEC, and consider three computing schemes: local computing, remote computing at the MEC server, and partial computing, i.e., some part of computing tasks are performed locally, and the rest is executed at the MEC server. Zero-wait policy is adopted in all three schemes. Specifically, in local computing, a new message is generated immediately after the previous one is revealed by computing. While in remote computing and partial computing, a new message is generated once the previous one is received by the remote MEC server. With infinite queue size and exponentially distributed transmission time, closed-form average AoI for exponentially distributed computing time is derived for the three computing schemes. For deterministic computing time, the average AoI is analyzed numerically. Simulation results show that by carefully partitioning the computing tasks, the average AoI in partial computing is the smallest compared to local computing and remote computing. The results also indicate numerically the conditions on which remote computing attains smaller average AoI compared with local computing.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据