• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.35T no.2
• /
• pp.81-85
• /
• 1998

Location Registration and deregistration is necessary to mobility management in a Mobile Communication networks when a mobile phone moves between location registration areas. After considering several deregistration schemes, a sample scheme that eliminate network traffic is chosen. However, this scheme may delete valid registration record, so the size of location registration database must be sufficiently large to ensure low probability that a valid records are deleted. This paper describes an analytic model to determine the size of location registration database for a location registration area in this simple scheme. The simulation results of analytic model show that the size of database must 3-5 times than the expected number of mobile phones in a location registration area.(Mobile, Communications, Location, Deregistration, Database)

• IE interfaces
• /
• v.22 no.2
• /
• pp.185-191
• /
• 2009

In this study, we propose an improved group location tracking scheme (GLS) called integrated GLS (IGLS) which, in addition to the group location registration of the GLS, sends an integrated group registration message to a virtual visitor location register (VVLR) instead of sending an individual group registration message. This integrated procedure of proposed scheme leads registration cost of group registration and group location registration to be reduced significantly. Numerical results demonstrate that our proposed IGLS outperforms conventional GLS and delayed GLS (dGLS). The IGLS can be applied effectively on public transportation systems such as subway, train and bus.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.2
• /
• pp.151-159
• /
• 2008

An efficient location registration scheme is essential to accommodate continuously increasing mobile subscribers and to offer a variety of multimedia services with good quality. In this study, we consider a distance-based registration scheme where the number of location areas varies on the basis of cell-by-cell, not of ring-by-ring, to analyze the optimal size of the location area. Using our proposed cell-by-cell distance-based registration scheme with random walk mobility model, we analyze a variety of circumstances to obtain the optimal number of cells for location area that minimizes total signaling traffic on radio channels. From our analysis results, we show that the optimal number of cells for location area is between 4 and 6 in most cases, and our cell-by-cell distance-based location registration scheme has less signaling traffic than optimal ring-by-ring distance-based location registration scheme where optimal distance threshold is 2 (thus the optimal number of cells for location area is 7).

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.2
• /
• pp.385-401
• /
• 1997

In this paper, we evaluate the performance of zone-based registration and distance-based registration. First, we propose the mobility model which can be used to analyze the performance of both zone-based registration and distance-based registration. And using the proposed mobility model, we obtain several performance measures and perform numerical computation to compare the performance of two registration methods. Numerical results show that in general zone-based registration needs less number of registration than distance-based registration. On the other hand, if distance-based registration is used, registration load is equally distributed to all cells in a location area and ping-pong phenomenon is not occurred. And when a VLR area is composed of a few location areas, distance-based registration may need less registration load than zone-based registration. Therefore, a proper registration method should be selected considering system circumstances and implementation complexity, and the selected method should be implemented so as to change system parameters according to system circumstances.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.9
• /
• pp.2402-2414
• /
• 1996

Registration is the process by which a base station gets the information of location and status about mobile stations. Registration will become an increasingly important issue in mobile cellular communications, especially in microcellular system with the increase of location updating traffic. Four typesof registration schemes, which are specified in US standard IS-95 and Korean standard TTA-KO-0062, power up registration scheme, power down registration scheme, distance based registration scheme and zone based registration scheme, will be mainly used in the future. In this paper, we derive the combined cost of signaling traffic of paging and registration for various parameters of mobile stations behavior(unencumbered call duration, power up and down rate, velocity, etc.) then we present numerical results for the perfroamnce of four registration schemes. The size of location area is provided for optimal operation.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.449-453
• /
• 2003

In this paper, we evaluate the performance of zone-based registration, distance-based registration and distance-based registration considering call arrival. We propose the mobility model, which can be used to analyze the performance of three registration schemes. Numerical results show that zone-based registration needs less number of registration than distance-based registration. On the other hand, the registration load of the distance-based registration is equally distributed to all cells in a location area. However, the registration load of the distance-based registration considering call arrival is similar to that of zone-based registration and equally distributed to all cells in a location am Therefore, the proposed scheme can be effectively used restricted radio resources.

• ETRI Journal
• /
• v.37 no.6
• /
• pp.1087-1095
• /
• 2015

Mobility management is important in mobile cellular networks. In this study, we considered an enhanced location-based registration (ELR) method. In the ELR method, even when a mobile phone enters a cell to find that the cell is already on its list (of visited cells) and then updates its main counter, it does not remove any cells from the list (memory space permitting), which gives better performance than the location-based registration (LR) method. However, the location registration cost of the ELR method is still high, and there is a lot of room for improvement with regards to this matter. We now propose an improved version of the ELR method; namely, the improved ELR (iELR). In the iELR method, when a mobile phone enters a cell to find that the cell counter value is less than the main counter value, or when a mobile phone enters a cell to register its location, it updates the main counter and the cell counter values as much as possible to reduce the future need for registrations. We show that our proposed iELR method provides better performance than the ELR method.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.103-110
• /
• 2003

In this paper, we propose and evaluate the performance distance-based registration considering call arrival. We propose the mobility model, which can be used to analyze the performance of proposed registration schemes. Numerical results show that zone-based registration needs less number of registration than distance-based registration. On the other hand, the registration load of the distance-based registration is equally distributed to all cells in a location area. However, the registration load of the distance-based registration considering cail arrival is similar to that of zone-based registration and equally distributed to all cells in a location area. Therefore, the proposed scheme can be effectively used restricted radio resources.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.41-50
• /
• 2008

In this study, an improved scheme for distance-based registration (DBR) is proposed and its performance is analyzed. In the DBR, when a mobile station (MS) enters a new cell, it calculates the distance between last registered cell and current cell and registers its location if the distance reaches reference distance D. In this study, two-location DBR (TDBR) is proposed to improve the performance of the DBR. In the TDBR, an MS stores not only last registered location area (LA) but also previously registered LA, and then no registration is needed when the MS crosses two LAs stored already. However, since the TDBR may increase paging cost, trade-off is necessary between decreased registration cost and increased paging cost. In this study, the performances of two schemes are analyzed and compared using 2-dimensional random walk mobility model in hexagonal cell configuration. We show that our mathematical analysis is accurate by comparing with simulation. From the numerical results for various circumstances, it is shown that our proposed TDBR outperforms current DBR in most cases.

• Journal of Korean Institute of Industrial Engineers
• /
• v.38 no.2
• /
• pp.125-132
• /
• 2012

In this study, we consider zone-based registration (ZBR). In the ZBR, when a mobile station (MS) enters a new location area (LA), it registers its location. Among various types of ZBR, we focus on two zone-based registration with outgoing call (TZRC) that is an improved version of the two zone-based registration (TZR). In the TZR, an MS can store two LAs that it registers recently not to register when it crosses two LAs stored already. In general, TZR has better performance than single zone-based registration (SZR). However, since the TZR may increase paging cost, TZRC was proposed to decrease paging cost. Mathematical analysis is performed to obtain the exact performance of SZR, TZR, TZRC. From the numerical results for various circumstances, it is shown that TZRC outperforms TZR and SZR in most cases.