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

• Journal of the Korea Society for Simulation
• /
• v.19 no.4
• /
• pp.89-98
• /
• 2010

In the heterogeneous system of various wired or wireless network with IP-based backbone, the continuities of agreedon QoS for multimedia services should be guaranteed regardless of network types and terminal mobility through seamless vertical handover. This paper proposes a QoS provisioning mechanism called D-ISHO which guarantees the continuities of agreed-on QoS and seamless for multimedia services by considering both such characteristics as delay, loss rate and jitter per each service and such status as available band-width, call arrival rate and data transmission rate during the vertical handover. Simulation is done for performance analysis with the measure of handover failure rate and packet loss rate.

• Journal of Korea Multimedia Society
• /
• v.16 no.12
• /
• pp.1454-1464
• /
• 2013

In this paper, we propose a rapid rigid registration method for the fusion visualization of intra-operative 2D XA and pre-operative 3D CTA images. In this paper, we propose a global movement estimation based on a trilateration for the fast and robust initial registration. In addition, the principal axis of each image is generated and aligned, and the bounding box of the vascular shape is compared for more accurate initial registration. For the fine registration, two images are registered where the distance between two vascular structures is minimized by selective distance measure. In the experiment, we evaluate a speed, accuracy and robustness using five patients' data by comparing the previous registration method. Our proposed method shows that two volumes can be registered at optimal location rapidly, and robustly comparing with the previous method.