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.
Download full text files
Postprint. © 2025 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Statistics
Additional Services
