Universal Mobile Telecommunications System (UMTS); UMTS 22.05
Scheduling in umts
-
Upload
hazamir-hamzah -
Category
Technology
-
view
1.994 -
download
2
Transcript of Scheduling in umts
![Page 1: Scheduling in umts](https://reader033.fdocuments.in/reader033/viewer/2022052412/5581ecbcd8b42a67508b4a38/html5/thumbnails/1.jpg)
29-09-2006 Geert Heijenk 1
Scheduling in the UMTS enhanced uplink
Camilo Orejuela Mesa & Geert HeijenkUniversity of Twente
Neill Whillans, Frank Brouwer & Sonia Heemstra de GrootTwente Institute for Wireless and Mobile Communications (WMC)
Cost 290, TD(06)052
September 29, 2006
![Page 2: Scheduling in umts](https://reader033.fdocuments.in/reader033/viewer/2022052412/5581ecbcd8b42a67508b4a38/html5/thumbnails/2.jpg)
29-09-2006 Geert Heijenk 2
Problem StatementAn important new technique for the UMTS
enhanced uplink, as defined in 3GPP Release 6 , is fast packet scheduling.
• How do different schedulers for the enhanced uplink compare?
• What is the suitability of our current ns2-based simulator, for evaluating these schedulers?
![Page 3: Scheduling in umts](https://reader033.fdocuments.in/reader033/viewer/2022052412/5581ecbcd8b42a67508b4a38/html5/thumbnails/3.jpg)
29-09-2006 Geert Heijenk 3
Outline• UMTS Enhanced Uplink• Enhanced Uplink Schedulers• Simulation• Conclusions & Future Work
![Page 4: Scheduling in umts](https://reader033.fdocuments.in/reader033/viewer/2022052412/5581ecbcd8b42a67508b4a38/html5/thumbnails/4.jpg)
29-09-2006 Geert Heijenk 4
UMTS Architecture
![Page 5: Scheduling in umts](https://reader033.fdocuments.in/reader033/viewer/2022052412/5581ecbcd8b42a67508b4a38/html5/thumbnails/5.jpg)
29-09-2006 Geert Heijenk 5
Enhanced UplinkHigh Speed Uplink Packet Access (HSUPA)
– Defined for 3GPP R6(HSDPA already in R5)
• Main features– increases throughput (→5.76 Mbps)– reduces latency
• Main new tecniques used:– Hybrid Automatic Retransmission Request
(HARQ)– Fast Packet Scheduling
(No higher order modulation)
![Page 6: Scheduling in umts](https://reader033.fdocuments.in/reader033/viewer/2022052412/5581ecbcd8b42a67508b4a38/html5/thumbnails/6.jpg)
29-09-2006 Geert Heijenk 6
Fast Packet Scheduling
• Based at the NodeB– reduces the delay– allows faster reaction than when residing at the RNC– controls the received power which is distributed among all
the users in the cell.
![Page 7: Scheduling in umts](https://reader033.fdocuments.in/reader033/viewer/2022052412/5581ecbcd8b42a67508b4a38/html5/thumbnails/7.jpg)
29-09-2006 Geert Heijenk 7
Scheduling SignallingUplink:
– Happy bit:A single bit field indicates whether the UE could use more resources or not.
– Total E-DCH buffer status
– Highest priority logical channel ID
– UE power headroom– Used transmit power?
Downlink:– Relative Grants:
“up”, “down” or “hold”, indicating the UE to step up, step down or hold the index of its allowed TFC
– Absolute Grants:allows the NodeBscheduler to directly adjust the resources of UEs under its control in one single command
![Page 8: Scheduling in umts](https://reader033.fdocuments.in/reader033/viewer/2022052412/5581ecbcd8b42a67508b4a38/html5/thumbnails/8.jpg)
29-09-2006 Geert Heijenk 8
2 extreme scheduling schemes
– Users perform uplink transmissions in parallel, with a low rate, so that the noise rise level at the NodeB does not exceed the established threshold.
– Only one or a set of UEsare allowed to transmit at a given time so that the noise rise level at the NodeB does not exceed the established threshold.
![Page 9: Scheduling in umts](https://reader033.fdocuments.in/reader033/viewer/2022052412/5581ecbcd8b42a67508b4a38/html5/thumbnails/9.jpg)
29-09-2006 Geert Heijenk 9
Scheduling Procedure• UE requests resources (bit rate)• NodeB determines allowed rates for UEs,
based on scheduling scheme (see next slides)Condition:– UEs must meet their required BLER– total received power below threshold (noise rise target)
• NodeB sends grant (allowed rate) to UE• UE sends at granted rate
– Or at lower rate if max power reached, lower grant from other nodeB, or not enough data
– Delay from request to sending typically a few TTI (we assume 7, i.e. 14 ms)
![Page 10: Scheduling in umts](https://reader033.fdocuments.in/reader033/viewer/2022052412/5581ecbcd8b42a67508b4a38/html5/thumbnails/10.jpg)
29-09-2006 Geert Heijenk 10
UE 1UE 2UE 3UE 4
Rate
P
PP
P
UE 1UE 2UE 3UE 4
Rate
TTI Time
Schedulers (1/2)– Rate Scheduling:
Try to grant to all active UEs, assigning them low rates.
– Round Robin Scheduling:Try to grant to a few UEs with the maximum rate.
![Page 11: Scheduling in umts](https://reader033.fdocuments.in/reader033/viewer/2022052412/5581ecbcd8b42a67508b4a38/html5/thumbnails/11.jpg)
29-09-2006 Geert Heijenk 11
P P P P
UE 1
UE 2
UE 3
UE 4
Rate
RateP
PP
UE 1
UE 2
UE 3
UE 4
TTI
P
time
Schedulers (2/2)– Uplink CQI:
Always selects the UE with best UCQI and grants it with the maximum rate.
– Rate Estimation:Estimate the rate capabilities of the UEs to assign a rate.
![Page 12: Scheduling in umts](https://reader033.fdocuments.in/reader033/viewer/2022052412/5581ecbcd8b42a67508b4a38/html5/thumbnails/12.jpg)
29-09-2006 Geert Heijenk 12
Simulator• Ns2-based• Detailed implementation of HARQ and fast
scheduling• Single cell
(fixed other-to-own cell interference ratio)• Link-level included by means of AVI:
(Actual Value Interface:look-up tables for Eb/N0 BLER)
• Path loss and shadowing based on position• Multi-path fading precalculated
![Page 13: Scheduling in umts](https://reader033.fdocuments.in/reader033/viewer/2022052412/5581ecbcd8b42a67508b4a38/html5/thumbnails/13.jpg)
29-09-2006 Geert Heijenk 13
BLER 0 .1N o is e Ris e Ta r g e t 6 d B
TTI d u r a t io n 2 m s - 1 0 m sMa x UE t r a n s m is s io n p o we r 2 6 d Bm (-4 d B)
UE s p e e d 3 Km p hC e ll r a d iu s 1 .5 Km
N u m b e r o f UEs 2 4Tr a ffic r a t e p e r b u r s t 2 5 0 Kb p sBu r s t p e r io d 5 s e c
Id le p e r io d 5 s e c
Simulation Parameters
![Page 14: Scheduling in umts](https://reader033.fdocuments.in/reader033/viewer/2022052412/5581ecbcd8b42a67508b4a38/html5/thumbnails/14.jpg)
29-09-2006 Geert Heijenk 14
Mean StdRate scheduling -3.59 2.5Round Robin -5.46 3.05Rate Est im at ion -5.36 3.04UCQI -9.58 7.1
0
200
400
600
800
1000
1200
1400
1600
1800
Rate schedulingRoudRobinRate Estim SchUCQI
Thro
ugp
ut (
Kb
ps)
Average Cell Throughput (kbps)
Total Transmitted Power (dB)
![Page 15: Scheduling in umts](https://reader033.fdocuments.in/reader033/viewer/2022052412/5581ecbcd8b42a67508b4a38/html5/thumbnails/15.jpg)
29-09-2006 Geert Heijenk 15
Mean StdRate scheduling 0.36 0.22Round Robin 0.22 0.16Rate Est im at ion 0.21 0.14UCQUI 0.16 1.72MAC MAC
RLC RLC
PHY PHY
UE NodeB
t1 t2
delay=t2-t1
Delay (sec)
![Page 16: Scheduling in umts](https://reader033.fdocuments.in/reader033/viewer/2022052412/5581ecbcd8b42a67508b4a38/html5/thumbnails/16.jpg)
29-09-2006 Geert Heijenk 16
Conclusions & Future Work• Fast packet scheduling for the UMTS enhanced
uplink can benefit from:– Scheduling few users at the same time with high bit rates.– Using the channel condition as a scheduling parameter to
take advantage of the rapid reaction to channel variations.– Estimating the maximum rate that the UEs are able to
support
• To reliably compare and quantify the performance of schedulers, a multi-cell simulator is a necessity