Incentive Mechanism Design for Computation Offloading in Heterogeneous Fog Computing: A Contract-Based Approach
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Fog computing is a promising solution for new emerging applications requiring intensive computation resources and low latency. Devices at the edge of network can share idle resources and collaboratively accomplish the computing tasks in fog computing. Thus, task publishers have heterogeneous options when offloading computing tasks considering the quality of transmission links, energy consumption and other hardware constraints of fog nodes. To incentivize these devices to participate in computation offloading, effective incentive mechanisms are needed. In this paper, utilizing the framework of contract theory, we formulate the negotiation between task publisher and fog nodes as an optimization problem. The optimal contract is the Nash equilibrium solution achieved by task publisher and fog nodes. Simulation results show that an optimal contract can maximize the utility of task publisher meanwhile guarantee the individual rationality and incentive compatibility of fog nodes. Therefore, edge devices can be incentivized effectively to involve in the computation offloading.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Survey on Mobile Edge Computing: The Communication Perspective
Mao, Y., You, C., Zhang, J., Huang, K., & Letaief, K. B. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2745201 · Cited by 5,607 · cited 1×
“Fog computing is proposed as the most promising solution for the computation intensive, energy consuming and delay strictly constrained tasks [2][3].”
BackgroundFog Computing: Focusing on Mobile Users at the Edge
Luan, T. H., Gao, L., Li, Z., Xiang, Y., Wei, G., & Sun, L. (2015) · arXiv · doi:10.48550/arxiv.1502.01815 · Cited by 398
Cited by
All one needs to know about fog computing and related edge computing paradigms: A complete survey
Yousefpour, A., Fung, C., Nguyen, T., Kadiyala, K., Jalali, F., Niakanlahiji, A., Kong, J., & Jue, J. P. (2019) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2019.02.009 · Cited by 1,368
Kang, J., Xiong, Z., Niyato, D., Xie, S., & Zhang, J. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2940820 · Cited by 953
Kang, J., Xiong, Z., Niyato, D., Ye, D., Kim, D. I., & Zhao, J. (2019) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2019.2894944 · Cited by 604
Saeik, F., Avgeris, M., Spatharakis, D., Santi, N., Dechouniotis, D., Violos, J., Leivadeas, A., Athanasopoulos, N., Mitton, N., & Papavassiliou, S. (2021) · Computer Networks · doi:10.1016/j.comnet.2021.108177 · Cited by 276
Incentive Design for Efficient Federated Learning in Mobile Networks: A Contract Theory Approach
Kang, J., Xiong, Z., Niyato, D., Yu, H., Liang, Y.-C., & Kim, D. I. (2019) · 2019 IEEE VTS Asia Pacific Wireless Communications Symposium (APWCS) · doi:10.1109/vts-apwcs.2019.8851649 · Cited by 255
Metadata
- Authors
- Zeng, M., Li, Y., Zhang, K., Waqas, M., & Jin, D.
- Venue
- 2018 IEEE International Conference on Communications (ICC)
- Publisher
- IEEE
- Published
- 2018-05
- Pages
- 1-6
- ISSN
- 1550-3607 (ISSN-L)
- OpenAlex
- W2887548758
- Cited by
- 61
- References
- 2
- FWCI
- 6.68
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Incentive Mechanism Design for Computation Offloading in Heterogeneous Fog Computing: A Contract-Based Approach. https://app.cochat.ai/papers/10.1109/icc.2018.8422684
- The paper
- Zeng, M., Li, Y., Zhang, K., Waqas, M., & Jin, D. (2018). Incentive Mechanism Design for Computation Offloading in Heterogeneous Fog Computing: A Contract-Based Approach. 2018 IEEE International Conference on Communications (ICC). https://doi.org/10.1109/icc.2018.8422684
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.