2016
DOI: 10.1007/978-3-319-40509-4_4
|View full text |Cite
|
Sign up to set email alerts
|

Kausa: KPI-aware Scheduling Algorithm for Multi-flow in Multi-hop IoT Networks

Abstract: The telecommunication operators focus on the Internet of Things (IoT) and route the traffic of several clients on a multi-hop infrastructure. Operators need to offer Service Level Agreements (SLAs) to each client, guaranteeing a minimum reliability or a maximum delay for each application. The deterministic IETF 6TiSCH protocol stack is particularly appropriate to provide SLA guarantees, because it allocates dedicated time-frequency blocks for a given traffic. We propose Kausa, a scheduling algorithm to assign … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
3

Relationship

4
4

Authors

Journals

citations
Cited by 11 publications
(20 citation statements)
references
References 10 publications
0
20
0
Order By: Relevance
“…Some scheduling algorithms reserve a range of consecutive cells for retransmissions to optimize the end-to-end delay [21]. The number of cells in this range has to be sufficient to handle the worst case situation, with possibly a very large number of cells (Eq.…”
Section: B Delay Constraint With Dynamic Schedulingmentioning
confidence: 99%
“…Some scheduling algorithms reserve a range of consecutive cells for retransmissions to optimize the end-to-end delay [21]. The number of cells in this range has to be sufficient to handle the worst case situation, with possibly a very large number of cells (Eq.…”
Section: B Delay Constraint With Dynamic Schedulingmentioning
confidence: 99%
“…2) Safety: Most critical applications require that a packet is delivered within a given deadline. Unfortunately, tackling such an end-to-end delay constraint is particularly challenging in multi-hop topologies, since fixing the instant of emission for the first hop may create a domino effect [61]. Only a few scheduling algorithms have been proposed to tackle this problem [62].…”
Section: B Open Problems For Distributed Schedulingmentioning
confidence: 99%
“…Shared Slot Retransmissions [28] x x x x x x Improve e2e reliability [62] x x x x Shared cells for retx & cells stealing Lower-Bound Reliability [63] [64] x x x Strengthen the schedule with dedicated retx cells [65] x x x x Greedy allocation will flow constraints Hop-Count Based [66] x x x x Sequential scheduling with retx cells Model Training [67] [68] x x x x Burstiness aware scheduling Graph Routing [69] [70] x x x x Redundant slots for the optimal path [71] x x x x Multiparent scheduling [72] x x x x Multipath scheduling [73] x x x x Multipath scheduling…”
Section: Fault Minimizationmentioning
confidence: 99%