• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.659-668
• /
• 2006

Various schemes for mobility support are currently proposed in NGN. However the performance comparison of all existing schemes is not relatively examined as yet. Therefore, in this paper, we investigate the location registration and handover procedure of MIPv6, IP2, Q.MMF, IMS, compare and analyze the location registration time and cost and handover latency time using various performance parameters and simulation for the performance analysis. As a result of analysis, when Location Manager locates in the center of core network, IP2 showed better performance than other schemes.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.16 no.1
• /
• pp.9-15
• /
• 1998

Numerical cadastral surveying method has advantages of higher accuracy and less individual error than planetable surveying method if we consider the result of surveying at the same area. Now in the areas where they use numerical cadastral records, coordinate is the basis when the boundary location is registered in numerical cadastral re-cords or is reconstructed on land surface, and this coordinate represents simply the absolute locational relationship with respect to origin point. But when we register the cadastral boundary location in cadastral or reconstruct it on land, relative relationship with respect to traverse point is more advisable basis than absolute relationship with respect to orgin point. This study contributes to the numerical cadastral surveying by discussing the problems to be improved that the principle of coordinate based boundary location registration and reconstruction has.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.789-798
• /
• 2002

Even when users are moving, a major problem in such a mobile networks is how to locate mobile clients. Two major operations are involved in managing a mobile client's location : the location registration operation and the call tracking operation. The past methods can only minimize the cost of one of these two operations, but not both. The contribution of this paper is to propose strategy that minimize the costs of both operations simultaneously. Our performance analysis proves that the proposed strategies are superior to the past methods.

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

• Korean Management Science Review
• /
• v.25 no.2
• /
• pp.73-80
• /
• 2008

The location area planning is to assign cells to the location areas of a wireless communication network in an optimum manner. The two important cost components are cost of location update and cost of paging that are of conflicting in nature; i.e., minimizing the registration cost might increase the search cost. Hence, it is important to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking cost is a minimum. The complete mobile network is divided into location areas. Each location area consists of a group of cells. In fact this is shown to be an NP-complete problem in an earlier study. In this paper, we use an ant colony optimization method to obtain the best/optimal group of cells for a given a network.

• Journal of Computing Science and Engineering
• /
• v.4 no.4
• /
• pp.368-387
• /
• 2010

We propose a novel method for the registration of 3D CT scans to 2D endoscopic images during the image-guided medialization laryngoplasty. This study aims to allow the surgeon to find the precise configuration of the implant and place it into the desired location by employing accurate registration methods of the 3D CT data to intra-operative patient and interactive visualization tools for the registered images. In this study, the proposed registration methods enable the surgeon to compare the outcome of the procedure to the pre-planned shape by matching the vocal folds in the CT rendered images to the endoscopic images. The 3D image fusion provides an interactive and intuitive guidance for surgeon by visualizing a combined and correlated relationship of the multiple imaging modalities. The 3D Magic Lens helps to effectively visualize laryngeal anatomical structures by applying different transparencies and transfer functions to the region of interest. The preliminary results of the study demonstrated that the proposed method can be readily extended for image-guided surgery of real patients.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.6
• /
• pp.1155-1169
• /
• 2010

This study considers movement-based registration (MBR). In MBR, a mobile station (MS) performs location registration whenever the number of entering cells reaches the specified movement threshold M. MBR is simple and its implementation is quite straightforward. However, it may result in more registrations than other similar schemes. An improved MBR scheme called MBIR (MBR with implicit registration) was proposed to reduce registration cost of MBR and its approximated performance was analyzed. In this study, we point out some problems of the previous analysis method and propose an exact analysis method of MBIR. Using the exact analysis method, we show that the previous analysis includes considerable errors and improvement of MBIR in our study seems to be larger than in the previous study.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.469-469
• /
• 1995

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.213-218
• /
• 2004

Recently MIP becomes more important for the macro mobility support in the emergence of the global system such as IMT-2000. However this Protocol suffers from many weaknesses on the location management. MIPv4 regional registration is presented for the local registration of MNs. MIPv6 can benefit from the reduced mobility signaling with external networks by employing a local MAP, that is called HMIPv6. The total signaling cost of HMIPv6 is rapidly increased by the number of CNs of an MN when the MN moves around between MAPs. In this paper, we propose a new location management scheme in MIPv6 that reduces the total signaling cost in the location update based on HMIPv6 Here the MN does not send the BU to CNs and HA when it moves around between MAPs. Instead it informs the current location by transferring the modified BU to the previous MAP. According to the results of the performance analysis, we determine the upper bound for the number of forwarding links allowed among adjacent MAPs without the BU information.

• Journal of KIISE:Software and Applications
• /
• v.32 no.7
• /
• pp.612-624
• /
• 2005

In this paper, we propose a surface-based registration using a gaussian weighted distance map for PET-CT brain image fusion. Our method is composed of three main steps: the extraction of feature points, the generation of gaussian weighted distance map, and the measure of similarities based on weight. First, we segment head using the inverse region growing and remove noise segmented with head using region growing-based labeling in PET and CT images, respectively. And then, we extract the feature points of the head using sharpening filter. Second, a gaussian weighted distance map is generated from the feature points in CT images. Thus it leads feature points to robustly converge on the optimal location in a large geometrical displacement. Third, weight-based cross-correlation searches for the optimal location using a gaussian weighted distance map of CT images corresponding to the feature points extracted from PET images. In our experiment, we generate software phantom dataset for evaluating accuracy and robustness of our method, and use clinical dataset for computation time and visual inspection. The accuracy test is performed by evaluating root-mean-square-error using arbitrary transformed software phantom dataset. The robustness test is evaluated whether weight-based cross-correlation achieves maximum at optimal location in software phantom dataset with a large geometrical displacement and noise. Experimental results showed that our method gives more accuracy and robust convergence than the conventional surface-based registration.