Resource Allocation is All You Need: The Routing and Scheduling Problem in 6TiSCH Networks

Deterministic Wireless Sensor Networks over IEEE 802.15.4 can provide latency-bounded transmission of flows, which is an important enabler for current and future Internet of Things (IoT) use cases. To realise such networks, a viable routing and scheduling solution must be found that can accept all given flows and maintain their latency requirements. The joint routing and scheduling (JRaS) problem promises optimal routing and scheduling decisions-however, at the expense of very high computation times. To overcome this issue, we propose efficient modifications to the separate routing and scheduling problems, such that we can obtain a success rate similar to the optimal JRaS approach. However, our solutions can be found in much less time. We conduct extensive performance evaluations for different problem complexities and found a speedup in the range of 3.03× up to 6.09× compared to JRaS while having almost no statistical difference in success rates.

Authors

Institutions

Publication Details

Published
2025-03-24
DOI
https://doi.org/10.1109/wcnc61545.2025.10978203
Primary Topic
Interconnection Networks and Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Resource Allocation is All You Need: The Routing and Scheduling Problem in 6TiSCH Networks

Michael Seufert, Jörg Hähner, Henning Cui, Victor Gerling
Interconnection Networks and Systems
article

Resource Allocation is All You Need: The Routing and Scheduling Problem in 6TiSCH Networks

Michael Seufert, Jörg Hähner, Henning Cui, Victor Gerling
article en

Abstract

Deterministic Wireless Sensor Networks over IEEE 802.15.4 can provide latency-bounded transmission of flows, which is an important enabler for current and future Internet of Things (IoT) use cases. To realise such networks, a viable routing and scheduling solution must be found that can accept all given flows and maintain their latency requirements. The joint routing and scheduling (JRaS) problem promises optimal routing and scheduling decisions-however, at the expense of very high computation times. To overcome this issue, we propose efficient modifications to the separate routing and scheduling problems, such that we can obtain a success rate similar to the optimal JRaS approach. However, our solutions can be found in much less time. We conduct extensive performance evaluations for different problem complexities and found a speedup in the range of 3.03× up to 6.09× compared to JRaS while having almost no statistical difference in success rates.

University of Augsburg (DE)
Openalex Percentile: Top 90%
Interconnection Networks and Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.