2017
DOI: 10.1016/j.comcom.2017.05.014
|View full text |Cite
|
Sign up to set email alerts
|

Self-healing distributed scheduling for end-to-end delay optimization in multihop wireless networks with 6TiSCh

Abstract: Time Slotted Channel Hopping (TSCH) is an amendment of the the IEEE 802.15.4 working group to provide a low-power Medium Access Control (MAC) for the Internet of Things (IoT). This standard relies on techniques such as channel hopping and bandwidth reservation to ensure both energy savings and reliable transmissions. Since many applications require low end-to-end delay (e.g. alarms), we propose here a distributed algorithm to schedule the transmissions with a short end-to-end delay. We divide the network in st… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 26 publications
(21 citation statements)
references
References 35 publications
0
21
0
Order By: Relevance
“…Blacklist information of the communication channel is generated at one node of each parent/child pair, and this information is embedded in data or ACK frames exchanged between the two nodes. Hosni et al [23] proposed a distributed scheduling based on the spectrum, which means the node group of the same hop count from the root. This scheme allocates a time-frequency block for each spectrum for collision avoidance.…”
Section: Related Workmentioning
confidence: 99%
“…Blacklist information of the communication channel is generated at one node of each parent/child pair, and this information is embedded in data or ACK frames exchanged between the two nodes. Hosni et al [23] proposed a distributed scheduling based on the spectrum, which means the node group of the same hop count from the root. This scheme allocates a time-frequency block for each spectrum for collision avoidance.…”
Section: Related Workmentioning
confidence: 99%
“…Wave [13] constructs a schedule such that a packet is delivered before the end of the slotframe, even if it has to be relayed by intermediate nodes. Hosni et al [14] organize the transmissions into stratums to upper bound the end-to-end delay, even in presence of retransmissions. SF0 [15] represents the default behavior of 6TiSCH.…”
Section: B Scheduling Algorithms For Tschmentioning
confidence: 99%
“…the longest bursts measured so far). 50 cells are reserved for 25 nodes: the probability to have colliding cells with a random assignment is in this case very high [19]. Because some of the cells are unused most of the time, the detection of colliding cells is even trickier.…”
Section: Efficiencymentioning
confidence: 99%