Skip to main content

Real-Time Traffic Packet Scheduling Algorithm in HSDPA System Considering the Maximum Tolerable Delay and Channel Assignment

  • Conference paper
  • 1233 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4523))

Abstract

In this paper, we consider a new packet scheduling algorithm for real time traffic in the high speed downlink packet access system that has been introduced for WCDMA system to providing high transmission rates. The objective of the design is to meet the maximum tolerable delay and consider the channel assigning based on the received SIR for real-time traffic users. The proposed scheduling algorithm shows that the users are ranked by the ratios of the bits in the buffer to the residual time for transmission, the ranked users are assigned channels based on the SIR value table and get service one by one. The simulation results show that the proposed algorithm can provide the lower packet drop rate for real time quality of service (QoS) requirement.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 3GPP, 3G TR 25.848. Physical Layer Aspects of UTRA High Speed Downlink Packet Access

    Google Scholar 

  2. Holma, H., Toskala, A.: WCDMA for UMTS Radio Access for Third Generation Mobile Communication. John Wiley & Sons, Chichester (2004)

    Google Scholar 

  3. Ofuji, Y., Morimoto, A., Abeta, S., Sawahashi, M.: Comparison of packet scheduling algorithms focusing on user throughput in high speed downlink packet access. In: Proc. Of IEEE PRMRC’02, vol. 3, pp. 1462–1466 (2002)

    Google Scholar 

  4. Ramanan, K., Stolyar, A., Whiting, P., Andrews, M., Kumaran, K., Vijayakumar, R.: Providing quality of service over a shard wireless link. IEEE communication Magazine 39(2), 150–154 (2001)

    Article  Google Scholar 

  5. Kim, D.H., Ryu, B.H., Kang, C.G.: Packet Scheduling Algorithm Considering a Minimum Bit Rate for Non-realtime Traffic in an OFDMA/FDD-Based Mobile Internet Access System. ETRI Journal 26(1), 48–52 (2004)

    Google Scholar 

  6. Adamou, M., Khanna, S., Lee, I., Shin, I., Zhou, S.: Fair Real-time Traffic Scheduling over A Wireless LAN. In: Proceedings of 22nd IEEE Real-Time Systems Symposium (RTSS 2001), pp. 279–288 (2001)

    Google Scholar 

  7. Ong, C.J., Chong, P.H.J., Kwan, R.: Effect of Various Packet Scheduling Algorithms on the Performance of High Speed Downlink Shared Channel in a WCDMA Network. In: IEEE Pacific Rim Conference on Communications, Computers and signal Processing (PACRIM 2003), pp. 935–937 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Yann-Hang Lee Heung-Nam Kim Jong Kim Yongwan Park Laurence T. Yang Sung Won Kim

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Yu, X., Kim, S.W., Park, Y.W. (2007). Real-Time Traffic Packet Scheduling Algorithm in HSDPA System Considering the Maximum Tolerable Delay and Channel Assignment. In: Lee, YH., Kim, HN., Kim, J., Park, Y., Yang, L.T., Kim, S.W. (eds) Embedded Software and Systems. ICESS 2007. Lecture Notes in Computer Science, vol 4523. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72685-2_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72685-2_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72684-5

  • Online ISBN: 978-3-540-72685-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics