• DocumentCode
    2538038
  • Title

    Distributed algorithm for uplink scheduling in WiMAX networks

  • Author

    Morell, Antoni ; Seco-Granados, Gonzalo ; Vicario, José López

  • Author_Institution
    Telecommun. & Syst. Eng. Dept. (TES), Univ. Autonoma de Barcelona (UAB), Barcelona
  • fYear
    2008
  • fDate
    8-11 Sept. 2008
  • Firstpage
    257
  • Lastpage
    264
  • Abstract
    This work proposes an algorithm to perform the resource allocation in the uplink of an IEEE802.16 standard-based system. The approach is valid for point to multi-point (PMP) and also for tree-deployed mesh networks, already defined for the Worldwide Interoperability for Microwave Access (WiMax). Our solution is based on a proportionally fair distribution of resources and it is formulated using the network utility maximization (NUM) framework. Thanks to convex decomposition techniques, we derive a novel way of solving the NUM problem in a distributed manner. The goal is to attain the global optimal scheduling at the subscriber stations (SS) without the need of gathering information at a central node in the network. The results show significant gains in the time required to reach the optimal resource allocation for a given set of demands.
  • Keywords
    WiMax; distributed algorithms; open systems; optimisation; resource allocation; scheduling; telecommunication network topology; trees (mathematics); IEEE802.16 standard-based system; WiMax network; distributed algorithm; microwave access; network utility maximization; point-to-multipoint network; resource allocation; subscriber station; tree-deployed mesh network; uplink scheduling; worldwide interoperability; Bandwidth; Distributed algorithms; Mesh networks; Optimal scheduling; Physical layer; Portable media players; Quality of service; Resource management; Unicast; WiMAX;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Broadband Communications, Networks and Systems, 2008. BROADNETS 2008. 5th International Conference on
  • Conference_Location
    London
  • Print_ISBN
    978-1-4244-2391-0
  • Electronic_ISBN
    978-1-4244-2392-7
  • Type

    conf

  • DOI
    10.1109/BROADNETS.2008.4769085
  • Filename
    4769085