後卓越計畫進度報告

1. 後卓越計畫進度報告 楊舜仁老師實驗室 2007.08.13

2. Overlapping RA Scheme RA2 RA1 RA2 RA1 • Reduce the RAU cost caused by the ping-pong effect • In overlapping RA scheme, one cell may belong to two or more RAs Non-overlapping Overlapping # of RAU = 1 # of RAU = 2 • Each cell has a corresponding RAC list • The first one in the RAC list is called the default RAC (DRAC) • The others are called the overlapping RACs (ORACs) • RAC distribution: Every RAC list consists of an RAC distribution for MSs • Express the proportion for MSs registering to RA i distributed value

3. 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, Internalboundary, Propose Scheme External boundary Core cells Internal boundary

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 the number of incoming call arrivals the number of incoming call arrivals

5. Adjustment Algorithm

6. Remove a cell from RA i Selects the cell that has the highest paging load to RA i Cell Exclusion Paging improvement

7. Add a cell into RA i Selects the cell that has the highest RAU load to RA i RA4 RA4 RA4 RA1 RA1 RA1 Cell Inclusion RAU improvement

8. 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 inclusion Stable State

9. Determines respective RAC distributions of cells Predicts respective RAC distributions of cells according to the number of MSs and respective RAC distributions of neighboring cells Repeats step1 to step 2 until becoming stable Prediction of the RAC Distribution

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,

11. Effects of ∆u (Θp=10000,Θu =500 and ∆p=0.2) • Effects of ∆p (Θp=10000,Θu =500 and ∆u=0.02)