Return
Distributed Maximum Utility Task Offloading for Delay-Sensitive IoT Applications in Cloud and Edge Computing
DOI:10.1007/s10922-025-09918-z.png)
Abstract
En 中文
Task offloading in fog computing has emerged as a pivotal solution to address the computational constraints of IoT devices, particularly for delay-sensitive applications. This paper introduces a distributed algorithm for Maximum Utility Task Offloading, where the utility is defined as the inverse of the service delay. Unlike existing centralized approaches, our method leverages a decentralized framework, enabling user devices and access points to collaboratively optimize task assignments without reliance on a central authority. The problem is modelled as a maximum-weight matching problem on bipartite graphs, and we present a deterministic distributed algorithm with a (1/3-epsilon)-approximation ratio for any epsilon>0 under the CONGEST model of computation in O(1/epsilon log(2) (Delta/epsilon)log(1+root epsilon) (1/D))-round, where Delta is the maximum degree of the network graph and D is the minimum service delay in the network. Our approach scales efficiently as it is independent of the network size and adapts to the dynamic nature of IoT environments, incorporating realistic constraints such as communication delays and heterogeneous resource availability. Extensive simulations validate the efficacy of the proposed algorithm across diverse scenarios, including varying workload distributions and network densities. Results demonstrate comparable performance with respect to centralized greedy approaches, while providing substantial benefits in terms of scalability and adaptability.
Keywords:
Cloud computing
Edge computing
Internet of things
Matching
Scheduling
Distributed approximation algorithms
Task offloading
Mobile cloud computing
Journal
IF:
3.9
Papers:
1.0K
Citations:
1.3K
Organization
No organization information available
Cited Papers
A Survey on Matching Theory for Distributed Computation Offloading in IoT-Fog-Cloud Systems: Perspectives and Open Issues
IEEE ACCESS
IF3.6

