A survey on network formation and scheduling algorithms for time slotted channel hopping in industrial networks

Kharb, Seema; Singhrova, Anita

doi:10.1016/j.jnca.2018.11.004

Cited by 45 publications

(36 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The set ‫ܧ‬ ሖ = {݁́= ሺ‫,́ݑ‬ ‫́ݒ‬ሻ| ‫́ݑ‬ ∈ ܷ ሖ , ‫́ݒ‬ ∈ ܸ ሖ } are the edges of the graph ‫ܩ‬ ሖ . The weight of edge ݁́ = ሺ‫́ݑ‬, ‫́ݒ‬ሻ is equal to ‫ݓ‬ ≥ 0, which can be calculated from equation (6).…”

Section: A Problem Formulation By Assuming Statistical Csimentioning

confidence: 99%

“…In fact, when a transmission is done on the quality status ܺ ,௧ of the channel ݂, ܷ ́൫ ܺ ,௧ ൯ represents the number of packets sent during the time slot ݊ from the cycle ߬ on the links belonging to the upper vertex of the ݁́ in the bipartite assignment graph. This value is calculated according to equation (6). Hence, the reward obtained during cycle ߬ is given as (11):…”

Section: ) Cmab-based Formulationmentioning

confidence: 99%

“…This regret is expressed in expressions (12), and here the goal is to minimize it. • Average throughput of each node: In order to maximize the total throughput, according to formula (6), the average packet rate of a link can be obtained in each channel state. • Average total network throughput: Using equation (15) and the average throughput of each node, the average of the total network throughput can be calculated.…”

Section: ) Evaluation Metricsmentioning

confidence: 99%

“…In the TSCH protocol, only the execution time of the MAC scheduling is specified without dictating the scheduler's execution manner [6]. In fact, this protocol does not specify how to create and maintain a proper link scheduling.…”

Section: Introductionmentioning

confidence: 99%

“…In practice, scheduling in TSCH specifies the frequency and slots for each link of a node. In recent years, many researchers have addressed the scheduling problem for the TSCH protocol, from centralized to distributed solutions [6].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

IEEE 802.15.4.e TSCH-Based Scheduling for Throughput Optimization: A Combinatorial Multi-Armed Bandit Approach

2020

View full text Add to dashboard Cite

In TSCH, which is a MAC mechanism set of the IEEE 802.15.4e amendment, calculation, construction, and maintenance of the packet transmission schedules are not defined. Moreover, to ensure optimal throughput, most of the existing scheduling methods are based on the assumption that instantaneous and accurate Channel State Information (CSI) is available. However, due to the inevitable errors in the channel estimation process, this assumption cannot be materialized in many practical scenarios. In this paper, we propose two alternative and realistic approaches. In our first approach, we assume that only the statistical knowledge of CSI is available a priori. Armed with this knowledge, the average packet rate on each link is computed and then, using the results, the throughput-optimal schedule for the assignment of (slotframe) cells to links can be formulated as a max-weight bipartite matching problem, which can be solved efficiently using the well-known Hungarian algorithm. In the second approach, we assume that no CSI knowledge (even statistical) is available at the design stage. For this zeroknowledge setting, we introduce a machine learning-based algorithm by formally modeling the scheduling problem in terms of a combinatorial multi-armed bandit (CMAB) process. Our CMAB-based scheme is widely applicable to many real operational environments, thanks to its reduced reliance on design-time knowledge. Simulation results show that the average throughput obtained by the statistical CSIbased method is within the margin of 15% from the theoretical upper bound associated with perfect instantaneous CSI. The aforesaid margin is around 18% for our learning-theoretic solution.Index Terms-IEEE 802.15.4e, TSCH, Scheduling, CSI, CMAB.

show abstract

Section: A Problem Formulation By Assuming Statistical Csimentioning

confidence: 99%

Section: ) Cmab-based Formulationmentioning

confidence: 99%

Section: ) Evaluation Metricsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

IEEE 802.15.4.e TSCH-Based Scheduling for Throughput Optimization: A Combinatorial Multi-Armed Bandit Approach

2020

View full text Add to dashboard Cite

show abstract

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

CSMA/CA channel hopping in IoT environment toward intelligent multi-user diversity

Kim

Jeong

2021

J Supercomput

View full text Add to dashboard Cite

A survey on network formation and scheduling algorithms for time slotted channel hopping in industrial networks

Cited by 45 publications

References 39 publications

IEEE 802.15.4.e TSCH-Based Scheduling for Throughput Optimization: A Combinatorial Multi-Armed Bandit Approach

IEEE 802.15.4.e TSCH-Based Scheduling for Throughput Optimization: A Combinatorial Multi-Armed Bandit Approach

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

CSMA/CA channel hopping in IoT environment toward intelligent multi-user diversity

Contact Info

Product

Resources

About