Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Scheduling algorithms for multi-carrier wireless data systems
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Logarithmic delay for N × N packet switches under the crossbar constraint
IEEE/ACM Transactions on Networking (TON)
WiMAX: Technology for Broadband Wireless Access
WiMAX: Technology for Broadband Wireless Access
Realtime traffic scheduling for missed deadlines minimization in point-to-multipoint OFDMA systems
Proceedings of the 5th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
| Hi-index | 0.00 |
In this paper, we investigate a scheduling problem in systems adopting OFDMA transmission technique at the physical layer, like WiMAX (IEEE 802.16) systems. In such systems, carriers with different rates must be assigned to users, each carrier being assigned to one user at most, each user can be scheduled on multiple carriers. The objective of our problem is to produce a legal schedule (i.e. one meeting all the system constraints) with minimum length. We first show that the above problem is NP-complete, and thus computationally intractable, even in an extremely simple case. Then, we propose several very simple and fast suboptimal heuristics, and evaluate their average performance by means of simulation experiments. Some of the proposed heuristics perform very well, being in most cases within 10% of the optimal (minimal) schedule length.