An Enhanced Deterministic Beacon Advertising Algorithm for Building TSCH Networks - Archive ouverte HAL Access content directly
Journal Articles Annals of Telecommunications - annales des télécommunications Year : 2018

An Enhanced Deterministic Beacon Advertising Algorithm for Building TSCH Networks

Abstract

In this paper, we focus first on the time needed by a node to join a Time Slotted Channel Hopping (TSCH) network, this time is called joining time. Second, we are also interested in the network building time. Since the data generated by a sensor node remain unavailable as long as this node has not yet joined the wireless sensor network, these times are of prime importance for applications having strong latency requirements on data gathering. The joining time depends on the beacon advertising policy that has been left unspecified by the standard. The contribution of this paper is triple. First, we propose an Enhanced Deterministic Beacon Advertising algorithm, called EDBA, that ensures a collision-free advertising of beacons and minimizes the average joining time. Second, we model the behavior of a joining node by a Markov chain, validated by NS3 simulations, and compute the average joining time. Third, we compare the performance of EDBA with this of MBS, considered as the best beacon advertising algorithm in the literature.
Fichier principal
Vignette du fichier
enhanced-deterministic-beacon.pdf (616.01 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01870277 , version 1 (07-09-2018)

Identifiers

  • HAL Id : hal-01870277 , version 1

Cite

Ines Khoufi, Pascale Minet. An Enhanced Deterministic Beacon Advertising Algorithm for Building TSCH Networks. Annals of Telecommunications - annales des télécommunications, 2018. ⟨hal-01870277⟩

Collections

INRIA INRIA2
83 View
179 Download

Share

Gmail Mastodon Facebook X LinkedIn More