Truthful mechanism for joint resource allocation and task offloading in mobile edge computing

被引:2
作者
Liu, Xi [1 ,2 ]
Liu, Jun [3 ]
Li, Weidong [4 ]
机构
[1] Qujing Normal Univ, Sch Informat Engn, Key Lab Intelligent Sensor & Syst Design, Qujing, Yunnan, Peoples R China
[2] Qujing Normal Univ, Engn Res Ctr Intelligent Syst & Adv Mat Yunnan Pro, Qujing, Yunnan, Peoples R China
[3] Yunnan Coll Business Management, Sch Educ, Kunming, Yunnan, Peoples R China
[4] Yunnan Univ, Sch Math & Stat, Kunming, Yunnan, Peoples R China
关键词
Mobile edge computing; Truthfulness; Energy consumption; Algorithm design; Polynomial time approximation scheme; ALGORITHMS;
D O I
10.1016/j.comnet.2024.110796
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In the context of mobile edge computing (MEC), the delay-sensitive tasks can achieve real-time data processing and analysis by offloading to the MEC servers. The objective is maximizing social welfare in an auction- based model. However, the distances between mobile devices and access points lead to differences in energy consumption. Unfortunately, existing works have not considered both maximizing social welfare and minimizing energy consumption. Motivated by this, we address the problem of joint resource allocation and task offloading in MEC, with heterogeneous MEC servers providing multiple types of resources for mobile devices (MDs) to perform tasks remotely. We split the problem into two sub-problems: winner determination and offloading decision. The first sub-problem determines winners granted the ability to offload tasks to maximize social welfare. The second sub-problem determines how to offload tasks among the MEC servers to minimize energy consumption. In the winner determination problem, we propose a truthful algorithm that drives the system into equilibrium. We then show the approximate ratios for single and multiple MEC servers. In the offloading decision problem, we propose an approximation algorithm. We then show it is a polynomial- time approximation scheme for a single MEC server. Experiment results show that our proposed mechanism finds high-quality solutions in changing mobile environments.
引用
收藏
页数:14
相关论文
共 37 条
[1]   Task offloading paradigm in mobile edge computing-current issues, adopted approaches, and future directions [J].
Akhlaqi, Mohammad Yahya ;
Hanapi, Zurina Binti Mohd .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2023, 212
[2]  
[Anonymous], 1971, Public choice, DOI DOI 10.1007/BF01726210
[3]   Mechanisms for Resource Allocation and Pricing in Mobile Edge Computing Systems [J].
Bahreini, Tayebeh ;
Badri, Hossein ;
Grosu, Daniel .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2022, 33 (03) :667-682
[4]   Approximation algorithms for knapsack problems with cardinality constraints [J].
Caprara, A ;
Kellerer, H ;
Pferschy, U ;
Pisinger, D .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 123 (02) :333-345
[5]  
Chekuri C, 2009, LECT NOTES COMPUT SC, V5687, P56, DOI 10.1007/978-3-642-03685-9_5
[6]   End-to-End Service Auction: A General Double Auction Mechanism for Edge Computing Services [J].
Chen, Xianhao ;
Zhu, Guangyu ;
Ding, Haichuan ;
Zhang, Lan ;
Zhang, Haixia ;
Fang, Yuguang .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2022, 30 (06) :2616-2629
[7]   Efficient Multi-Task Computation Offloading Game for Mobile Edge Computing [J].
Chu, Shuhui ;
Gao, Chengxi ;
Xu, Minxian ;
Ye, Kejiang ;
Xiao, Zhu ;
Xu, Chengzhong .
IEEE TRANSACTIONS ON SERVICES COMPUTING, 2024, 17 (01) :30-46
[8]   Truthful randomized mechanisms for combinatorial auctions [J].
Dobzinski, Shahar ;
Nisan, Noam ;
Schapira, Michael .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2012, 78 (01) :15-25
[9]   INCENTIVES IN TEAMS [J].
GROVES, T .
ECONOMETRICA, 1973, 41 (04) :617-631
[10]   Incentive-Driven Task Allocation for Collaborative Edge Computing in Industrial Internet of Things [J].
Hou, Wenjing ;
Wen, Hong ;
Zhang, Ning ;
Wu, Jinsong ;
Lei, Wenxin ;
Zhao, Runhui .
IEEE INTERNET OF THINGS JOURNAL, 2022, 9 (01) :706-718