• DocumentCode
    3008631
  • Title

    OCSA: An algorithm for burst mapping in IEEE 802.16e mobile WiMAX networks

  • Author

    So-In, Chakchai ; Jain, Raj ; Al Tamimi, A.-K.

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Washington Univ. in St. Louis, St. Louis, MO, USA
  • fYear
    2009
  • fDate
    8-10 Oct. 2009
  • Firstpage
    52
  • Lastpage
    58
  • Abstract
    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.
  • Keywords
    WiMax; jitter; mobile radio; quality of service; telecommunication standards; telecommunication switching; IEEE 802.16e mobile WiMAX networks; OCSA; QoS parameters; bin packing; burst mapping; delay-jitter; downlink subframe; heuristic algorithm; mapping decision; non-increasing area first mapping; one column striping; quality of service; rectangular mapping problem; resource allocation proposals; strip packing; Bandwidth; Computer science; Downlink; Drives; Frequency conversion; Mobile communication; Mobile computing; Quality of service; Resource management; WiMAX; Burst Mapping; IEEE 802.16e; Mobile WiMAX; QoS; Resource Allocation; Scheduling; Two-dimensional downlink mapping; WiMAX;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, 2009. APCC 2009. 15th Asia-Pacific Conference on
  • Conference_Location
    Shanghai
  • Print_ISBN
    978-1-4244-4784-8
  • Electronic_ISBN
    978-1-4244-4785-5
  • Type

    conf

  • DOI
    10.1109/APCC.2009.5375688
  • Filename
    5375688