A New Registration Signal Traffic Distribution Method For Micro Cell Environment JK. Kim Mobile Comms. Div., ETRI, 161 Kajong-dong, Yusong-gu, TAEJON 305-350, Korea E-mail : jkkim@mail.ewi.re.kr ABSTACT In this paper a new registration method, the Group List, registration method (GL registration method), is proposed. This Daper presents a simulation analysis of the effect of the GL registration method on micro cll envionment as compared with classical registration methods that are used in GSM and IS-95A. ‘As aresult, using the GL rogistration method, al cells are able to hhande the registration signal traffic. The number of registration tempt is also decreased as compared with ouber registration methods on aspect of paging area. Moreover, the short term ‘witching instability canbe avoided, INTRODUCTION In the general registration methods, the service area is Livided by unit of the registration zone as Figure 12). Each registration zone has & number of cells and @ unique registration ‘one identifier. Whenever a Personal Staton (PS) eniets a new registration zone, the PS performs the registration proceduress With cell site(S), The PS receives and saves a new regisuation| one. idemiier trom the cell site, Because the registration autempts are happened on the border cells the reistration signal taalfic is concentrated on the border CSs{1). Io. macto cell environment, this concentration problem of the registration signal vaffics isnot serious because the numberof inner cell is 8 Tew as compared with the nurber of border cell as Figure 1(b). ‘When this registration meshod is applied to the micro cell eavirunment, the concentration problem of registration signal tralfies is serious because of lots oF inner cells inthe registration zone as Figure 1(c), Because the registration proceduress use a control channel that is also used by the call setup proceduress, the possibilty ofthe eal stup suceessom the inner cells is ower ‘than the that of the border celis. Also, PS moving along the boner of two registration zones may cause increased episttation tastfic by short term switching: ie. they always move back and forth from one registration zone 10 anotherl2. (2) Division of the service area 479 (@) fn macro cell environmentthe numberof inner eetlsthe ‘number of border cells = 1/8), (©) In miro cetl environment (the number of inner celisthe ‘nurnbor of borer cells = 16/20). Figure 1. Example ofthe ell compesition in registration zones on the variable cell environment. In order to cope with this problem, the multi-layer ‘method and the hybrid dynamic method has been proposed bbut each method has some problems as next. The multi- layer method should maintain consistency of the registration data between each PSs and networks because each PSs has a different group number and registration layers. When the size of cell is reduced, the broadcasting information waffic related 10 registration is. increased because the number of registration layers and group ‘number are also increased. The furetion that translates the combination of registration layer and group aumber to conventional registration zone should be performed in the network sides whenever the paging is happened. In the hybrid dynamic method, cach PSs should continuously ‘measure the mobility snd the call arrival rate at each registration zone, and calculate the probability of PS to be exist on cach registration zone by counting the visitedregistration zones. As a result, cach PS has a large number of data that should be measured. Especially, when the PS ‘moves on registration zones, the volume of the data is ‘more increased. Also the consistency of registration data between cach PS and network should be maintained. ‘We have to get a simple and easy registration method for solving above described problem. In this paper, anew registration method that uses 2 Group List is proposed, In this method, each cell has the Group List that is composed of ise and a number of neighbor cells. Whenever the PS enters a new cell that isnot ineluded in the stored Group List, the PS performs ‘he registration procedures and receives a new Group List at is| related the entered cell. Tae PS updates the previous stored up List by the new received Group List, Using this method, the registration attempts are happened overall cells. As areal the registration signal tralfcs are easily distributed aver al cells. ‘This method can also avoid shot term switching instability because the new Group List includes cells that were in the previous Group List. “The remainder ofthis paper is organized as follows. Section 2 presents the Grovp List registration method. Section 3 ‘deseribes the simulation model. Section 4 discusses the effect of Group List registration method as compared with classical registration methods, which are used in GSM and IS-95A, by simulation, Finally, Section 5 gives concluding remarks and some future research directions IL. THE GROUP LIST REGISTRATION METHOD. 1n the GL. registration method, the service area is simply divided into cell that is radio coverage by a CS as Figure 2 Each cell has a unique cell identifier that is brosdcast by the CS ‘over its radio coverage, and 2 Group List that is composed of itself and a number of neighbor cells. The number of cells Group List isnot limited, and the Group List is able to compose variously, This Group List s delivered ro PS that have attempted the registration procedures in new cell and successfully Finished it Figure 3 and Table | show the examples of Group List that Is assigned to a cell. In these examples of Group Lis, the number (of cells i$ Fixed t0 9 for convenience of explanation. The istration procedures, based on the GL. registration method, ae a8 follows mpl of the division of service area in GL registration method, When the PS. moves on the service area, the PS receives the broadcasted cell identifier by CS. If the received cell identifier is aot included the stored Group List, the PS attempts the registration procedures. The PS sends a “Registration Request * message to the CS which covers the PS. When the CS receives the “Registration Request” message, sends a “Registration Success” message to PS. This “Registration Success” message includes the new Group List. When the PS receives the “Registration Success” message, the PS updates the previous stored Group List by the hew received Group List. Figure 3, Example of the Group Lists at each cell. Table 1, Example ofthe Group Lists by Figure. Inthe classical registration method, all PS pats into the ingle registration zone layer as shown in Figure (2) because the service area is mapped into a fixed registration zone group that ‘groups the registration zones i the service area. In this paper, ‘he classical registration method ie categorized into the single layered registration method. In the GL. registration method, however, each PS has a different single registration zone layer a6 shown in Figure 4(b) breause each cell has a different the Group List and all PS does not move along s sare path. That is in the Group List cegistration method, the service area is mapped inte lots of registration zone layers as the number of PSs. In this paper, the Group List registration method is categorized into the rmuli-layered registration method. In this ease, each cell is located on the nner of the registration zone at sorme registration ‘one layers and located on the boundary ofthe registration zone ‘atthe other registration zone layers, That is, wsing this method, the registration arempls are happened over sll cells and te registration signal taffies are easily distributed over all cel The PS moving along the border of two registration zones may cause increased registration (raffies by short term switching; ic., they always move back and forth from ‘one registration zone to another, In GL registration method, because the updated Group List includes cells that were in 480the previous Group List, the short term switching. instability could be avoided as Figure 5, From Figure 5, the number of registration attempts is only occurred two times in the GL registration method whereas the number of registration attempt has been occurred 7 times in the GSM’s registration method. | LegeBE LEBEL {b) Mapping of service area by the Group List registration method Figure 4, Mapping of service arca ‘Thus the GL registration method simply and easily solves the previously described problems. In this GL registration method, if PS terminated call happens, the notwork searches a cell, which the PS fas successfolly finished the registration procedures forthe las time, from Home Location Registe(HLR). Next, the rework searches the Group List elaed 10 the cell fom HILR and stats paging procedures on the whole cel's that belong 10 the Group List MI, SIMULATION MODEL ‘To carry out a detaited analysis of the performance of GL. registration method, a compute simulation model was developed. For simplicity of the computer simulation algorithm, the next Cconctions are assumed, ©The service area is composed of 48 48 cells ‘© Radio propagation environment is not considered, that is, the registration procedures. are always, ‘suceesefully finished, © Only one PS moves 1,000,000 times between cells inthe service aca © The PS moves one of eight directions between cells with uniform distribution funcien that is suppored bby C compiler. © To compare with the elasscal registration method, the GSMs and 1S-95A's registration method are also evaluated. © For convenient, the number of cell in Group 481 List is limited to 5, 9 or 25 cells. 1S sg Figure S. Example of avoiding the short term switching Inability with the Group List registration method Figure 6 sows an algorithm for the analysis ofthe eect of GL registration method, First step. the service area is inialized according to the registation method. Second wep, a direction, which 2 PS moves on a cell s selected with random function ‘hid step, whether the PS attemps the registration procedures for not is decided in that col according to the registration method. IF the registration procedures would be attempt, the registration attempt counter is increased in that cell. Second step ad third step are repeated 1,000,000 times. Figure 6. A computer simulation algorithm. TV. SIMULATION RESULTS ‘To verify the computer simulation algorithms ard identify the previously deseribed problems, 1Wo classical registration methods are evaluated. Firs, the GSM's registration method! 3] 4] is considered, The GSM’s registration method uses the single registration layer. The concentration problem of registration signal tratfic and short term switching instability are ‘expected. From Figure 7, we can see that the regiscation signal trafic is eonccntated on the border cells. Also, the shor erm switching instability could not be avoided because the registration zone is xed avid the registration zones are not