Citation Link: https://doi.org/10.1109/JIOT.2023.3252820
Metascheduling Using Discrete Particle Swarm Optimization for Fault Tolerance in Time-Triggered IoT-WSN
Publication Type
Article
Subjects
Computer science
Wireless sensor network
Distributed computing
Schedule
Scheduling (production processes)
Network topology
Particle swarm optimization
Swarm behaviour
Fault tolerance
Scalability
Real-time computing
Computer network
Mathematical optimization
Algorithm
Date Issued
2023
Abstract
In time-triggered systems, adaptation is performed by using metascheduling approaches to ensure temporal predictability. Wireless sensor networks (WSNs) are growing to be used as a reliable, an energy-efficient, and a scalable network infrastructure for numerous Internet of Things (IoT) applications. Because of run-time changes because of failure events, a metascheduling system is required to address the changes by precomputing schedules for several context events at design time. Therefore, this paper proposes a metascheduler that solves a new scheduling problem for each adaptation scenario in IoT-WSN using our offline algorithm named discrete particle swarm optimization for reliable task allocation (DPSO-TA), resulting in a multi-schedule graph that combines the repeated schedules. In this work, a time-triggered IoT-WSN metascheduler is proposed that takes into considerations the node or link failures that are common in WSN. Single and two failure events are considered, where a graph for all feasible schedules is formed at the network design time. Such a large number of schedules causes a state space explosion problem, which is managed using a re-convergence method. Different application model sizes and network topologies are used to assess the proposed metascheduler under various failure event scenarios. The results show a reduction in the size of the multi-schedule graph by applying inputs with different deadline values and different number of tasks. Furthermore, the validity suggested by the proposed metascheduler, which is the ratio of valid to invalid schedules, is improved when compared to algorithms that schedule tasks to hosts with the shortest completion time or algorithms that select hosts for a set of sorted tasks based on energy consumed and task arrival time.
Owning collection