Approximate algorithms scheduling parallelizable tasks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Efficient approximation algorithms for scheduling malleable tasks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Linear-time approximation schemes for scheduling malleable parallel tasks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Wireless Networks
On rectangle packing: maximizing benefits
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Packing weighted rectangles into a square
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
LMDS systems and their application
IEEE Communications Magazine
A scheme for real-time channel establishment in wide-area networks
IEEE Journal on Selected Areas in Communications
Efficient two-dimensional data allocation in IEEE 802.16 OFDMA
INFOCOM'10 Proceedings of the 29th conference on Information communications
A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX
Management Science
| Hi-index | 0.00 |
We study the problem of scheduling transmissions on the downlink of IEEE 802.16/WiMAX systems that use the OFDMA technology. These transmissions are scheduled using a matrix whose dimensions are frequency and time, where every matrix cell is a time slot on some carrier channel. The IEEE 802.16 standard mandates that: (i) every transmission occupies a rectangular set of cells, and (ii) transmissions must be scheduled according to a given order. We show that if the number of cells required by a transmission is not limited (up to the matrix size), the problem of maximizing matrix utilization is very hard to approximate. On the positive side we show that if the number of cells of every transmission is limited to some constant fraction of the matrix area, the problem can be approximated to within a constant factor. As far as we know this is the first paper that considers this sequential rectangle placement problem.