Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An enhanced deterministic beacon advertising algorithm for building TSCH networks

An enhanced deterministic beacon advertising algorithm for building TSCH networks 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Telecommunications Springer Journals

An enhanced deterministic beacon advertising algorithm for building TSCH networks

Khoufi, Ines; Minet, Pascale
Annals of Telecommunications , Volume 73 (12) – May 28, 2018
Download PDF
13 pages

Loading next page...
 
/lp/springer_journal/an-enhanced-deterministic-beacon-advertising-algorithm-for-building-yBbgqD7Lsq

References (21)

Publisher
Springer Journals
Copyright
Copyright © 2018 by Institut Mines-Télécom and Springer International Publishing AG, part of Springer Nature
Subject
Engineering; Communications Engineering, Networks; Information Systems and Communication Service; Signal,Image and Speech Processing; Computer Communication Networks; Information and Communication, Circuits; R & D/Technology Policy
ISSN
0003-4347
eISSN
1958-9395
DOI
10.1007/s12243-018-0638-3
Publisher site
See Article on Publisher Site

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.

Journal

Annals of Telecommunications – Springer Journals

Published: May 28, 2018

There are no references for this article.