TY - JOUR
T1 - Nonlinear Online Incentive Mechanism Design in Edge Computing Systems With Energy Budget
AU - Li, Gang
AU - Cai, Jun
AU - Chen, Xianfu
AU - Su, Zhou
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2023/7/1
Y1 - 2023/7/1
N2 - In this paper, we consider task offloading in edge computing systems, where tasks are offloaded by the base station to resourceful mobile users. With the consideration of unique characteristics in practical edge computing systems, such as dynamic arrival of computation tasks, and energy constraints at battery-powered mobile users, we formulate an incentive mechanism design problem by jointly optimizing task offloading decisions, and allocation of both communications (i.e., power and bandwidth), and computation resources. In order to tackle the nonlinear issue in the designed mechanism, a novel online incentive mechanism is proposed. We first convert the original mechanism design problem into several one-shot design problems by temporally removing the energy constraint. Then, we propose a new mechanism design framework, called the Integrate Rounding Scheme based Maxima-indistributional Range (IRSM), and based on that, design a new incentive mechanism for each one-shot problem. Finally, we reconsider energy constraints to design a new nonlinear online incentive mechanism by rationally combining the previously derived one-shot ones. Theoretical analyses show that our proposed nonlinear online incentive mechanism can guarantee individual rationality, truthfulness, a sound competitive ratio, and computational efficiency. We further conduct comprehensive simulations to validate the effectiveness and superiority of our proposed mechanism.
AB - In this paper, we consider task offloading in edge computing systems, where tasks are offloaded by the base station to resourceful mobile users. With the consideration of unique characteristics in practical edge computing systems, such as dynamic arrival of computation tasks, and energy constraints at battery-powered mobile users, we formulate an incentive mechanism design problem by jointly optimizing task offloading decisions, and allocation of both communications (i.e., power and bandwidth), and computation resources. In order to tackle the nonlinear issue in the designed mechanism, a novel online incentive mechanism is proposed. We first convert the original mechanism design problem into several one-shot design problems by temporally removing the energy constraint. Then, we propose a new mechanism design framework, called the Integrate Rounding Scheme based Maxima-indistributional Range (IRSM), and based on that, design a new incentive mechanism for each one-shot problem. Finally, we reconsider energy constraints to design a new nonlinear online incentive mechanism by rationally combining the previously derived one-shot ones. Theoretical analyses show that our proposed nonlinear online incentive mechanism can guarantee individual rationality, truthfulness, a sound competitive ratio, and computational efficiency. We further conduct comprehensive simulations to validate the effectiveness and superiority of our proposed mechanism.
KW - Edge computing
KW - online nonlinear incentive mechanism
KW - social welfare maximization
KW - task offloading
UR - https://www.scopus.com/pages/publications/85124202677
U2 - 10.1109/TMC.2022.3148034
DO - 10.1109/TMC.2022.3148034
M3 - 文章
AN - SCOPUS:85124202677
SN - 1536-1233
VL - 22
SP - 4066
EP - 4102
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 7
ER -