A Review of the Application ofMeta-Heuristic Algorithms to 2D Strip Packing Problems
Artificial Intelligence Review
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Scheduling in IEEE 802.16e Mobile WiMAX networks: key issues and a survey
IEEE Journal on Selected Areas in Communications - Special issue on broadband access networks: Architectures and protocols
Capacity estimation and TCP performance enhancement over mobile WiMAX networks
IEEE Communications Magazine
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
| Hi-index | 0.00 |
Most of IEEE 802.16e resource allocation proposals only focus on how to allocate the resources to meet QoS parameters such as throughput, delay, and delay-jitter. As described in the standard, the mapping from the allocation into downlink subframe for each burst needs to be in a rectangular shape. The rectangular mapping problem is a variation of a bin or strip packing problem, which is known to be NP complete. However, the mapping decision needs to be made within a few milliseconds for each Mobile WiMAX frame. In this paper, we introduce a heuristic algorithm, called One Column Striping with non-increasing Area first mapping (OCSA). The algorithm is fast and simple to implement and minimizes the unused slots in the frame.