後卓越計畫進度報告 楊舜仁老師實驗室 2007.08.13. 2 overlapping ra scheme reduce the...
Post on 15-Jan-2016
225 views
TRANSCRIPT
後卓越計畫進度報告
楊舜仁老師實驗室2007.08.13
2
Overlapping RA Scheme Reduce the RAU cost caused by the ping-pong effect
In overlapping RA scheme, one cell may belong to two or more RAs
MS MS
RA1
# of RAU = 2 # of RAU = 1
RA2 RA1 RA2
Non-overlapping Overlapping
Each cell has a corresponding RAC list The first one in the RAC list is called the default RA
C (DRAC) The others are called the overlapping RACs (ORAC
s) RAC distribution: Every RAC list consists of an RA
C distribution for MSs Express the proportion for MSs registering to RA i
0,0 0,1 0,2
1,0 1,1 1,2
2,0 2,1 2,2
0,3 0,4 0,5
1,3 1,4 1,5
2,3 2,4 2,5
RA 1 RA 4
RAC distribution = {RAC(4)/0.68,RAC(1)/0.32}
RAC list = {RAC(1)} RAC list = {RAC(4)}
RAC list = {RAC(4),RAC(1)} DRAC = RAC(4)ORAC = {RAC(1)}
distributed value
3
2,2 2,3 2,4 2,5
3,1 3,2
4,1 4,2
5,1 5,2
3,3 3,4 3,5
4,3 4,4 4,5
5,3 5,4 5,5
3,6
4,6
5,6
6,2
7,2
6,3 6,4 6,5
7,3 7,4 7,5
8,3 8,4 8,5
6,6
7,6
RA i
6,1
7,1
8,2
2,2 2,3 2,4 2,5
3,1 3,2
4,1 4,2
5,1 5,2
3,3 3,4 3,5
4,3 4,4 4,5
5,3 5,4 5,5
3,6
4,6
5,6
6,2
7,2
6,3 6,4 6,5
7,3 7,4 7,5
8,3 8,4 8,5
6,6
7,6
RA i
6,1
7,1
8,2
Propose Scheme
We propose a dynamic RA adjustment algorithm for with overlapping RA configuration According to user mobility and call
The cells are included in initial RA i Be referred to as the core cells of
RA i Never be removed from RA I
The RA adjustment algorithm only includes or excludes those cells at RA boundaries External boundary, Internal boundary,
Internal boundary
External boundary
3,3 3,4 3,5
4,3 4,4 4,5
5,3 5,4 5,5
RA i
Core cells
4
Network Loads Assumption
: the number of MSs moving from cell (x,y) to cell (x’,y’)
: the RAU probability of the MSs from cell (x,y) to cell (x’,y’) e.g.
: the number of incoming call arrivals to cell j
: the number of cells in RA i
: the distributed value for RAC(i) RAU load :
# of MSs performing the RAU RAU load from cell (x,y) to cell (x’,y’)
Paging load # of MSs in RA i
Paging load of cell j to RA i
0,0 0,1 0,2
1,0 1,1 1,2
2,0 2,1 2,2
0,3 0,4 0,5
1,3 1,4 1,5
2,3 2,4 2,5
RA 1 RA 4
RAC distribution = {RAC(4)/0.68, RAC(1)/0.32}
RAC distribution = {RAC(4)/1.0}
32.0)3,0(),3,1( P
)','(),,(*)','(),,()','(),,( yxyxPyxyxNyxyxLu the number of incoming call
arrivalsthe number of incoming call
arrivals
5
Adjustment Algorithm
Select the next RA i to adjust
Determine if any cell j in SI,B(i)-Sk(i) should
be removed from RA i
Determine if any cell k in SE,B(i) should be
added into RA i
Checks if the state is stable?
no yes
6
Remove a cell from RA i Selects the cell that has
the highest paging load to RA i
0,0 0,1 0,2
1,0 1,1 1,2
2,0 2,1 2,2
0,3 0,4 0,5
1,3 1,4 1,5
2,3 2,4 2,5
0,6 0,7 0,8
1,6 1,7 1,8
2,6 2,7 2,8
3,0 3,1 3,2
4,0 4,1 4,2
5,0 5,1 5,2
3,3 3,4 3,5
4,3 4,4 4,5
5,3 5,4 5,5
3,6 3,7 3,8
4,6 4,7 4,8
5,6 5,7 5,8
6,0 6,1 6,2
7,0 7,1 7,2
8,0 8,1 8,2
6,3 6,4 6,5
7,3 7,4 7,5
8,3 8,4 8,5
6,6 6,7 6,8
7,6 7,7 7,8
8,6 8,7 8,8
RA 1
RA 2
RA 3
RA 4
RA 5
RA 6
RA 7
RA 8
RA 9
0,0 0,1 0,2
1,0 1,1 1,2
2,0 2,1 2,2
0,3 0,4 0,5
1,3 1,4 1,5
2,3 2,4 2,5
0,6 0,7 0,8
1,6 1,7 1,8
2,6 2,7 2,8
3,0 3,1 3,2
4,0 4,1 4,2
5,0 5,1 5,2
3,3 3,4 3,5
4,3 4,4 4,5
5,3 5,4 5,5
3,6 3,7 3,8
4,6 4,7 4,8
5,6 5,7 5,8
6,0 6,1 6,2
7,0 7,1 7,2
8,0 8,1 8,2
6,3 6,4 6,5
7,3 7,4 7,5
8,3 8,4 8,5
6,6 6,7 6,8
7,6 7,7 7,8
8,6 8,7 8,8
RA 1
RA 2
RA 3
RA 4
RA 5
RA 6
RA 7
RA 8
RA 9
0,0 0,1 0,2
1,0 1,1 1,2
2,0 2,1 2,2
0,3 0,4 0,5
1,3 1,4 1,5
2,3 2,4 2,5
0,6 0,7 0,8
1,6 1,7 1,8
2,6 2,7 2,8
3,0 3,1 3,2
4,0 4,1 4,2
5,0 5,1 5,2
3,3 3,4 3,5
4,3 4,4 4,5
5,3 5,4 5,5
3,6 3,7 3,8
4,6 4,7 4,8
5,6 5,7 5,8
6,0 6,1 6,2
7,0 7,1 7,2
8,0 8,1 8,2
6,3 6,4 6,5
7,3 7,4 7,5
8,3 8,4 8,5
6,6 6,7 6,8
7,6 7,7 7,8
8,6 8,7 8,8
RA 1
RA 2
RA 3
RA 4
RA 5
RA 6
RA 7
RA 8
RA 9
Determine if any cell j in SI,B(i)-Sk(i) should
be removed from RA i
Remove RAC(i) from the RAC list of
cell j
yes
Set RM_cell to 1Set RM_cell to 0
no
Modify SI,B(i) and SE,B(i) accordingly
(2)
(4)
(5)
(6)
Determine if any cell k in SE,B(i) should be
added into RA i
(7)
Does such a cell j exist?
Determine if any cell j in SI,B(i)-Sk(i) should
be removed from RA i
Remove RAC(i) from the RAC list of
cell j
yes
Set RM_cell to 1Set RM_cell to 0
no
Modify SI,B(i) and SE,B(i) accordingly
(2)
(4)
(5)
(6)
Determine if any cell k in SE,B(i) should be
added into RA i
(7)
Does such a cell j exist?
Determine if any cell j in SI,B(i)-Sk(i) should
be removed from RA i
Remove RAC(i) from the RAC list of
cell j
yes
Set RM_cell to 1Set RM_cell to 0
no
Modify SI,B(i) and SE,B(i) accordingly
(2)
(4)
(5)
(6)
Determine if any cell k in SE,B(i) should be
added into RA i
(7)
Does such a cell j exist?
Determine if any cell j in SI,B(i)-Sk(i) should
be removed from RA i
Remove RAC(i) from the RAC list of
cell j
yes
Set RM_cell to 1Set RM_cell to 0
no
Modify SI,B(i) and SE,B(i) accordingly
(2)
(4)
(5)
(6)
Determine if any cell k in SE,B(i) should be
added into RA i
(7)
Does such a cell j exist?
Determine if any cell j in SI,B(i)-Sk(i) should
be removed from RA i
Remove RAC(i) from the RAC list of
cell j
yes
Set RM_cell to 1Set RM_cell to 0
no
Modify SI,B(i) and SE,B(i) accordingly
(2)
(4)
(5)
(6)
Determine if any cell k in SE,B(i) should be
added into RA i
(7)
Does such a cell j exist?
Determine if any cell j in SI,B(i)-Sk(i) should
be removed from RA i
Remove RAC(i) from the RAC list of
cell j
yes
Set RM_cell to 1Set RM_cell to 0
no
Modify SI,B(i) and SE,B(i) accordingly
(2)
(4)
(5)
(6)
Determine if any cell k in SE,B(i) should be
added into RA i
(7)
Does such a cell j exist?
Cell Exclusion
Let cell j be the cell in SI,B(i)-Sk(i) that has the highest
paging load
Compute the paging cost Cp(b)(i)
of RA i before cell j is removed
Ip(i) > Δp and Cu
(a)(i) < Θu?no
Determine that cell j should be removed
from RA i
yes
(2.1)
(2.2)
Predict the location update cost Cu
(a)(i) and paging cost Cp(a)(i)
of RA i after cell j is removed
(2.3)
Compute Ip(i) = Cp
(b)(i)-Cp(a)(i)
Cp(b)(i)
(2.4)
Determine that no cell should be
removed from RA i
(2.5) (2.6)
Let cell j be the cell in SI,B(i)-Sk(i) that has the highest
paging load
Compute the paging cost Cp(b)(i)
of RA i before cell j is removed
Ip(i) > Δp and Cu
(a)(i) < Θu?no
Determine that cell j should be removed
from RA i
yes
(2.1)
(2.2)
Predict the location update cost Cu
(a)(i) and paging cost Cp(a)(i)
of RA i after cell j is removed
(2.3)
Compute Ip(i) = Cp
(b)(i)-Cp(a)(i)
Cp(b)(i)
(2.4)
Determine that no cell should be
removed from RA i
(2.5) (2.6)
Let cell j be the cell in SI,B(i)-Sk(i) that has the highest
paging load
Compute the paging cost Cp(b)(i)
of RA i before cell j is removed
Ip(i) > Δp and Cu
(a)(i) < Θu?no
Determine that cell j should be removed
from RA i
yes
(2.1)
(2.2)
Predict the location update cost Cu
(a)(i) and paging cost Cp(a)(i)
of RA i after cell j is removed
(2.3)
Compute Ip(i) = Cp
(b)(i)-Cp(a)(i)
Cp(b)(i)
(2.4)
Determine that no cell should be
removed from RA i
(2.5) (2.6)
Let cell j be the cell in SI,B(i)-Sk(i) that has the highest
paging load
Compute the paging cost Cp(b)(i)
of RA i before cell j is removed
Ip(i) > Δp and Cu
(a)(i) < Θu?no
Determine that cell j should be removed
from RA i
yes
(2.1)
(2.2)
Predict the location update cost Cu
(a)(i) and paging cost Cp(a)(i)
of RA i after cell j is removed
(2.3)
Compute Ip(i) = Cp
(b)(i)-Cp(a)(i)
Cp(b)(i)
(2.4)
Determine that no cell should be
removed from RA i
(2.5) (2.6)
Let cell j be the cell in SI,B(i)-Sk(i) that has the highest
paging load
Compute the paging cost Cp(b)(i)
of RA i before cell j is removed
Ip(i) > Δp and Cu
(a)(i) < Θu?no
Determine that cell j should be removed
from RA i
yes
(2.1)
(2.2)
Predict the location update cost Cu
(a)(i) and paging cost Cp(a)(i)
of RA i after cell j is removed
(2.3)
Compute Ip(i) = Cp
(b)(i)-Cp(a)(i)
Cp(b)(i)
(2.4)
Determine that no cell should be
removed from RA i
(2.5) (2.6)
Paging improvement
Let cell j be the cell in SI,B(i)-Sk(i) that has the highest
paging load
Compute the paging cost Cp(b)(i)
of RA i before cell j is removed
Ip(i) > Δp and Cu
(a)(i) < Θu?no
Determine that cell j should be removed
from RA i
yes
(2.1)
(2.2)
Predict the location update cost Cu
(a)(i) and paging cost Cp(a)(i)
of RA i after cell j is removed
(2.3)
Compute Ip(i) = Cp
(b)(i)-Cp(a)(i)
Cp(b)(i)
(2.4)
Determine that no cell should be
removed from RA i
(2.5) (2.6)
7
0,0 0,1 0,2
1,0 1,1 1,2
2,0 2,1 2,2
0,3 0,4 0,5
1,3 1,4 1,5
2,3 2,4 2,5
0,6 0,7 0,8
1,6 1,7 1,8
2,6 2,7 2,8
3,0 3,1 3,2
4,0 4,1 4,2
5,0 5,1 5,2
3,3 3,4 3,5
4,3 4,4 4,5
5,3 5,4 5,5
3,6 3,7 3,8
4,6 4,7 4,8
5,6 5,7 5,8
6,0 6,1 6,2
7,0 7,1 7,2
8,0 8,1 8,2
6,3 6,4 6,5
7,3 7,4 7,5
8,3 8,4 8,5
6,6 6,7 6,8
7,6 7,7 7,8
8,6 8,7 8,8
RA1 RA4
0,0 0,1 0,2
1,0 1,1 1,2
2,0 2,1 2,2
0,3 0,4 0,5
1,3 1,4 1,5
2,3 2,4 2,5
0,6 0,7 0,8
1,6 1,7 1,8
2,6 2,7 2,8
3,0 3,1 3,2
4,0 4,1 4,2
5,0 5,1 5,2
3,3 3,4 3,5
4,3 4,4 4,5
5,3 5,4 5,5
3,6 3,7 3,8
4,6 4,7 4,8
5,6 5,7 5,8
6,0 6,1 6,2
7,0 7,1 7,2
8,0 8,1 8,2
6,3 6,4 6,5
7,3 7,4 7,5
8,3 8,4 8,5
6,6 6,7 6,8
7,6 7,7 7,8
8,6 8,7 8,8
RA1 RA4
Cell Inclusion
Add a cell into RA i Selects the cell that
has the highest RAU load to RA i
Let cell k be the cell in SE,B(i) that has the highest
location update load into RA i
Compute the location update cost Cu
(b)(i) of RA i before cell k is added
Iu(i) > Δu and Cp
(a)(i) < Θp?no
Determine that cell k should be added
into RA i
yes
(7.1)
(7.2)
Predict the location update cost Cu
(a)(i) and paging cost Cp(a)(i)
of RA i after cell k is added
(7.3)
Compute Iu(i) = Cu
(b)(i)-Cu(a)(i)
Cu(b)(i)
(7.4)
Determine that no cell should be added
into RA i
(7.5) (7.6)
Does such a cell k exist?
Add RAC(i) into the RAC list of
cell k
yes
Set ADD_cell to 1Set ADD_cell to 0
no
Determine if any cell k in SE,B(i) should be
added into RA i
Checks if the state is stable?
Modify SI,B(i) and SE,B(i) accordingly
(7)
(8)(9)
(10)
(11)
0,0 0,1 0,2
1,0 1,1 1,2
2,0 2,1 2,2
0,3 0,4 0,5
1,3 1,4 1,5
2,3 2,4 2,5
0,6 0,7 0,8
1,6 1,7 1,8
2,6 2,7 2,8
3,0 3,1 3,2
4,0 4,1 4,2
5,0 5,1 5,2
3,3 3,4 3,5
4,3 4,4 4,5
5,3 5,4 5,5
3,6 3,7 3,8
4,6 4,7 4,8
5,6 5,7 5,8
6,0 6,1 6,2
7,0 7,1 7,2
8,0 8,1 8,2
6,3 6,4 6,5
7,3 7,4 7,5
8,3 8,4 8,5
6,6 6,7 6,8
7,6 7,7 7,8
8,6 8,7 8,8
RA1 RA4
Does such a cell k exist?
Add RAC(i) into the RAC list of
cell k
yes
Set ADD_cell to 1Set ADD_cell to 0
no
Determine if any cell k in SE,B(i) should be
added into RA i
Checks if the state is stable?
Modify SI,B(i) and SE,B(i) accordingly
(7)
(8)(9)
(10)
(11)
Does such a cell k exist?
Add RAC(i) into the RAC list of
cell k
yes
Set ADD_cell to 1Set ADD_cell to 0
no
Determine if any cell k in SE,B(i) should be
added into RA i
Checks if the state is stable?
Modify SI,B(i) and SE,B(i) accordingly
(7)
(8)(9)
(10)
(11)
Let cell k be the cell in SE,B(i) that has the highest
location update load into RA i
Compute the location update cost Cu
(b)(i) of RA i before cell k is added
Iu(i) > Δu and Cp
(a)(i) < Θp?no
Determine that cell k should be added
into RA i
yes
(7.1)
(7.2)
Predict the location update cost Cu
(a)(i) and paging cost Cp(a)(i)
of RA i after cell k is added
(7.3)
Compute Iu(i) = Cu
(b)(i)-Cu(a)(i)
Cu(b)(i)
(7.4)
Determine that no cell should be added
into RA i
(7.5) (7.6)
RAU improvemen
t
Does such a cell k exist?
Add RAC(i) into the RAC list of
cell k
yes
Set ADD_cell to 1Set ADD_cell to 0
no
Determine if any cell k in SE,B(i) should be
added into RA i
Checks if the state is stable?
Modify SI,B(i) and SE,B(i) accordingly
(7)
(8)(9)
(10)
(11)
8
Stable State
Return to step 2 until the adjustment is a stable stable No cells can be added or removed
Check (RM_cell=0 and ADD_cell=0 ? )
Stable RM_cell=0 and ADD_cell=0
Select next RA to adjust
Non-stable RM_cell≠0 or ADD_cell ≠ 0 Continue the next run of cell exclusion and i
nclusion
Select the next RA i to adjust
Determine if any cell j in SI,B(i)-Sk(i) should
be removed from RA i
Determine if any cell k in SE,B(i) should be
added into RA i
Checks if the state is stable?
no yes
9
Prediction of the RAC Distribution
1. Determines respective RAC distributions of cells2. Predicts respective RAC distributions of cells according to the nu
mber of MSs and respective RAC distributions of neighboring cells
3. Repeats step1 to step 2 until becoming stable
0,0 0,1 0,2
1,0 1,1 1,2
2,0 2,1 2,2
0,3 0,4 0,5
1,3 1,4 1,5
2,3 2,4 2,5
RA 1 RA 4
RAC distribution = {RAC(4)/1.0}
0,0 0,1 0,2
1,0 1,1 1,2
2,0 2,1 2,2
0,3 0,4 0,5
1,3 1,4 1,5
2,3 2,4 2,5
RA 1 RA 4
RAC distribution = {RAC(4)/x,RAC(1)/y}
RAC list = {RAC(4),RAC(1)} DRAC = RAC(4)ORAC = {RAC(1)}
10
Example
Compute the number of neighboring MSs moving to cell (1,3) and registering to RA 1 and RA 4 in cell (1,3)
Then,
0.1*3,1,2,1)1( NS
1.0*3,1,4,11.0*3,1,3,21.0*3,1,3,0)4( NNNS
)4()1(
)1( and
)4()1(
)4(
SS
Sy
SS
Sx
1,2
0,3
1,3 1,4
2,3
RAC distribution = {RAC(4)/1.0}
RAC distribution = {RAC(4)/1.0}
RAC distribution = {RAC(4)/1.0}
RAC distribution = {RAC(1)/1.0}RAC distribution = {RAC(4)/x,RAC(1)/y}
11
Effects of ∆u (Θp=10000,Θu =500 and ∆p=0.2)
Effects of ∆p (Θp=10000,Θu =500 and ∆u=0.02)