Computation power maximization for mobile edge computing enabled dense network

被引:5
作者
Wan, Zheng [1 ]
Dong, Xiaogang [1 ,2 ]
机构
[1] Jiangxi Univ Finance & Econ, Sch Informat & Management, Nanchang 330013, Jiangxi, Peoples R China
[2] Jiujiang Univ, Sch Comp & Big Data Sci, Jiujiang 332005, Jiangxi, Peoples R China
关键词
Mobile edge computing; Computation power maximization; Restricted multiple knapsack problem; Differential evolution; BINARY DIFFERENTIAL EVOLUTION; KNAPSACK-PROBLEMS; ALGORITHM;
D O I
10.1016/j.comnet.2022.109458
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
High-density connection is among the natures of next-generation wireless communication systems. Meanwhile, various computation-intensive smart applications are becoming growing popularity with the technology boom. Thus, strong computation power will become a crucial requirement for wireless communication systems. Mobile edge computing provides a promising solution to this requirement by pushing a cloud-like computation capacity to the network edge. This study aims to maximize the computation power of a mobile edge computing enabled dense network. To this end, a computation bits maximization problem is formulated by jointly optimizing offloading decision and resource allocation. The problem is a mixed-variable nonlinear programming problem. First, by analyzing the feasibility of computation modes and constructing a user distribution strategy, the original problem is decoupled into two sub-problems, i.e., the assignment of the offloading users and resource allocation. The offloading users' assignment is modeled as a restricted multiple knapsack problem, and a profit density is defined to maximize the overall profits of multiple knapsacks. Then, an improved differential evolution algorithm is developed to address the knapsack problem, in which mutation and repair operators are designed according to the profit density. Based on the optimal solution to the knapsack problem, the resource allocation sub-problem is solved by the corresponding calculation. Finally, extensive experiments are conducted to evaluate the performance of our scheme. Results show that: (1) our scheme provides superior computation power compared to that of benchmark schemes; (2) the performance gain of our scheme over benchmark schemes expands with growing connection density. Therefore, our scheme is an effective computation power optimization scheme.
引用
收藏
页数:15
相关论文
共 59 条
[11]   Energy Efficient Dynamic Offloading in Mobile Edge Computing for Internet of Things [J].
Chen, Ying ;
Zhang, Ning ;
Zhang, Yongchao ;
Chen, Xin ;
Wu, Wen ;
Shen, Xuemin .
IEEE TRANSACTIONS ON CLOUD COMPUTING, 2021, 9 (03) :1050-1060
[12]   Joint Task Offloading and Resource Allocation for Mobile Edge Computing in Ultra-Dense Network [J].
Cheng, Zhipeng ;
Min, Minghui ;
Gao, Zhibin ;
Huang, Lianfen .
2020 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2020,
[13]   An iterative dynamic programming approach for the temporal knapsack problem [J].
Clautiaux, F. ;
Detienne, B. ;
Guillot, G. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 293 (02) :442-456
[14]   Partial Computation Offloading in NOMA-Assisted Mobile-Edge Computing Systems Using Deep Reinforcement Learning [J].
Dat, Van Tuong ;
Truong, Thanh Phung ;
Nguyen, The-Vi ;
Noh, Wonjong ;
Cho, Sungrae .
IEEE INTERNET OF THINGS JOURNAL, 2021, 8 (17) :13196-13208
[15]   Mathematical models and decomposition methods for the multiple knapsack problem [J].
Dell'Amico, Mauro ;
Delorme, Maxence ;
Iori, Manuel ;
Martello, Silvano .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 274 (03) :886-899
[16]   A new upper bound for the multiple knapsack problem [J].
Detti, Paolo .
COMPUTERS & OPERATIONS RESEARCH, 2021, 129
[17]   Learning for Computation Offloading in Mobile Edge Computing [J].
Dinh, Thinh Quang ;
La, Quang Duy ;
Quek, Tony Q. S. ;
Shin, Hyundong .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (12) :6353-6367
[18]   An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem [J].
Furini, Fabio ;
Ljubic, Ivana ;
Sinnl, Markus .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 262 (02) :438-448
[19]   Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem [J].
Galli, Laura ;
Martello, Silvano ;
Rey, Carlos ;
Toth, Paolo .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 291 (03) :871-882
[20]   Mean Field Evolutionary Dynamics in Dense-User Multi-Access Edge Computing Systems [J].
Gao, Hao ;
Li, Wuchen ;
Banez, Reginald A. ;
Han, Zhu ;
Poor, H. Vincent .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2020, 19 (12) :7825-7835