skip to main content
10.1145/1143549.1143799acmconferencesArticle/Chapter ViewAbstractPublication PagesiwcmcConference Proceedingsconference-collections
Article

Scheduling algorithms with error rate consideration in HSDPA networks

Published:03 July 2006Publication History

ABSTRACT

The probability of transmission failure under a given wireless condition and instantaneous transmission rate is introduced as a new scheduling metric to improve the performance of existing scheduling algorithms. Scheduling algorithms for high-speed downlink packet access (HSDPA) in wideband code division multiple access (WCDMA) networks generally deal with the instantaneous transmission rate of each user as a key parameter reflecting the time-varying and locationdependent characteristics of the wireless channel. As a more detailed measure of the wireless condition of each user, the error rate metric improves the effectiveness of sharing resources without sacrificing a good balance between system performance and user fairness. Simulation results demonstrate that a performance gain of approximately 20% can be achieved for several well-known scheduling algorithms when the error rate is taken into account.

References

  1. P. Bender, P. Black, M. Grob, R. Padovani, N. Sindhushayana, and A. Viterbi. CDMA/HDR: A bandwidth efficient high-speed wireless data service for nomadic users. IEEE Communications Magazine, 38(7):70--77, July 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. F. Berggren and R. Jantti. Multiuser scheduling over rayleigh fading channels. In Proc. IEEE Globecom 2003, December 2003.Google ScholarGoogle ScholarCross RefCross Ref
  3. T. Bonald, S. C. Borst, and A. Proutière. Inter-cell scheduling in wireless data networks. In Proc. European Wireless Conference 2005, April 2005.Google ScholarGoogle Scholar
  4. Y.-J. Choi, S. Bahk, and K. B. Lee. WAF: wireless-adaptive fair scheduling for multimedia stream. Electronics Letters, 39(14):1093--1094, July 2003.Google ScholarGoogle ScholarCross RefCross Ref
  5. M. Hu, J. Zhang, and J. Sadowsky. Traffic aided opportunistic scheduling for downlink transmissions: Algorithms and performance bounds. In Proc. IEEE Infocom 2004, March 2004.Google ScholarGoogle Scholar
  6. F. Kelly. Charging and rate control for elastic traffic. European transactions on telecommunications, 8:33--37, 1997.Google ScholarGoogle Scholar
  7. X. Liu, E. Chong, and N. Shroff. Af ramework for opportunistic scheduling in wireless networks. Computer Networks Journal, 41(4):451--474, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Y. Ohta, M. Tsuru, and Y. Oie. Fairness property and TCP-level performance of unified scheduling algorithm in HSDPAn etworks. In 3rd European Conference on Universal Multiservice Networks, pages 185--195, October 2004.Google ScholarGoogle ScholarCross RefCross Ref
  9. Z. Zhang, Y. He, and E. K. P. Chong. Opportunistic downlink. scheduling for multiuser OFDM systems. In Proc. 2005 IEEE Wireless Communications and Networking Conference, pages 13--17, March 2005.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Scheduling algorithms with error rate consideration in HSDPA networks

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      IWCMC '06: Proceedings of the 2006 international conference on Wireless communications and mobile computing
      July 2006
      2006 pages
      ISBN:1595933069
      DOI:10.1145/1143549

      Copyright © 2006 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 3 July 2006

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader