Journal of Computer Applications ›› 2019, Vol. 39 ›› Issue (9): 2664-2668.DOI: 10.11772/j.issn.1001-9081.2019030509

• Network and communications • Previous Articles     Next Articles

Content offloading scheme of greedy strategy in mobile edge computing system

YUAN Peiyan, CAI Yunyun   

  1. College of Computer and Information Engineering, Henan Normal University, Xinxiang Henan 453007, China
  • Received:2019-03-27 Revised:2019-05-14 Online:2019-09-10 Published:2019-09-10
  • Supported by:

    This work is partially supported by the National Natural Science Foundation of China (U1804164, U1404602), the Science and Technology Foundation of Henan Province (172102210341).


袁培燕, 蔡云云   

  1. 河南师范大学 计算机与信息工程学院, 河南 新乡 453007
  • 通讯作者: 袁培燕
  • 作者简介:袁培燕(1978-),男,河南邓州人,副教授,博士,CCF高级会员,主要研究方向:移动网络、无线通信;蔡云云(1994-),女,河南安阳人,硕士研究生,主要研究方向:移动边缘计算。
  • 基金资助:



Content offloading technology based on mobile edge computing can effectively reduce the traffic pressure on the backbone network and improve the end user's experience. A content offloading scheme of greedy strategy was designed for the heterogeneous contact rate between end users and small base stations. Firstly, the content optimal offloading problem was transformed into the content maximum delivery rate problem. Secondly, the maximum delivery rate problem was proved to satisfy the submodularity. On this basis, the greedy algorithm was used to deploy the content. The algorithm was able to guarantee its optimality with the probability (1-1/e). Finally, the impacts of content popularity index and cache size on different offloading schemes were analyzed in detail. The experimental results show that the proposed scheme improves the content delivery rate and reduces the content transmission delay at the same time.

Key words: mobile edge computing, delivery rate, content offloading, submodularity, greedy algorithm



关键词: 移动边缘计算, 投递率, 内容卸载, 子模性, 贪心算法

CLC Number: