The Time-Slotted Channel Hopping (TSCH) protocol is known for its suitability in highly reliable applications within industrial wireless sensor networks. One of the most significant challenges in TSCH is determining a schedule with a minimal slotframe size that can meet the required throughput for a heterogeneous network. We proposed a Priority-based Customized Differential Evolution (PCDE) algorithm based on the determination of a collision- and interference-free transmission graph. Our schedule can encompass sensors with different data rates in the given slotframe size. This study presents a comprehensive performance evaluation of our proposed algorithm and compares the results to the Traffic-Aware Scheduling Algorithm (TASA). Sufficient simulations were performed to evaluate different metrics such as the slotframe size, throughput, delay, time complexity, and Packet Delivery Ratio (PDR) to prove that our approach achieves a significant result compared with this method.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC10893077 | PMC |
http://dx.doi.org/10.3390/s24041085 | DOI Listing |
Sensors (Basel)
February 2024
Department of Electrical, Computer and Software Engineering, Ontario Tech University, 2000 Simcoe St N, Oshawa, ON L1G 0C5, Canada.
The Time-Slotted Channel Hopping (TSCH) protocol is known for its suitability in highly reliable applications within industrial wireless sensor networks. One of the most significant challenges in TSCH is determining a schedule with a minimal slotframe size that can meet the required throughput for a heterogeneous network. We proposed a Priority-based Customized Differential Evolution (PCDE) algorithm based on the determination of a collision- and interference-free transmission graph.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!