Академический Документы
Профессиональный Документы
Культура Документы
' ;
where
ssigned
R
is the ma-imum !"C allowed in !"C# assigned to E-131C2 during the current
scheduling period .EDPDCH_PRD/ and UE is allowed to transmit on the E-131C2 until the
&'tionTime of the ne-t assignment, and / .
ma-
po*er R is the ma-imum !"C allowed in !"C# that the
UE can support given its power limit%
Capacity Computation& !he +
th
cell capacity is estimated from the measured UEs6 Sinrs% !he Sinr is the
average combined Sinr per antenna% !he combining over multiple fingers is per slot% !he averaging over
different antennas of the cell of interest is over the duration of a !!I% !here is no combining over different
cells in case of UE in softer-handoff% !he following formula is used to estimate Lod contribution to a cell
antenna&
. /
. /
) . /
+ i
+
+ &'ti,eSet i
+ i
Sinr R
Lod
Sinr R
3GPP
3
where
. /
+ i
Sinr R
is the estimated Sinr if the UE transmits a rate
i
R on E-131C2
( )
(
. / . A / ) . A /
i
+ i 'p t + eu ' R
Sinr R E - +
1
1
]
%
+ t 'p
- E / A .
is the measured pilot Sinr, obtained as the frame average pilot Sinr averaged over two
antennas,
eu
and
'
are the beta factors for E-1C2 and 13CC2, respectively%
Let the Lod constraint be
Lod Lod
+
ma-
, such that the rise-over-thermal overshoot above a
certain threshold is limited to a certain value% !he available capacity is decreased by the resources
consumed by pilots or autonomous transmissions, and the estimate of the scheduled rates .
estimted
R / of
the UEs in #2> for which the Node- is not the serving .and therefore not the scheduling one/%
min
min
,
is not scheduling
.ma-.*, //
. / ma-
) .ma-.*, //
. /
) .R /
TFC
,i(b(e
TCFC
+
+ &'ti,eSet
+
+ estimded
+ &'ti,eSet
+ estimted
+
Sinr R
C + Lod
Sinr R
Sinr R
Sinr
+
+
where ma- Lod is the ma-imum Lod for which the rise-over-thermal outage criteria is satisfied% Ehen
resources ta'en in a non-scheduling Node- from a UE in #2> is computed, the simplest approach is to
account for the rate that has been transmitted in the UE6s previous 20R; process% It is not a perfect
measure, but because of 20R;, it will often be a good estimate%
#cheduling 0lgorithm& !he scheduling algorithm has two maFor characteristics
)% 3rioriti$ation of UE re4uests
(% .reedy filling for ma-imum capacity utili$ation
!he right to transmit on the uplin' is granted to the highest priority UE first, then
successively to lower priority UEs% !he UEs are assigned the ma-imum !"C allowed in
!"C# based on its re4uest and available capacity%
%niti(i$tion&
!he UE re4uests are prioriti$ed according to a priority function%
0ssociated with each UE is a priority count 3RI>RI!G%
3RI>RI!G of a UE is initiali$ed to * in the beginning of the simulation% Ehen a new UE enters the
system with cell + as the primary cell, or its buffer becomes non-empty after being idle due to the lac'
of data, its 3RI>RI!G is set to
minB3RI>RI!G, such that +# has sector as the primary sectorD i
i
i + %
&(gorithm/
)% #et 'H)
(% !he UE at the )
th
position in the 4ueue is assigned the rate
)
R given by
3GPP
4
ma-
. /
C . /
) . /
.ma-.*, //
min . /, arg ma- *I
) .ma-.*, //
is the scheduling sector
,i(b(e
uto
uto
+
+
+ )
)
R
+
Sinr R
R C +
Sinr R
Sinr R
R R s
Sinr R
+
1
+
1
+
1
1
1
' ;
+
1
1
1
1
]
If scheduling is per 20R; process, the scheduler assigns the rate
)
R as determined above if
there is no retransmission, and otherwise,
)
R is set to the corresponding previous transmission
rate%
<% !he available capacity is updated to&
. / .ma-.*, //
. / . / I
) . / ) .ma-.*, //
is the scheduling sector
uto
,i(b(e ,i(b(e
uto
+ ) +
+ ) +
Sinr R Sinr R
C + C +
Sinr R Sinr R
+
+
+ +
=% Calculate new 3RI>RI!G)
J% ) H ):)I if ) K total number of UEs in the list, ,o to #tep ), otherwise, stop%
Priority Fun'tion 1 &n E!mp(e/
3roportional "air& In order to guarantee throughput-wise fairness, the prioriti$ing function is
defined in terms of the proportional fairness&
ma-
3RI>RI!G
)
)
)
R
r
,
where
)
r is the average ma-imum !"C allowed in !"C# already allocated to the UE by the
scheduler, and
ma-
)
R is the ma-imum !"C allowed in !"C# based on UE buffer and power
constraints% !he average allocated ma-imum !"C allowed in !"C# is updated at each scheduling
interval as&
( ) ( )
) )
) .) /
) ) )
r t r t R
T' T'
+ + ,
where
'
T is the time constant of the low-pass filter and is e4ual to )*%
)
R is the current
allocated ma-imum !"C allowed in !"C# of the )
th
UE%
+GKspace@3L0N to )))
3GPP
5