A Task Offloading Method Based on User Satisfaction in C-RAN With Mobile Edge Computing

IEEE TRANSACTIONS ON MOBILE COMPUTING(2024)

引用 0|浏览3
暂无评分
摘要
With the continuous development of the communication service industry, users pay more attention to the quality of network service. Previous studies on offloading problems, especially in the Cloud Radio Access Network (C-RAN) architecture with Mobile Edge Computing (MEC), are primarily focused on the economic perspective, with little consideration given to user-oriented satisfaction problems. To fill this gap, this article proposes a mathematical model for maximizing user satisfaction in the C-RAN architecture with multi-layer MEC. The problem is divided into two stages for solution. The first stage addresses the optimal connection problem between users and Remote Radio Heads (RRHs). The second stage then schedules user tasks reasonably based on the solution obtained in the first stage. The two-stage problems are all proved to be NP-Hard. Two efficient approximation algorithms, namely User-to-RRH Association Algorithm (URAA) and Maximum Satisfaction Algorithm (MSA), are proposed to solve the problems in different stages. This article proves and analyzes the theoretical performance of the two algorithms. Finally, the performance of the proposed algorithms is verified by simulation experiments. The experimental results demonstrate that the two proposed algorithms can achieve reasonable solutions to the problems, and the user satisfaction level can be maintained at a high level.
更多
查看译文
关键词
Computer architecture,Task analysis,Approximation algorithms,Mobile handsets,Servers,Mathematical models,Delays,Approximation algorithm,cloud radio access network,mobile edge computing,task offloading,user statisfaction
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要