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
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
OCSA: an algorithm for burst mapping in IEEE 802.16e mobile WiMAX networks
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Capacity evaluation for IEEE 802.16e mobile WiMAX
Journal of Computer Systems, Networks, and Communications - Special issue on WiMAX, LTE, and WiFi interworking
Heuristic algorithms for two-dimensional uplink burst construction in IEEE 802.16 networks
Computer Standards & Interfaces
Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX
Management Science
Journal of Network and Computer Applications
Mobile Information Systems
Hi-index | 0.00 |
Mobile WiMAX systems based on the IEEE 802.16e standard require all downlink allocations to be mapped to a rectangular region in the two dimensional subcarrier-time map. Many published resource allocation schemes ignore this requirement. It is possible that the allocations when mapped to rectangular regions may exceed the capacity of the downlink frame, and the QoS of some flows may be violated. The rectangle mapping problem is a variation of the bin or strip packing problem, which is known to be NP-complete. In a previous paper, an algorithm called OCSA (One Column Striping with nonincreasing Area first mapping) for rectangular mapping was introduced. In this paper, we propose an enhanced version of the algorithm. Similar to OCSA, the enhanced algorithm is also simple and fast to implement; however, eOCSA considers the allocation of an additional resource to ensure the QoS. eOCSA also avoids an enumeration process and so lowers the complexity to O(n2).