A Dynamic Multi-Attribute Resource Bidding Mechanism with Privacy Protection in Edge Computing  

作　　者：Shujuan Tian Wenjian Ding Gang Liu Yuxia Sun Saiqin Long Jiang Zhu 

机构地区：[1]Xiangtan University,Xiangtan,411105,China [2]Key Laboratory of Hunan Province for Internet of Things and Information Security,Xiangtan,411105,China [3]Hunan International Scientific and Technological Cooperation Base of Intelligent Network,Xiangtan,411105,China [4]Hunan University,Changsha,410082,China [5]Jinan University,Guangzhou,510632,China

出　　处：《Computers, Materials & Continua》2023年第4期373-391,共19页计算机、材料和连续体（英文）

基　　金：supported in part by National Natural Science Foundation of China under Grant No.62172349,62032020,and 62172350;the Research Foundation of Education Bureau of Hunan Province under Grant No.21B0139;the National Key Research and Development Program of China under Grant 2021YFB3101200;Hunan Science and Technology Planning Project under Grant No.2019RS3019.

摘　　要：In edge computing,a reasonable edge resource bidding mechanism can enable edge providers and users to obtain benefits in a relatively fair fashion.To maximize such benefits,this paper proposes a dynamic multiattribute resource bidding mechanism(DMRBM).Most of the previous work mainly relies on a third-party agent to exchange information to gain optimal benefits.It isworth noting thatwhen edge providers and users trade with thirdparty agents which are not entirely reliable and trustworthy,their sensitive information is prone to be leaked.Moreover,the privacy protection of edge providers and users must be considered in the dynamic pricing/transaction process,which is also very challenging.Therefore,this paper first adopts a privacy protection algorithm to prevent sensitive information from leakage.On the premise that the sensitive data of both edge providers and users are protected,the prices of providers fluctuate within a certain range.Then,users can choose appropriate edge providers by the price-performance ratio(PPR)standard and the reward of lower price(LPR)standard according to their demands.The two standards can be evolved by two evaluation functions.Furthermore,this paper employs an approximate computing method to get an approximate solution of DMRBM in polynomial time.Specifically,this paper models the bidding process as a non-cooperative game and obtains the approximate optimal solution based on two standards according to the game theory.Through the extensive experiments,this paper demonstrates that the DMRBM satisfies the individual rationality,budget balance,and privacy protection and it can also increase the task offloading rate and the system benefits.

关 键 词：Edge computing approximate computing nash equilibrium privacy protection 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]