Home > Research > Publications & Outputs > Resolving Multi-task Competition for Constraine...

Electronic data

  • IOTJ

    Rights statement: ©2021 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

    Accepted author manuscript, 1.77 MB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

Resolving Multi-task Competition for Constrained Resources in Dispersed Computing: A Bilateral Matching Game

Research output: Contribution to journalJournal articlepeer-review

E-pub ahead of print
  • H. Wu
  • J. Zhang
  • Z. Cai
  • Q. Ni
  • T. Zhou
  • J. Yu
  • H. Chen
  • F. Liu
Close
<mark>Journal publication date</mark>26/04/2021
<mark>Journal</mark>IEEE Internet of Things Journal
Publication StatusE-pub ahead of print
Early online date26/04/21
<mark>Original language</mark>English

Abstract

With the explosive emergence of computation-intensive and latency-sensitive applications, data processing could be envisioned to perform closer to the data source. Similar to edge and fog computing, dispersed computing is considered as a complementary computing paradigm, which can excavate potential computation resources in the network to users, and serve as a supplement for sharing computational burden when the edge is overloaded. In this paper, we first make full use of idle and geographically dispersed computation resources via task offloading, contributing to conserve energy for mobile devices. Specially, a dispersed computing offloading framework concerning the interests of users and networked computation points is proposed. We further transform the initial problem into a multi-objective optimization problem subject to latency and resource constraints. To tackle such a complex problem, an energy-saving bilateral matching algorithm is designed to obtain the optimal task offloading strategy. The simulation results demonstrate that our proposed algorithm can outperform the benchmark schemes in terms of user fairness and can achieve a relatively balanced energy cost ratio. Furthermore, comparative experiments with edge computing are implemented in Amber Response and Disaster Relief scenarios respectively to reveal the advantages of the proposed framework.

Bibliographic note

©2021 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.