Related Experiment Videos
Fog Task Scheduling Using Quality-Source-Driven Multi-Anchor Synchronized Search Algorithm
Haitao Xie1,2, Zhuo Luo1, Zhiwei Ye1,2
1School of Computer Science and Artificial Intelligence, Hubei University of Technology, Wuhan 430068, China.
None:
Efficient task scheduling in heterogeneous IoT-Fog environments is challenging due to limited fog resources, diverse task demands, and conflicting QoS objectives. This paper proposes ASQS, a Quality-Source-driven Multi-Anchor Synchronized Search algorithm for IoT-Fog task scheduling. ASQS is biomimetically motivated by collective search behaviors in natural systems, where distributed exploration, collective memory, and probabilistic cooperation support an exploration-exploitation balance. Specifically, ASQS constructs quality layers from candidate schedules, extracts representative quality-source anchors, and reuses them through an ACO-inspired probabilistic synchronization mechanism, thereby improving the utilization of high-quality historical search information. FNO-based search and Lévy-flight perturbation are further incorporated to enhance directional guidance and long-range exploration. Experiments on 33 benchmark functions, ablation studies, sensitivity analysis, standard fog scheduling scenarios, and large-scale task-intensive scenarios were conducted to evaluate ASQS. The results show that ASQS achieves competitive optimization accuracy, stable convergence, and superior comprehensive scheduling performance in terms of fitness, makespan, latency, load balance, and constraint handling. In particular, the large-scale experiment with 100 fog nodes and up to 8000 IoT tasks verifies the scalability of ASQS under heavy workload pressure. Statistical tests further confirm the reliability of the observed improvements. These results demonstrate that ASQS is an effective, scalable, and biomimetically motivated optimizer for IoT-Fog task scheduling.
Related Concept Videos
The Anchoring-and-Adjustment Heuristic
Cluster Sampling Method
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Distributed Loads: Problem Solving
Anchoring Junctions
Lagging Strand Synthesis
There are several major differences between synthesis of the leading strand and synthesis of the lagging strand. 1) Leading strand synthesis happens in the direction of replication fork opening, whereas lagging strand synthesis happens in the...
Lagging Strand Synthesis
There are several major differences between synthesis of the leading strand and synthesis of the lagging strand. 1) Leading strand synthesis happens in the direction of replication fork opening, whereas lagging strand synthesis happens in the...