A Novel Privacy-Preserving Incentive Mechanism for Multi-Access Edge Computing
The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Abstract
Multi-access Edge Computing (MEC) has emerged as a promising solution for computation-intensive and latency-sensitive applications. Existing studies have often overlooked the critical aspect of users’ privacy, hindering users from offloading their computation. This paper proposes a novel privacy-preserving mechanism for a two-level auction game aimed at incentivizing cloudlets and users to engage in computation offloading while safeguarding users’ privacy. A many-to-many auction is designed between Data Center Operators (DCOs) and cloudlets to associate the cloudlets with the DCOs, where the perceivable privacy levels of users are parametrized as part of a DCO’s utility. A many-to-one user-DCO auction is also designed, leveraging differential privacy (DP) to protect the users’ private bid information. An exponential mechanism is developed, obfuscating intermediate reference prices disclosed during auctions by the DCOs, thereby safeguarding users’ valuations, bid prices, and bidding behaviors. We prove that the proposed approach can guarantee DP, truthfulness, and equilibriums. Simulations demonstrate the superiority of the privacy-preserving two-layer auction game in reducing time delay and energy consumption while protecting the privacy of the users, surpassing the benchmark. The proposed mechanism effectively incentivizes computation offloading, making it a compelling choice for facilitating computation-intensive tasks.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The integration of blockchain establishes a decentralized ledger where all data transactions are permanently recorded15.”
From Blockchain-based secure MEC model for VANETs using hybrid networks (2025) · cites this paper as [15]
Citations
Cites
Mechanism Design via Differential Privacy
McSherry, F., & Talwar, K. (2007) · 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) · doi:10.1109/focs.2007.66 · Cited by 1,371
Smart Resource Allocation for Mobile Edge Computing: A Deep Reinforcement Learning Approach
Wang, J., Zhao, L., Liu, J., & Kato, N. (2021) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2019.2902661 · Cited by 451 · cited 1×
“In [12], a novel Deep Reinforcement Learning-based Resource Allocation (DRLRA) was introduced to dynamically allocate computing and network resources, thereby diminishing the average service time and maintaining a balance in resource utilization amidst fast-changing MEC environments.”
BackgroundCollaborative Computation Offloading for Multiaccess Edge Computing Over Fiber–Wireless Networks
Guo, H., & Liu, J. (2018) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2018.2790421 · Cited by 411
The composition theorem for differential privacy
Kairouz, P., Oh, S., & Viswanath, P. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2685505 · Cited by 408 · cited 1×
“As a result, we have According to Composition Theorem [36], the proposed mechanism M = ( M 1 , . . . (cid:2) , M Λ ) satisfies (cid:4) -DP, and (cid:4) = Λ λ =1 (cid:4) λ .”
Survey on Multi-Access Edge Computing Security and Privacy
Ranaweera, P., Jurcut, A. D., & Liyanage, M. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3062546 · Cited by 356 · cited 1×
“Multi-access edge computing (MEC), named by the European Telecommunications Standards Institute (ETSI) Industry Specification Group, has arisen in support of the dramatically improved workload [1].”
BackgroundMobile-Edge Computation Offloading for Ultradense IoT Networks
Guo, H., Liu, J., Zhang, J., Sun, W., & Kato, N. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2838584 · Cited by 308 · cited 1×
“Many studies have aimed to incentivize computation offloading and resource allocation in MEC [5], [6], [7].”
BackgroundOptimal Schedule of Mobile Edge Computing for Internet of Things Using Partial Information
Lyu, X., Ni, W., Tian, H., Liu, R. P., Wang, X., Giannakis, G. B., & Paulraj, A. (2017) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2017.2760186 · Cited by 251 · cited 1×
“It differs from mobile edge computing (which, involving Wi-Fi or other fixed access technologies, is also abbreviated to MEC, sometimes) [2].”
BackgroundSelf-citationMulti-Objective Parallel Task Offloading and Content Caching in D2D-aided MEC Networks
Xiao, Z., Shu, J., Jiang, H., Lui, J. C. S., Min, G., Liu, J., & Dustdar, S. (2022) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2022.3199876 · Cited by 173 · cited 1×
“From the perspective of the DCOs, we propose the winner selection process based on the knapsack algorithm [30].”
MethodMulti-agent reinforcement learning for resource allocation in IoT networks with edge computing
Liu, X., Yu, J., Feng, Z., & Gao, Y. (2020) · China Communications · doi:10.23919/jcc.2020.09.017 · Cited by 128 · cited 1×
“In [8], users acted as agents in a multi-agent reinforcement learning algorithm to address a resource allocation problem in MEC.”
BackgroundApplications of Auction and Mechanism Design in Edge Computing: A Survey
Qiu, H., Zhu, K., Luong, N. C., Yi, C., Niyato, D. T., & Kim, D. I. (2022) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2022.3147196 · Cited by 123
Combinational Auction-Based Service Provider Selection in Mobile Edge Computing Networks
Zhang, H., Guo, F., Ji, H., & Zhu, C. (2017) · IEEE Access · doi:10.1109/access.2017.2721957 · Cited by 116 · cited 1×
“We set P ln = 10 − 11 N ln empirically based on measurement results, e.g., reported in [25].”
MethodMaschler, M., Solan, E., & Zamir, S. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108636049 · Cited by 108
An auction-based strategy for distributed task allocation in wireless sensor networks
Edalat, N., Tham, C.-K., & Xiao, W. (2012) · Computer Communications · doi:10.1016/j.comcom.2012.02.004 · Cited by 105 · cited 1×
“Definition 3: Budget balance means that the DCOs’ income must be non-negative, that is, the DCOs’ revenue must be no lower than the payment to the cloudlets [32].”
BackgroundTrading Data For Learning: Incentive Mechanism For On-Device Federated Learning
Hu, R., & Gong, Y. (2020) · Globecom · doi:10.1109/globecom42002.2020.9322475 · Cited by 100 · cited 1×
“The authors of [15] adopted game theory to design an incentive mechanism for an on-device federated learning model with a two-stage Stackelberg game to incentivize users and compensate for the users’ privacy leakage.”
MethodGuo, M., Wang, W., Huang, X., Chen, Y., Zhang, L., & Chen, L. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3118016 · Cited by 100 · cited 1×
“The authors of [10] discussed partial computation offloading in an MEC system with a focus on harvested energy, and formulated a nonconvex optimization problem and solved it asymptotically using Lyapunov optimization.”
MethodDistributed Reinforcement Learning for Privacy-Preserving Dynamic Edge Caching
Liu, S., Zheng, C., Huang, Y., & Quek, T. Q. S. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2022.3142348 · Cited by 87 · cited 1×
“Further, the authors of [17] applied distributed reinforcement learning (RL) to privacy-preserving frameworks in a dynamic edge caching MEC model.”
BackgroundPham, X., Huynh‐The, T., Huh, E., & Kim, D. (2022) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2022.3182378 · Cited by 83
Amplitude-Varying Perturbation for Balancing Privacy and Utility in Federated Learning
Yuan, X., Ni, W., Ding, M., Wei, K., Li, J., & Poor, H. V. (2023) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2023.3258255 · Cited by 80 · cited 1×
“Definition 1 ( (cid:4) -DP [26]): A mechanism M : X → R that has a domain of X and a range of R meets (cid:4) -DP, as long as for any two data profiles D 1 ∈ X and D 2 ∈ X differing in only one element, and all subset S ⊆ R .”
BackgroundSelf-citationPeace: Privacy-Preserving and Cost-Efficient Task Offloading for Mobile-Edge Computing
He, X., Jin, R., & Dai, H. (2019) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2958091 · Cited by 75 · cited 1×
“We consider an inference attack that is a widely observed external attack to MEC [28].”
BackgroundTun, Y. K., Dang, T. N., Kim, K. T., Alsenwi, M., Saad, W., & Hong, C. S. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3189000 · Cited by 73 · cited 1×
“Many studies have aimed to incentivize computation offloading and resource allocation in MEC [5], [6], [7].”
BackgroundPrivacy-Preserving Incentive Mechanism Design for Federated Cloud-Edge Learning
Liu, T., Di, B., An, P., & Song, L. (2021) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2021.3100096 · Cited by 61 · cited 1×
“The authors of [16] proposed a privacy-preserving incentive mechanism for a federated cloud-edge learning system, where DP was considered.”
BackgroundFu, H. D., Kleinberg, R., & Lavi, R. (2012) · ACM Conference on Electronic Commerce (EC) · doi:10.1145/2229012.2229055 · Cited by 56 · cited 1×
“Definition 7: A conditional equilibrium is achieved under the following conditions [37]: 1) Individual Rationality: None of the sellers and buyers have negative utilities.”
BackgroundCollaborative Content Caching and Task Offloading in Multi-Access Edge Computing
Li, Y., Zhu, X., Li, N., Wang, L., Chen, Y., Yang, F. P., & Zhai, L. (2022) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2022.3222596 · Cited by 56 · cited 1×
“Many studies have aimed to incentivize computation offloading and resource allocation in MEC [5], [6], [7].”
BackgroundDifferentially private spectrum auction with approximate revenue maximization
Zhu, R., Li, Z., Wu, F., Shin, K., & Chen, G. (2014) · Proceedings of the 15th ACM international symposium on Mobile ad hoc networking and computing · doi:10.1145/2632951.2632974 · Cited by 55 · cited 2×
“Definition 5 (Dominant Strategy): A strategy s n is dominant for user n , if any strategy s n (cid:12) = s n in the auction satisfies Definition 6 ( γ -truthful): If truthful reporting is a γ - approximate dominant strategy for every player, M is γ -approximately dominant strategy truthful [27].”
BackgroundZhao, P., Tao, J., Lui, K., Zhang, G., & Gao, F. (2022) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2022.3140231 · Cited by 52 · cited 1×
“In [24], a joint optimization of delay and privacy preservation method was discussed to protect the privacy and address task offloading for MEC systems and a non-convex problem was formulated.”
MethodPrivacy-Preserving Data Integrity Verification for Secure Mobile Edge Storage
Tong, W., Chen, W., Jiang, B., Xu, F., Li, Q., & Zhong, S. (2022) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2022.3174867 · Cited by 50 · cited 1×
“The authors of [18] considered privacy protection for mobile edge storage and proposed two integrity-checking protocols for mobile edge storage to protect data integrity in MEC.”
BackgroundZhu, K., Huang, L. H., Nie, J., Zhang, Y., Xiong, Z., Dai, H., & Jin, J. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3165819 · Cited by 42 · cited 1×
“The authors of [21] proposed an auction framework for privacy-preserving data aggregation in mobile crowdsensing and proposed a differentially private data aggregation scheme.”
BackgroundAsheralieva, A., Niyato, D. T., & Xiong, Z. (2021) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2021.3097380 · Cited by 28 · cited 1×
“The authors of [22] proposed an auction-and-machine-learning-based Lagrange-coded computing model for a privacy-preserving MEC system to create a resilient distributed computing model.”
BackgroundZhang, L., Wang, Y., Min, M., Guo, C., Sharma, V., & Han, Z. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3167052 · Cited by 22 · cited 1×
“On the other hand, existing MEC task offloading problems have been based on users’ locations and offloaded data [13], [14], from which an attacker may infer the users’ interests, preferences, and behaviors.”
BackgroundToward a Secure Edge-Enabled and Artificially Intelligent Internet of Flying Things Using Blockchain
Dahmane, S., Yagoubi, M. B., Kerrache, C. A., Lorenz, P., Lagraa, N., & Lakas, A. (2022) · IEEE Internet of Things Magazine · doi:10.1109/iotm.001.2100193 · Cited by 21 · cited 1×
“An inference attack happens when an adversary infers sensitive information, to which it is not granted access, by using authorized query results and prevailing common knowledge [29].”
BackgroundJoint Wireless Source Management and Task Offloading in Ultra-Dense Network
Pang, S., & Wang, S. (2020) · IEEE Access · doi:10.1109/access.2020.2980032 · Cited by 20 · cited 1×
“The background noise is N 0 = − 60 dBm [41].”
BackgroundVCG-Based Auction for Incentivized Energy Trading in Electric Vehicle Enabled Microgrids
Umoren, I. A., Shakir, M. Z., & Ahmadi, H. (2023) · IEEE Access · doi:10.1109/access.2023.3249469 · Cited by 20 · cited 1×
“Benchmark methods: The baseline considered is the state-of-the-art VCG auction [38], [39], which is a sealed-bid auction of multiple items with the second-highest price rule.”
MethodNew Three-Tier Game-Theoretic Approach for Computation Offloading in Multi-Access Edge Computing
You, F., Ni, W., Li, J., & Jamalipour, A. (2022) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2022.3176302 · Cited by 19 · cited 2×
“This approach motivates the bidders to bid their actual valuation, as it aligns their bidding strategy with their true value assessment [31].”
BackgroundMethodSelf-citationDifferentially Private Combinatorial Cloud Auction
Ni, T., Chen, Z., Chen, L., Zhang, S., Xu, Y., & Zhong, H. (2021) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2021.3097328 · Cited by 18 · cited 1×
“The winner selection and resource allocation follow an exponential mechanism to achieve (cid:4) -DP on the bid prices of the users [34].”
BackgroundCache-Assisted Content Delivery in Wireless Networks: A New Game Theoretic Model
Fang, C., Liu, C., Wang, Z., Sun, Y., Ni, W., Li, P., & Guo, S. (2020) · IEEE Systems Journal · doi:10.1109/jsyst.2020.3001229 · Cited by 17 · cited 1×
“Game theory has often been used to model the attributes and relationships of users in MEC systems [19], [20].”
MethodSelf-citationTDRA: A Truthful Dynamic Reverse Auction for DAG Task Scheduling Over Vehicular Clouds
Liu, Z., Zhao, Y., Hosseinalipour, S., Gao, Z., Huang, L., & Dai, H. (2023) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2023.3329141 · Cited by 16 · cited 1×
“Benchmark methods: The baseline considered is the state-of-the-art VCG auction [38], [39], which is a sealed-bid auction of multiple items with the second-highest price rule.”
MethodWu, B., Zeng, J. J., Shao, S., Ni, W., & Tang, Y. (2022) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2022.3146514 · Cited by 14 · cited 1×
“Game theory has often been used to model the attributes and relationships of users in MEC systems [19], [20].”
MethodSelf-citationOn efficiency and the Jain’s fairness index in integer assignment problems
Rezaeinia, N., Góez, J. C., & Guajardo, M. (2023) · Computational Management Science · doi:10.1007/s10287-023-00477-9 · Cited by 14 · cited 1×
“A more equitable or even resource allocation is obtained if Jain’s index is closer to 1 [42].”
BackgroundOptimal Pricing for Job Offloading in the MEC System With Two Priority Classes
Li, L., Siew, M., Chen, Z., & Quek, T. Q. S. (2021) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2021.3090935 · Cited by 13 · cited 1×
“It has been implicitly assumed in the studies that users are motivated to join computation offloading to maximize the social welfare of the whole system [11].”
BackgroundOnline computation offloading for deadline-aware tasks in edge computing
He, X., Zheng, J., He, Q., Dai, H., Liu, B., Dou, W., & Chen, G. (2022) · Wireless Networks · doi:10.1007/s11276-021-02864-z · Cited by 9 · cited 1×
“We consider mobile users at low to moderate speeds, e.g., no faster than 60 km/h [40].”
BackgroundMinimizing the Age of Information in the Presence of Location Privacy-aware Mobile Agents
Jin, R., He, X., & Dai, H. (2020) · IEEE Transactions on Communications · doi:10.1109/tcomm.2020.3035394 · Cited by 8 · cited 1×
“On the other hand, existing MEC task offloading problems have been based on users’ locations and offloaded data [13], [14], from which an attacker may infer the users’ interests, preferences, and behaviors.”
BackgroundOn the (in)Security and Weaknesses of Commonly Used Applications on Large-Scale Distributed Systems
Abate, A. F., Castiglione, A., Cimmino, L., Angelis, D. D., Flauto, S., & Volpe, A. (2023) · International Conference on Control Systems and Computer Science · doi:10.1109/cscs59211.2023.00096 · Cited by 4 · cited 1×
“The users submit their bids confiden-tially to the DCO based on their requirements for computing and communication resources and privacy via a secure (or encrypted) channel, i.e., a standard secure channel, e.g., TLS [33].”
Background
Cited by
Auction Theory and Game Theory Based Pricing of Edge Computing Resources: A Survey
Yu, J., Liu, S., Zou, Y., Wang, G., & Hu, C. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3565539 · Cited by 26
“To address these privacy concerns, [103] employs an incomplete information game model to protect user privacy, while [104] proposes a differential privacy mechanism that adds noise to users’ sensitive information, ensuring it remains undisclosed.”
You, F., Yuan, X., Ni, W., & Jamalipour, A. (2025) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2024.3499342 · Cited by 15
“1, we consider an MEC system with a DCO, I cloudlets, and J mobile users, as in [8].”
Self-citationMADDPG-based task offloading and resource pricing in edge collaboration environment
Tong, Z., Deng, X., Zhang, Y., Mei, J., Wang, C., & Li, K. (2025) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2025.103433 · Cited by 13
Blockchain-based secure MEC model for VANETs using hybrid networks
Goud, G. V., Arunachalam, R., Shukla, S. K., Saranya, K., Venugopal, S., & Palanisamy, P. (2025) · Scientific Reports · doi:10.1038/s41598-025-27682-7 · Cited by 8
“The integration of blockchain establishes a decentralized ledger where all data transactions are permanently recorded 15 .”
Optimizing Energy Efficiency with QoE-Awareness in Multi-Access Edge Computing
Xie, Z., Xia, X., Hu, B., Khalil, I., Wang, Z., Cui, G., Xie, G., & Xue, M. (2025) · International Workshop on Quality of Service · doi:10.1109/iwqos65803.2025.11143474 · Cited by 6
“Major research topics in MEC including edge data privacy [17]–[19], edge-related machine learning and federated learning [20]–[23] and edge data caching [24]–[26].”
Metadata
- Authors
- You, F., Yuan, X., Ni, W., & Jamalipour, A.
- Affiliations
- Commonwealth Scientific and Industrial Research Organisation (AU)
- The University of Sydney (AU)
- Venue
- IEEE Transactions on Cognitive Communications and Networking
- Published
- 2024-10
- Volume
- 10
- Issue
- 5
- Pages
- 1928-1943
- ISSN
- 2332-7731 (ISSN-L)
- 2372-2045
- OpenAlex
- W4394967025
- Cited by
- 11
- References
- 42
- Citations by year
- 2026: 4 · 2025: 6 · 2024: 1
- FWCI
- 1.83
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Transactions on Cognitive Communications and Networking (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
- Keywords
- mobile edge computing, computation offloading, privacy preservation, incentive mechanisms, auction game, differential privacy, exponential mechanism, cloudlets, data center operators, honesty, equilibrium
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.