Efficient Resource Allocation for Relay-Assisted Computation Offloading in Mobile-Edge Computing

被引:50
作者
Chen, Xihan [1 ]
Cai, Yunlong [1 ]
Shi, Qingjiang [2 ]
Zhao, Minjian [1 ]
Champagne, Benoit [3 ]
Hanzo, Lajos [4 ]
机构
[1] Zhejiang Univ, Dept Informat Sci & Elect Engn, Hangzhou 310000, Peoples R China
[2] Tongji Univ, Sch Software Engn, Shanghai 201804, Peoples R China
[3] McGill Univ, Dept Elect & Comp Engn, Montreal, PQ H3A 0E9, Canada
[4] Univ Southampton, Dept Elect & Comp Sci, Southampton SO17 1BJ, Hants, England
基金
英国工程与自然科学研究理事会; 欧洲研究理事会; 中国国家自然科学基金;
关键词
Concave-convex procedure (CCCP); computation offloading; hybrid relaying (HR); inexact block coordinate descent (IBCD); mobile-edge computing (MEC); resource allocation; OPTIMIZATION; PROTOCOLS; NETWORKS;
D O I
10.1109/JIOT.2019.2957728
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this article, relay-assisted computation offloading (RACO) is investigated, where user wishes to share the results of computational tasks with another user with the assistance of a mobile-edge relay server (MERS). To enable this computation offloading, we propose a hybrid relaying (HR) approach employing a pair of orthogonal frequency bands, which are, respectively, used for the amplify-forward relaying of computational results and the decode-forward relaying of the unprocessed raw tasks. The motivation here is to adapt the allocation of computing and communication resources both to dynamic user requirements and to diverse computational tasks. Using this framework, we seek to minimize the weighted sum of the execution delays and the energy consumption in the RACO system by jointly optimizing the computation offloading ratio, the bandwidth allocation, the processor speeds, as well as the transmit power levels of both user and the MERS, under some practical constraints. By adopting a series of transformations, we first recast this problem into a form amenable to optimization and then develop an efficient iterative algorithm for its solution based on the concave-convex procedure (CCCP). By virtue of the particular problem structure in our case, we propose furthermore a simplified algorithm based on the inexact block coordinate descent (IBCD) method, which leads us to much lower computational complexity. Finally, our numerical results demonstrate the advantages of the proposed algorithms over the state-of-the-art benchmark schemes.
引用
收藏
页码:2452 / 2468
页数:17
相关论文
共 41 条
[1]   Social Networking and Caching Aided Collaborative Computing for the Internet of Things [J].
Ai, Yutong ;
Wang, Li ;
Han, Zhu ;
Zhang, Ping ;
Hanzo, Lajos .
IEEE COMMUNICATIONS MAGAZINE, 2018, 56 (12) :149-155
[2]  
[Anonymous], 2009, Advances in neural information processing systems
[3]  
[Anonymous], 2017, 3GPP Standard TS 36.814
[4]  
[Anonymous], CVX MATLAB SOFTWARE
[5]  
[Anonymous], CISC VIS NETW IND FO
[6]  
[Anonymous], MOB EDG COMP INTR TE
[7]  
Barbarossa S, 2017, IEEE INT CONF COMM, P367, DOI 10.1109/ICCW.2017.7962685
[8]   A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems [J].
Beck, Amir ;
Teboulle, Marc .
SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01) :183-202
[9]  
Bertsekas D. P., 1999, Nonlinear Programming
[10]   A Survey on Cloud Gaming: Future of Computer Games [J].
Cai, Wei ;
Shea, Ryan ;
Huan, Chun-Ying ;
Chen, Kuan-Ta ;
Liu, Jiangchuan ;
Leung, Victor C. M. ;
Hsu, Cheng-Hsin .
IEEE ACCESS, 2016, 4 :7605-7620