A Theoretical Association Time Model for IEEE 802.15.4 TSCH Networks

Algora, Carlos M. Garcia; Guerra, Erik Ortiz; Montejo‐Sánchez, Samuel; Fernández, Evelio; Steenhaut, Kris

doi:10.1109/lcomm.2020.3032674

Cited by 6 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The theoretical analysis is based on demonstrating that both the channel used by a synchronizer to send the jth EB and the channel being scanned by the join-seeker when the jth EB is sent are independent and identically distributed random variables. Results in [31] show that the average association time depends on m and the average time between EB transmissions. There is a trade-off between the average association time, the time between EB transmissions, and the number of channels used for communication.…”

Section: Proposed Enhanced Beacons Dynamic Transmission Mechanismmentioning

confidence: 99%

“…In [31], the contribution consists of a theoretical model to estimate the average time required for a node to associate with a synchronizer. This depends on the available channels and the average number of EBs transmitted until the association is achieved.…”

Section: Proposed Enhanced Beacons Dynamic Transmission Mechanismmentioning

confidence: 99%

“…The analytical model developed in [31] proves that in a network with m channels, the probability for a join-seeker to get associated with a synchronizer after exactly j EB transmissions can be computed following [31] (Equation ( 5)):…”

Section: Theoretical Network Formation Expected Timementioning

confidence: 99%

See 2 more Smart Citations

Enhanced Beacons Dynamic Transmission over TSCH

Ortiz Guerra,

Martínez Morfa,

García Algora

et al. 2024

Future Internet

Self Cite

View full text Add to dashboard Cite

Time slotted channel hopping (TSCH) has become the standard multichannel MAC protocol for low-power lossy networks. The procedure for associating nodes in a TSCH-based network is not included in the standard and has been defined in the minimal 6TiSCH configuration. Faster network formation ensures that data packet transmission can start sooner. This paper proposes a dynamic beacon transmission schedule over the TSCH mechanism that achieves a shorter network formation time than the default minimum 6TiSCH static schedule. A theoretical model is derived for the proposed mechanism to estimate the expected time for a node to get associated with the network. Simulation results obtained with different network topologies and channel conditions show that the proposed mechanism reduces the average association time and average power consumption during network formation compared to the default minimal 6TiSCH configuration.

show abstract

Section: Proposed Enhanced Beacons Dynamic Transmission Mechanismmentioning

confidence: 99%

Section: Proposed Enhanced Beacons Dynamic Transmission Mechanismmentioning

confidence: 99%

See 1 more Smart Citation

Enhanced Beacons Dynamic Transmission over TSCH

Ortiz Guerra,

Martínez Morfa,

García Algora

et al. 2024

Future Internet

Self Cite

View full text Add to dashboard Cite

show abstract

Modeling end-to-end delays in TSCH wireless sensor networks using queuing theory and combinatorics

Shudrenko,

Timm-Giel

2024

Computing

View full text Add to dashboard Cite

Wireless communication offers significant advantages in terms of flexibility, coverage and maintenance compared to wired solutions and is being actively deployed in the industry. IEEE 802.15.4 standardizes the Physical and the Medium Access Control (MAC) layer for Low Power and Lossy Networks (LLNs) and features Timeslotted Channel Hopping (TSCH) for reliable, low-latency communication with scheduling capabilities. Multiple scheduling schemes were proposed to address Quality of Service (QoS) in challenging scenarios. However, most of them are evaluated through simulations and experiments, which are often time-consuming and may be difficult to reproduce. Analytical modeling of TSCH performance is lacking, as only one-hop communication with simplified traffic patterns is considered in state-of-the-art. This work proposes a new framework based on queuing theory and combinatorics to evaluate end-to-end delays in multihop TSCH networks of arbitrary topology, traffic and link conditions. The framework is validated in simulations using OMNeT++ and shows below 6% root-mean-square error (RMSE), providing quick and reliable latency estimation tool to support decision-making and enable formalized comparison of existing scheduling solutions.

show abstract