An Adaptive Simulated Annealing Algorithm for Optimizing Task Scheduling in Internet of Things

The Internet of Things (IoT) has grown significantly, and hence, it is being used extensively in real-time applications. However, this exponential data growth has also brought issues like CPU scheduling delays and increased computational overhead. Traditional CPU scheduling algorithms optimize one factor leading to delays, like task scheduling or execution time. In practice, delays occur because of a mix of both task scheduling and execution time. To overcome this weakness, this paper proposes an adaptive cooling rate simulated annealing algorithm to optimize scheduling time and execution times for effectively addressing scheduling delay problems. Simulation outcomes show that the proposed algorithm outperforms current methods in minimizing scheduling delays.

Authors

Institutions

Publication Details

Published
2025-03-14
DOI
https://doi.org/10.1145/3746709.3746967
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Adaptive Simulated Annealing Algorithm for Optimizing Task Scheduling in Internet of Things

Elankovan Sundararajan, Thippa Reddy Gadekallu, Mohammad Kamrul Hasan, Shayla Islam et al.
IoT and Edge/Fog Computing
article

An Adaptive Simulated Annealing Algorithm for Optimizing Task Scheduling in Internet of Things

Elankovan Sundararajan, Thippa Reddy Gadekallu, Mohammad Kamrul Hasan, Shayla Islam, Zhang Bo
article en

Abstract

The Internet of Things (IoT) has grown significantly, and hence, it is being used extensively in real-time applications. However, this exponential data growth has also brought issues like CPU scheduling delays and increased computational overhead. Traditional CPU scheduling algorithms optimize one factor leading to delays, like task scheduling or execution time. In practice, delays occur because of a mix of both task scheduling and execution time. To overcome this weakness, this paper proposes an adaptive cooling rate simulated annealing algorithm to optimize scheduling time and execution times for effectively addressing scheduling delay problems. Simulation outcomes show that the proposed algorithm outperforms current methods in minimizing scheduling delays.

Lovely Professional University (IN), UCSI University (MY), National University of Malaysia (MY)
Openalex Percentile: Top 74%
IoT and Edge/Fog Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.