• DocumentCode
    443825
  • Title

    Proportional gradient satisfaction strategy in wireless scheduling

  • Author

    Chen, Haiquan ; Zhang, Deyun

  • Author_Institution
    Sch. of Electron. & Inf. Eng., Xi´´an Jiaotong Univ., China
  • Volume
    1
  • fYear
    2005
  • fDate
    23-26 Sept. 2005
  • Firstpage
    415
  • Lastpage
    418
  • Abstract
    Traditional scheduling strategies base their goals on maximizing the total system throughput. However, in recent research, the maximized total throughput does not necessarily represent the optimal system resource allocation. In this paper, we propose the proportional gradient satisfaction strategy (PGSS), which adds user satisfaction value to the existing scheduling criteria. PGSS schedules bandwidth in proportion to the temporal satisfaction gradient rather than original bandwidths used in traditional scheduling strategies. Moreover, PGSS substitutes user satisfaction value with its gradient to simplify the nonlinear problem of satisfaction value, traditionally solved by intelligence algorithms, in order to reduce the algorithm complexity to make PGSS practical to implement in a base station. Simulation shows that compared with proportional compensation algorithm, PGSS promotes the system aggregated satisfaction value and still guarantees the maximized system throughout.
  • Keywords
    gradient methods; radiocommunication; scheduling; intelligence algorithms; proportional gradient satisfaction strategy; wireless scheduling; Bandwidth; Base stations; Genetic algorithms; Reactive power; Resource management; Simulated annealing; Streaming media; Telecommunication traffic; Throughput; Traffic control;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications, Networking and Mobile Computing, 2005. Proceedings. 2005 International Conference on
  • Print_ISBN
    0-7803-9335-X
  • Type

    conf

  • DOI
    10.1109/WCNM.2005.1544070
  • Filename
    1544070