Minimal Idle-Listen Centralized Scheduling in TSCH Wireless Sensor Networks

Nsabagwa, Mary; Muhumuza, Joshua; Kasumba, Robert; Otim, Julianne Sansa; Akol, Roseline

doi:10.1109/tsp.2018.8441425

Cited by 3 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since some scheduling depend on data gathered when networks first start up, Others make the implicit assumption that this information is obtained prior to the network's deployment. 23 This scheduling technique seeks to reduce (or conversely, maximize) a given measure, which is similar to an optimization issue. According to our understanding, traffic aware scheduling approach (TASA) 13 is the first pioneering study, this uses coloring and matching methods.…”

Section: Related Workmentioning

confidence: 99%

“…Algorithms for centralized scheduling gain from complete network state knowledge. Since some scheduling depend on data gathered when networks first start up, Others make the implicit assumption that this information is obtained prior to the network's deployment 23 . This scheduling technique seeks to reduce (or conversely, maximize) a given measure, which is similar to an optimization issue.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

An enhanced MSU‐TSCH scheduling algorithms for industrial wireless sensor networks

Jerbi,

Cheikhrouhou,

Guermazi

et al. 2023

Concurrency and Computation

View full text Add to dashboard Cite

SummaryThe reliability and latency requirements of wireless sensor network‐based smart grid communications are met in large part by MAC protocols. Developed by IEEE, time slotted channel hopping (TSCH), a method that is effective, dependable, and predictable. However, the TSCH standard does not enable mobility and does not offer any solution for scheduling, especially in IEEE 802.15.4 TSCH, the most recent generation of extremely dependable and low‐power MAC protocols. Recently, MSU‐TSCH a time‐frequency communication schedule was proposed to provide mobility to TSCH. Despite its distinctive qualities, MSU‐TSCH has the drawback of computing the TSCH schedule at each node independently of its traffic load, which can significantly increase the communication delay. Due to this limitation, MSU‐TSCH is not suitable for some delay‐sensitive smart grid applications. In this article, we provide an improved MSU‐TSCH‐based TSCH protocol, called Mobility‐TSCH, that dynamically adjusts time slot assignments based on traffic volume and latency requirement. Moreover, the protocol Mobility‐TSCH adapts to topology changes and supports mobility. Additionally, it optimizes time slot allocation by prioritizing nodes closest to the sink. The performance and evaluation analysis of Mobility‐TSCH compared to the original MSU‐TSCH, reveal that the communication delay is greatly reduced, decreases the average end‐to‐end latency, the high packet delivery ratio (PDR), Increase the performance of both metrics, parent connectivity ratio (PCR) and convergence time (CT), while maintaining a minimal overhead signaling.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

An enhanced MSU‐TSCH scheduling algorithms for industrial wireless sensor networks

Jerbi,

Cheikhrouhou,

Guermazi

et al. 2023

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…Centralized schedulers may therefore be more suitable when topology and links are stable and less numerous. Coloring & matching TASA-RTX [119] Coloring & matching, Inverse Greedy Farias et al [125] Queue-based MODESA [126] Greedy MODESA Wu et al [124] Margin slots Yang et al [127] SSA, FSC, free node Dawn [128] Not specified Chen et al [129] LSS & LPS Ojo et al [130] Hungarian EES & V-H. [118] Greedy, VAM ADP [116] Approximate Dynamic Programming Khoufi et al [131] Debt-based PRCOS [117] Coloring & pruning, Cross-layer MILS [132] Constrained Satisfaction Problem Minet et al [133] Debt-based CONCISE [120] Cross-layer Devaja et al [134] Message-passing max-product belief prop. SPRF [135] Coloring & matching, blossom & heuristic Khorov et al [136] Retry & shared cell optimization Brun-Laguna et al [137] Load-based MASTER [121] Flow-based TX & Reverse Longest Path First Portaluri et al [138] Shell-game-based Heterogeneous traffic is typically addressed since most centralized schedulers take the offered traffic or similar information from each individual node as input when building the schedule.…”

Section: Centralized and Static Schedulingmentioning

confidence: 99%

A Survey of 802.15.4 TSCH Schedulers for a Standardized Industrial Internet of Things

Urke

Kure

Øvsthus

2021

Sensors

View full text Add to dashboard Cite

Concepts such as Industry 4.0 and Cyber-Physical Systems may bring forward a new industrial revolution. These concepts require extensive connectivity far beyond what is provided by traditional industrial networks. The Industrial Internet of Things (IIoT) bridges this gap by employing wireless connectivity and IP networking. In order for wireless networks to meet the strict requirements of the industrial domain, the Time Slotted Channel Hopping (TSCH) MAC is often employed. The properties of a TSCH network are defined by the schedule, which dictates transmission opportunities for all nodes. We survey the literature for these schedulers, describe and organize them according to their operation: Centralized, Collaborative, Autonomous, Hybrid, and Static. For each category and the field as a whole, we provide a holistic view and describe historical trends, highlight key developments, and identify trends, such as the attention towards autonomous mechanisms. Each of the 76 schedulers is analyzed into their common components to allow for comparison between schedulers and a deeper understanding of functionality and key properties. This reveals trends such as increasing complexity and the utilization of centralized principles in several collaborative schedulers. Further, each scheduler is evaluated qualitatively to identify its objectives. Altogether this allows us to point out challenges in existing work and identify areas for future research, including fault tolerance, scalability, non-convergecast traffic patterns, and hybrid scheduling strategies.

show abstract

MSU-TSCH: A Mobile Scheduling Updated Algorithm for TSCH in the Internet of Things

Jerbi

Cheickhrouhou

Guermazi

et al. 2023

IEEE Trans. Ind. Inf.

View full text Add to dashboard Cite

Minimal Idle-Listen Centralized Scheduling in TSCH Wireless Sensor Networks

Cited by 3 publications

References 9 publications

An enhanced MSU‐TSCH scheduling algorithms for industrial wireless sensor networks

An enhanced MSU‐TSCH scheduling algorithms for industrial wireless sensor networks

A Survey of 802.15.4 TSCH Schedulers for a Standardized Industrial Internet of Things

MSU-TSCH: A Mobile Scheduling Updated Algorithm for TSCH in the Internet of Things

Contact Info

Product

Resources

About