Time-Division-Based Cyclic Scheduling for UMTS High-Speed Downlink Shared-Channels

Third Generation Partnership Project working group proposes the high-speed downlink packet access to speed up downlink transmission for the universal mobile telecommunication system, where the time-division-based high-speed downlink shared-channel (HS-DSCH) approach is adopted. Our previous work pro...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on vehicular technology 2007-07, Vol.56 (4), p.2086-2094
Main Authors: Gan, Chai-Hien, Perng, Nei-Chiung, Lin, Phone, Kuo, Tei-Wei
Format: Article
Language:English
Subjects:
3G mobile communication
Analytical models
Applied sciences
Computer science
Computer simulation
Downlink
Elastic limit
Electronic mail
Equipments and installations
Exact sciences and technology
Gallium nitride
High speed
High-speed downlink packet access (HSDPA)
high-speed downlink shared-channel (HS-DSCH)
Joints
Laboratories
Mathematical analysis
Mobile radiocommunication systems
Multiaccess communication
orthogonal variable spreading factor (OVSF)
Partnerships
Radiocommunications
Rescheduling
Scheduling
Studies
Telecommunications
Telecommunications and information theory
Telecommunications industry
universal mobile telecommunication system (UMTS)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Third Generation Partnership Project working group proposes the high-speed downlink packet access to speed up downlink transmission for the universal mobile telecommunication system, where the time-division-based high-speed downlink shared-channel (HS-DSCH) approach is adopted. Our previous work proposed the shared-channel assignment and scheduling (SCAS) scheme to efficiently schedule the DSCH to serve different connections, which guarantees the requested transmission rate for each connection. However, limitations exist in the SCAS scheme: 1) the requested transmission rates of connections must be two's power numbers of the basic transmission rate and 2) all served connections should be rescheduled while a new request is granted, which introduces extra rescheduling overhead to the system. This paper proposes the elastic shared-channel assignment and scheduling (eSCAS) scheme to overcome these limitations. We formally prove the correctness of the eSCAS scheme. An analytical model and simulation experiments are conducted to compare the performance for eSCAS and SCAS. Our study shows that eSCAS can significantly improve the acceptance rate for new connections without increasing the rescheduling overhead.
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2007.897648