Perfect periodic scheduling for binary tree routing in wireless networks
Authors:
- Eun-Seok KimEKEun-Seok Kim
- Celia A. GlassCGCelia A. Glass
Open Access
- 1 December 2015
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 247 (2) , 389-400
Abstract
No abstract availableKeywords
Funding Information
- EPSRC (EP/G036454/1)
This publication has 17 references indexed in Scilit:
- A combinatorial algorithm for the TDMA message scheduling problemComputational Optimization and Applications, 2007
- General Perfectly Periodic SchedulingAlgorithmica, 2006
- Wireless mesh networks: a surveyComputer Networks, 2005
- A column generation method for spatial TDMA scheduling in ad hoc networksAd Hoc Networks, 2004
- Efficient algorithms for periodic schedulingComputer Networks, 2004
- Joint scheduling and power control for wireless ad hoc networksIEEE Transactions on Wireless Communications, 2004
- Dispatching in perfectly-periodic schedulesJournal of Algorithms, 2003
- Nearly optimal perfectly periodic schedulesDistributed Computing, 2002
- Minimizing Service and Operation Costs of Periodic SchedulingMathematics of Operations Research, 2002
- Scheduling broadcasts in multihop radio networksIEEE Transactions on Communications, 1990