TY - JOUR
T1 - A Collision-Free Scheduling Algorithm with Minimum Data Redundancy Transmission for TSCH
AU - Hammoudi, Sarra
AU - Ourzeddine, Hamza
AU - Gueroui, Mourad
AU - Harous, Saad
AU - Aliouat, Zibouda
N1 - Publisher Copyright:
© 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2022/6
Y1 - 2022/6
N2 - The IEEE 802.15.4e specified the Time Slotted Channel Hopping (TSCH) that uses multi-channels and shared links to ensure a reliable and efficient data transmission in IoT applications. However, the standard does not define any scheduling mechanism for the network configuration. The main problem in TSCH is triggered when hidden nodes in a shared link transmit data at the same time. A collision happens even if the hidden nodes apply CSMA/CA before starting data transmission. To solve this problem, we propose Interference Collision Free Scheduling (ICFS), and Interference Collision Free Scheduling-Without Redundant Data (ICFS-WRD) algorithms to reduce the internal collisions caused by hidden nodes on shared links. The ICFS-WRD approach stands in contrast to proposals in the recent literature where shared links of the proposed TSCH schedules are free from colliding nodes. ICFS-WRD intentionally schedules the colliding nodes that sense redundant data on the same shared link, and let them alternate in transmitting data. This mechanism is targeted to sparse more cells for future flows, reduce the slot-frame size, increase the network’s lifetime and avoid transmitting redundant data. We propose a clustering technique to build a multi-hop cluster based convergecast traffic routing approach with a unique sink, on which we implement the scheduling algorithms. The proposed algorithms have been tested through simulations using network simulator NS3. The results show improvements in terms of energy consumption (ICFS saves approximately 23%), packets delivery ratio (ICFS achieves approximately 96.5%), and latency (ICFS-WRD delivers the packets twice faster than ICFS). We discuss some theorems and proofs that show that ICFS-WRD reduces the slot-frame size, increases the network lifetime, avoids transmitting redundant data, and minimizes the network’s congestion.
AB - The IEEE 802.15.4e specified the Time Slotted Channel Hopping (TSCH) that uses multi-channels and shared links to ensure a reliable and efficient data transmission in IoT applications. However, the standard does not define any scheduling mechanism for the network configuration. The main problem in TSCH is triggered when hidden nodes in a shared link transmit data at the same time. A collision happens even if the hidden nodes apply CSMA/CA before starting data transmission. To solve this problem, we propose Interference Collision Free Scheduling (ICFS), and Interference Collision Free Scheduling-Without Redundant Data (ICFS-WRD) algorithms to reduce the internal collisions caused by hidden nodes on shared links. The ICFS-WRD approach stands in contrast to proposals in the recent literature where shared links of the proposed TSCH schedules are free from colliding nodes. ICFS-WRD intentionally schedules the colliding nodes that sense redundant data on the same shared link, and let them alternate in transmitting data. This mechanism is targeted to sparse more cells for future flows, reduce the slot-frame size, increase the network’s lifetime and avoid transmitting redundant data. We propose a clustering technique to build a multi-hop cluster based convergecast traffic routing approach with a unique sink, on which we implement the scheduling algorithms. The proposed algorithms have been tested through simulations using network simulator NS3. The results show improvements in terms of energy consumption (ICFS saves approximately 23%), packets delivery ratio (ICFS achieves approximately 96.5%), and latency (ICFS-WRD delivers the packets twice faster than ICFS). We discuss some theorems and proofs that show that ICFS-WRD reduces the slot-frame size, increases the network lifetime, avoids transmitting redundant data, and minimizes the network’s congestion.
KW - Clustering
KW - External interference
KW - Internal interference
KW - Internet of things
KW - Scheduling
KW - TSCH
UR - http://www.scopus.com/inward/record.url?scp=85123104702&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85123104702&partnerID=8YFLogxK
U2 - 10.1007/s11277-022-09507-2
DO - 10.1007/s11277-022-09507-2
M3 - Article
AN - SCOPUS:85123104702
SN - 0929-6212
VL - 124
SP - 3159
EP - 3188
JO - Wireless Personal Communications
JF - Wireless Personal Communications
IS - 4
ER -