Efficient Task Offloading Strategy for Energy-Constrained Edge Computing Environments: A Hybrid Optimization Approach
Edge Computing (EC) has emerged as a pivotal paradigm, offering solutions to address the challenges posed by latency-sensitive applications and to enhance overall network performance. In EC environments, efficient task offloading is crucial for minimizing latency and energy consumption while maximiz...
Saved in:
Published in: | IEEE access Vol. 12; pp. 85089 - 85102 |
---|---|
Main Author: | |
Format: | Journal Article |
Language: | English |
Published: |
Piscataway
IEEE
2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Edge Computing (EC) has emerged as a pivotal paradigm, offering solutions to address the challenges posed by latency-sensitive applications and to enhance overall network performance. In EC environments, efficient task offloading is crucial for minimizing latency and energy consumption while maximizing resource utilization. In this paper, we propose a hybrid task offloading approach (HybridTO) integrating Grey Wolf Optimizer and Particle Swarm Optimization. Our approach aims to optimize energy consumption and fulfil latency constraints in EC environments by taking into account various factors such as capacity constraints, proximity constraints, and latency requirements. Leveraging the collaborative capabilities inherent in EC servers, HybridTO offers a comprehensive solution to the task offloading problem. Through extensive simulations, we evaluate the performance of HybridTO against baseline approaches, demonstrating its superiority regarding energy usage, offloading utility and response delay, especially under conditions of limited resources. These results underscore the effectiveness of HybridTO as a promising solution for energy-efficient task offloading in EC environments, offering valuable insights for further research and development in this field. |
---|---|
ISSN: | 2169-3536 2169-3536 |
DOI: | 10.1109/ACCESS.2024.3415756 |