4.8 Article

A Truthful Online Mechanism for Collaborative Computation Offloading in Mobile Edge Computing

Journal

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS
Volume 16, Issue 7, Pages 4832-4841

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TII.2019.2960127

Keywords

Collaborative computation offloading; social welfare maximization (SWM); truthful online mechanism

Funding

  1. Key Area R&D Program of Guangdong Province [2019B010137005]
  2. National Natural Science Foundation of China [61902019]
  3. Fundamental Research Funds for the Central Universities [2019RC026, TII-19-2823]

Ask authors/readers for more resources

Collaborative computation offloading in mobile edge computing where edge users offload tasks opportunistically to resourceful neighboring mobile devices (MDs), offers a promising solution to satisfy low-latency requirements. However, most existing works assume that those MDs volunteer to help edge users without an incentive mechanism. In this article, we propose an auction-based incentive mechanism, where users and MDs participate in the system dynamically. Our auction mechanism runs in the online fashion and optimizes the long-term system welfare without knowledge of future information, e.g., task start time, task length, resource demand, and valuation, etc. We prove that the proposed online mechanism achieves the desired properties, including individual rationality, truthfulness, and computational tractability. Moreover, the theoretical competitive ratio shows that our online mechanism achieves near-optimal long-term social welfare close to the offline optimum. Extensive experiments based on real-world traces demonstrate the efficiency of the proposed online mechanism.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Computer Science, Information Systems

Game Theoretic Multihop D2D Content Sharing: Joint Participants Selection, Routing, and Pricing

Di Zhang, Yujian Fang, Yuezhi Zhou, Junyi He, Yaoxue Zhang

Summary: This paper proposes a game theoretic approach to enable D2D content sharing with multihop communication capabilities. It models a Nash bargaining game and introduces a novel incentive mechanism to stimulate cooperation. Experimental results demonstrate the effectiveness of the approach in dealing with participant selection, routing, and pricing problems.

IEEE TRANSACTIONS ON MOBILE COMPUTING (2022)

No Data Available