• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.639-639
• /
• 2001

In this paper we describe a distributed location management scheme to reduce the bottleneck problem of HLR in Large Personal Communication Networks (LPCNs). Using analytical modeling and numerical simulation, we show that replicating location information is both appropriate and efficient for small Personal Communication Network (PCN). Then, we extend the scheme in a hierarchical environment to reduce overhead traffic and scale to LPCNs. Through extensive numerical results, we show the superiority of our scheme compared to the current IS-41 standard scheme.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.839-846
• /
• 2001

In this paper we describe a distributed location management scheme to reduce the bottleneck problem of HLR in Large Personal Communication Networks (LPCNs). Using analytical modeling and numerical simulation, we show that replicating location information is both appropriate and efficient for small Personal Communication Network (PCN). Then, we extend the scheme in a hierarchical environment to reduce overhead traffic and scale to LPCNs. Through extensive numerical results, we show the superiority of our scheme compared to the current IS-41 standard scheme.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.370-381
• /
• 2005

Mobile IP provides an efficient and scalable mechanism for host mobility within the Internet. Using Mobile If, mobile nodes may change their point of attachment to the Internet without changing their If address. However, it would result in a high signaling cost. To reduce the signaling cost, we factor in the fact that mobile users will not be actively communicating much of the time. In fact, there Is no necessity to send a binding update message to the home agent when an mobile node does not communicates with others while moving. From this point of view, we propose a lazy update strategy for minimizing signaling cost using the forwarding pointer in hierarchical Mobile IPv6. In our proposal, binding updates are sent only when a mobile node is in a busy mode. If an mobile node is in a dormant mode, binding update messages are delayed until busy mode using the forwarding pointer. As a result, our proposal can reduce the total signaling cost by eliminating unnecessary binding update messages when a mobile node Is in a dormant mode. In addition to, our proposal reduces unnecessary location update cost resulting from ping-pong effect under mobile node's dormant mode. Analysis results using the discrete analytic model presented in this paper shows that our proposal can has superior performance than hierarchical Mobile nv6 when the call-to-mobility ratio is low and the length of the forwarding pointer chain K is low.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7B
• /
• pp.668-676
• /
• 2009

Hierarchical Mobile 1Pv6(HM1Pv6) have been proposed by IETF(Internet Engineering Task Force) beginning from Mobile 1Pv6 for mobility support in IP networks, however these researches relying on client based mobility support have not been drawn attention due to excessive consumption of wireless resources and long handover delay. In this paper, we propose the Router-based Binding Update(RBU) scheme to solve problems in existing client-based mobility support schemes. The router registers location information of mobile nodes through Neighbor Discovery protocol without additional codes for the RBU scheme to a terminal operated by existing HMlPv6. By using this the RBU scheme is designed so that it can support partial nupport based mobility and reduce handover latency rather than using HMIPv6. It is analysed and compared with existing HMIPv6 to verify efficiency of the RBU scheme. As a result, the RBU scheme has outperformed existing HMIPv6 by 15% in terms of macro handover delay especially when long delay on wireless links exists.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.7
• /
• pp.1344-1356
• /
• 2009

The DDS (Data Distribution Service) is a data-centric communication technology that provides an efficient communication service that supports a dynamic plug & play through an automatic setting of participants' location information for each data (Topic) by using DDS discovery technique. This paper proposes the hierarchical-structured DDS discovery technique (SPDP-TBF) suitable for the large-scale distributed systems by comparing and analyzing the existing DDS discovery techniques in terms of performance and problem areas. The proposed SPDP-TBF performs the periodic discovery of the involved participants only by having separate hierarchical managers which take charge of the registration and search (of participants) so that a participant sends its information to the related participants only, and it enhances the effectiveness of the message transfer. Moreover, the proposed SPDP-TBF provides the improved scalability by performing the hierarchical discovery through hierarchical manager nodes so that it can be applied to the large-scale distributed system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.5A
• /
• pp.863-872
• /
• 2001

본 논문에서는 PNNI(Private Network to Network Interface) 기반의 무선 ATM 망에서 이웃(neighborhood)과 이동 단말기의 위치 관계를 고려하여 계층화된 위치 등록기에 의한 적응적 위치 관리 기법을 제시한다. 제안된 위치 추적 과정에서는 단말기의 위치 영역을 홈(home) 이웃과 외부(foreign) 이웃으로 구분하고, 홈 이웃에서는 최하위 레벨의 위치 등록기와 홈 위치 등록기에 단말기의 위치를 등록하고 외부 이웃에서는 각 계층의 위치 등록기에 위치를 등록한다. 착신 단말기, 발신 단말기와 착신측 홈 이웃의 위치 관계를 고려하여 최소한의 비용으로 위치 파악 및 호 설정 과정을 수행한다. 그리고, PNNI 기반의 무선 ATM 망에서 제안된 적응적 위치 관리 기법을 기존 LR(Location Registers) 기법과 위치 관리비용 측면에서 성능을 비교하여 우수한 성능을 가지는 것을 알 수 있다.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.171-179
• /
• 1995

In many continuous speech recognition systems, phoneme is used as a basic recognition unit However, the coarticulation generated among neighboring phonemes makes difficult to recognize phonemes consistently. This paper proposes allophone as an alternative recognition unit. We have classified each phoneme into three different allophone groups by the location of phoneme within a syllable. For a recognition algorithm, time-delay neural network(TDNN) has been designed. To recognize all Korean allophones, TDNNs are constructed in modular fashion according to acoustic-phonetic features (e.g. voiced/unvoiced, the location of phoneme within a word). Each TDNN is trained independently, and then they are integrated hierarchically into a whole speech recognition system. In this study, we have experimented Korean plosives with phoneme-based recognition system and allophone-based recognition system. Experimental results show that allophone-based recognition is much less affected by the coarticulation.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.12
• /
• pp.3221-3229
• /
• 1998

본 논문은 광역 이동컴퓨팅 환경에서 계층적인 네트워크 확장에 적합한 새로운 계층적 위치수정(Location Update)과 경로설정(Routing) 방안을 제안한다. 제안된 방안은 통신을 가장 빈번하게 요구하는 고객영역(Patron Area)의 경계에 있는 일단의 방향선회(Redirection)에이전트들로 위치수정을 제한하기 때문에 위치수정의 수를 줄이게 된다. 계층적 방향선회 개념의 적용으로 고객영역 내에서 호스트 이동에 대한 위치수정 부담이 없어진다. 가벼워진 위치수정에도 불구하고 이동호스트의 홈(Home) 네트워크의 홈 에이전트를 거치지 않고 대부분의 통신이 이루어지기 때문에 최적에 가까운 경로설정을 제공한다. 제안된 방안은 위치수정 및 경로설정의 효율성 관점에서 기존의 계층 및 비 계층 위치수정 방안과 비교 분석하였다.

• Proceedings of the KIEE Conference
• /
• 2003.07a
• /
• pp.366-368
• /
• 2003

In this paper, a parametric evaluation method of protection ability is proposed. The adequacy of every parameter is evaluated for the setting rules. Then the results are combined to give protection level of a whole protective system. The setting rules are categorized into three groups for hierarchical calculation. The proposed scheme is applied to a location problem of a new protective device to show its effectiveness.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.610-615
• /
• 2005

Visual servoing is the fusion of results from many elemental areas including high-speed image processing, kinematics, dynamics, control theory, and real-time computing. It has much in common with research into active vision and structure from motion, but is quite different from the often described use of vision in hierarchical task-level robot control systems. We present a new approach to visual feedback control using image-based visual servoing with the stereo vision in this paper. In order to control the position and orientation of a robot with respect to an object, a new technique is proposed using a binocular stereo vision. The stereo vision enables us to calculate an exact image Jacobian not only at around a desired location but also at the other locations. The suggested technique can guide a robot manipulator to the desired location without giving such priori knowledge as the relative distance to the desired location or the model of an object even if the initial positioning error is large. This paper describes a model of stereo vision and how to generate feedback commands. The performance of the proposed visual servoing system is illustrated by the simulation and experimental results and compared with the case of conventional method for dual-arm robot made in Samsung Electronics Co., Ltd.