2016 IEEE Symposium on Computers and Communication (ISCC) 2016
DOI: 10.1109/iscc.2016.7543789
|View full text |Cite
|
Sign up to set email alerts
|

Localized scheduling for end-to-end delay constrained Low Power Lossy networks with 6TiSCH

Abstract: The IoT expects to exploit IEEE802.15.4e-TSCH, designed for wireless industrial sensor networks. This standard relies on techniques such as channel hopping and bandwidth reservation to ensure both energy savings and reliable transmissions. The 6TiSCH working group currently proposes to exploit the RPL routing protocol on top of the IEEE802.15.4-2012-TSCH layer. Since many applications may require low end-to-end delay (e.g. alarms), we propose here a distributed algorithm to schedule the transmissions while upp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
14
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 15 publications
(14 citation statements)
references
References 15 publications
0
14
0
Order By: Relevance
“…Similarly, Hosni et al [20] show delays of 800 ms per hop using a random scheduling method. Furthermore, a non-linear increase in latency per hop from 400 to 1500 ms is shown when increasing the number of hops from 1 to 6, using a more advanced media access strategy.…”
Section: Nan Communicationsmentioning
confidence: 90%
See 1 more Smart Citation
“…Similarly, Hosni et al [20] show delays of 800 ms per hop using a random scheduling method. Furthermore, a non-linear increase in latency per hop from 400 to 1500 ms is shown when increasing the number of hops from 1 to 6, using a more advanced media access strategy.…”
Section: Nan Communicationsmentioning
confidence: 90%
“…For a message to be received, all of the parts would have to be received by the domestic smart meter (which is assumed to have the capability of a local controller for the DSM resources). On the basis of [8,19,20] an estimate for the latency in a NAN network can be approximated as 1200 ± 900 ms for the first frame and another 300 ± 200 ms for consecutive frames depending on the size (up to five hops) and topology of the network, and media access strategy.…”
Section: Nan Communicationsmentioning
confidence: 99%
“…Another distributed scheduling algorithm is proposed in [17], where the communication end-to-end delay is bounded by guaranteeing the delivery of each packet within a single slotframe. The network is organized into stratums, so that nodes located in a given depth have the same stratum.…”
Section: Orchestra Schedulementioning
confidence: 99%
“…Despite its importance, the standard de nes the mechanisms to execute a communication schedule, but it does not define how the schedule is built, updated, and maintained [6]. Several scheduling algorithms have been proposed to solve this problem, which can be divided into two categories, centralized manner [7,8] and distributed manner [9][10][11][12]. In the centralized manner, a central controller has a precise view of the traffic and radio characteristics and allocates a set of transmission opportunities to each radio link.…”
Section: Introductionmentioning
confidence: 99%