Comparative Analysis of Time-Slotted Channel Hopping Schedule Optimization Using Priority-Based Customized...

Area of Science:

• Computer Science
• Electrical Engineering
• Network Engineering

Background:

• Time-Slotted Channel Hopping (TSCH) is crucial for reliable industrial wireless sensor networks.
• Optimizing TSCH schedules for minimal slotframe size and high throughput in heterogeneous networks is a significant challenge.

Purpose of the Study:

• To propose and evaluate a Priority-based Customized Differential Evolution (PCDE) algorithm for TSCH scheduling.
• To ensure collision- and interference-free transmissions for sensors with varying data rates.
• To compare the PCDE algorithm's performance against the Traffic-Aware Scheduling Algorithm (TASA).

Main Methods:

• Developed a Priority-based Customized Differential Evolution (PCDE) algorithm.
• Constructed a collision- and interference-free transmission graph.
• Simulated and evaluated performance metrics including slotframe size, throughput, delay, time complexity, and Packet Delivery Ratio (PDR).

Main Results:

• The PCDE algorithm demonstrates significant improvements in performance metrics compared to TASA.
• Achieved a minimal slotframe size while accommodating heterogeneous data rates.
• Showcased enhanced throughput and Packet Delivery Ratio (PDR).

Conclusions:

• The PCDE algorithm offers a superior approach to TSCH scheduling in industrial wireless sensor networks.
• It effectively addresses the challenge of optimizing schedules for heterogeneous networks.
• The proposed method provides a robust and efficient solution for reliable wireless communication.