• 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.

• 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.

• 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 Korea Society of Industrial Information Systems
• /
• v.11 no.2
• /
• pp.1-8
• /
• 2006

In this paper, we propose a distance-based location registration scheme and evaluate it's performance in a mobility model. We compare performance of the distance-based registration scheme to that of zone-based registration scheme at the mobility model. Numerical results show that the registration load of the distance-based registration with call arrival is similar to that of the zone-based registration, and is equally distributed to all cells in a location area. So the proposed scheme can be effectively used in the limited radio resources.

• ETRI Journal
• /
• v.25 no.6
• /
• pp.527-530
• /
• 2003

In this study, we consider distance-based registration (DBR) and propose a DBR with implicit registration (DBIR) in order to improve the performance of the DBR. With analytical models based on a 2-dimensional random walk in a hexagonal cell configuration, we analyzed the performance of the DBR and DBIR. Our results showed that the DBIR always outperforms the DBR.

• 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 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.

• IE interfaces
• /
• v.15 no.4
• /
• pp.401-408
• /
• 2002

An efficient mobility management for mobile stations plays an important role in mobile communication network. In this study, we consider movement-based registration(MBR) and distance-based registration(DBR). Analytical models based on 2-dimensional random walk in hexagonal cell configuration are considered to analyze the performance of MBR and DBR. Especially, we focus on the derivation of the registration cost of DBR scheme by using two analytical methods and then show that DBR always outperforms MBR. Numerical results are provided to demonstrate optimal condition under various circumstances.

• IE interfaces
• /
• v.23 no.4
• /
• pp.357-364
• /
• 2010

In this study, we consider performance analysis of distance-based registration (DBR). DBR causes a mobile station (MS) to register its location when the distance between the current base station (BS) and the BS in which it last registered exceeds a distance threshold D. In general, DBR has some advantages over the other registration schemes but has a tendency to causes an MS to register more frequently than zone-based registration (ZBR) that is adopted in most of mobile communication systems. The DBR with implicit registration (DBIR) was proposed to improve the performance of DBR. In this study, we point out some problems of the previous analytical model based on continuous time Markov chain and analyze exact performance of the DBIR. We show that the DBIR always outperforms the DBR by using our exact analytical model.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2007.05a
• /
• pp.47-54
• /
• 2007

In this study, we consider the movement-based registration (MBR), location-based registration (LBR) and distance-based registration (DBR) schemes. Analytical models based on a 2-dimensional random walk in a hexagonal cell configuration are considered to analyze and compare the performances of these three schemes. We focus on the derivation of the registration costs of LBR and DBR using an analytical method and then show that DBR always outperforms both MBR and LBR. Numerical results are provided to demonstrate the validity of our models under various circumstances.