• DocumentCode
    2420891
  • Title

    Max-Min Fair Scheduling in OFDMA-Based Multi-Hop WiMAX Mesh Networks

  • Author

    Bai, Shi ; Zhang, Weiyi ; Liu, Yang ; Wang, Chonggang

  • Author_Institution
    Dept. of Comput. Sci., North Dakota State Univ., Fargo, ND, USA
  • fYear
    2011
  • fDate
    5-9 June 2011
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    The emerging WiMAX technology (IEEE 802.16) is a fourth generation standard for low-cost, high-speed and long range wireless communications for a large variety of civilian and military applications. IEEE 802.16j has introduced the concept of mesh network model and a special type of node called Relay Station (RS) for traffic relay for Subscriber Stations (SSs). A WiMAX mesh network is able to provide larger wireless coverage, higher network capacity and Non-Line-Of-Sight (NLOS) communications. This paper studies a Multi-hop FAir Scheduling for Throughput Optimization (MFASTO) problem in WiMAX mesh networks. The goal here is to maximize the minimum satisfaction ratio among all the SSs. In order to solve the MFASTO problem, an ILP formulation and an efficient heuristic algorithm are proposed in this work. Simulation results are presented to justify the performance and efficiency of our proposed solutions.
  • Keywords
    OFDM modulation; WiMax; frequency division multiple access; integer programming; linear programming; minimax techniques; telecommunication traffic; wireless mesh networks; IEEE 802.16j; ILP formulation; MFASTO problem; NLOS communication; OFDMA; heuristic algorithm; max-min fair scheduling; multihop WiMAX mesh network; multihop fair scheduling for throughput optimization; network capacity; nonline-of-sight communication; relay station; subscriber station; traffic relay; wireless communication; Mesh networks; Peer to peer computing; Relays; Resource management; Scheduling; Throughput; WiMAX;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications (ICC), 2011 IEEE International Conference on
  • Conference_Location
    Kyoto
  • ISSN
    1550-3607
  • Print_ISBN
    978-1-61284-232-5
  • Electronic_ISBN
    1550-3607
  • Type

    conf

  • DOI
    10.1109/icc.2011.5963242
  • Filename
    5963242