A decentralized algorithm based on generalized pinwheel scheduling guarantees hard end-to-end deadlines in multi-hop wireless networks under interference while achieving near-optimal throughput.
Accessed: 03-21-2024
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Scheduling in Multi-Hop Wireless Networks With Deadlines
A decentralized algorithm based on generalized pinwheel scheduling guarantees hard end-to-end deadlines in multi-hop wireless networks under interference while achieving near-optimal throughput.