Perfect periodic scheduling for binary tree routing in wireless networks
From MaRDI portal
Recommendations
Cites work
- A combinatorial algorithm for the TDMA message scheduling problem
- Adaptive general perfectly periodic scheduling
- Approximate dynamic programming for link scheduling in wireless mesh networks
- Arbitrary Throughput Versus Complexity Tradeoffs in Wireless Networks Using Graph Partitioning
- Dispatching in perfectly-periodic schedules
- Efficient algorithms for periodic scheduling
- Elementary Number Theory
- Energy efficient spatial TDMA scheduling in wireless networks
- General perfectly periodic scheduling
- Minimizing Service and Operation Costs of Periodic Scheduling
- Nearly optimal perfectly periodic schedules
- Perfect periodic scheduling for three basic cycles
- Wireless mesh networks: a survey
This page was built for publication: Perfect periodic scheduling for binary tree routing in wireless networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319999)