eOCSA: an algorithm for burst mapping with strict QoS requirements in IEEE 802.16e mobile WiMAX networks

  • Authors:
  • Chakchai So-In;Raj Jain;Abdel-Karim Al Tamimi

  • Affiliations:
  • Department of Computer Science & Engineering, Washington University in St. Louis, St. Louis, MO;Department of Computer Science & Engineering, Washington University in St. Louis, St. Louis, MO;Department of Computer Science & Engineering, Washington University in St. Louis, St. Louis, MO

  • Venue:
  • WD'09 Proceedings of the 2nd IFIP conference on Wireless days
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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).