• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.1 s.343
• /
• pp.103-110
• /
• 2006

Internet engineering task force (IETF) has proposed hierarchical mobile IPv6 (HMIPv6) in order to reduce a frequent location registration of a mobile node in mobile IPv6 (MIPv6). All traffics toward a mobile node must be transmitted through a MAP in HMIPv6. This brings unnecessary packet latency because of the increased processing cost of packet at the MAP. At this point the processing cost of packet at the MAP is influenced by the packet arrival rate for a mobile node and the number of mobile nodes in MAP domain. In this paper, we propose that MIPv6 and HMIPv6 are adaptively selected to minimize signaling coast of network as complementing weak point of MIPv6 and HMIPv6. After suppose that the packet arrival rate for a mobile node is fixed ,with this in mind, we find the optimal number of mobile nodes compared the total cost of HMIPv6 with the total cost of MIPv6. And if Mobile Nodes that the MAP is able to manage is full in MAP domain, a mobile node entering MAP domain is provided connection by MIPv6 instead of HMIPv6. In the conclusion, the proposed method of this paper shows that the weak points of MIPv6 and HMIPv6 are removed by adaptive selecting each other.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.625-632
• /
• 2005

Recently, real time services have been demanding a lot and the number of mobile devices is increasing extremely. Many researchers are focusing on decreasing handoff or signaling cost, produced when mobile devices are moving around. With these efforts, HMIPv6(Hierarchical Mobile Internet Protocol Version 6) was proposed. Mobile nodes do not need to register their locations to Home Agents whenever crossing over subnets within a MAP domain. In HMIPv6, mobile nodes choose the farthest MAP without considering node mobility pattern. However, a large MAP domain is not always efficient for a slow moving node and required additional work to choose a MAP in HMIPv6. Hence, this paper proposes 'Performance Analysis of HMIPv6 applying adaptive MAP Domain Site'.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2001.11b
• /
• pp.46-51
• /
• 2001

For Fast Real-time Recognition of Nonlinear Error Data, a new Neural Network algorithm which recognized the map in real time is proposed. The proposed neural network technique is the real time computation method through the inter-node diffusion, In the network, a node corresponds to a state in the quantized input space. Each node is composed of a processing unit and fixed weights from its neighbor nodes as well as its input terminal. The most reliable algorithm derived for real time recognition of map, is a dynamic programming based algorithm based on sequence matching techniques that would process the data as it arrives and could therefore provide continuously updated neighbor information estimates. Through several simulation experiments, real time reconstruction of the nonlinear map information is processed,

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2001.11a
• /
• pp.46-51
• /
• 2001

For Fast Real-time Recognition of Nonlinear Error Data, a new Neural Network algorithm which recognized the map in real time is proposed. The proposed neural network technique is the real time computation method through the inter-node diffusion. In the network, a node corresponds to a state in the quantized input space. Each node is composed of a processing unit and fixed weights from its neighbor nodes as well as its input terminal. The most reliable algorithm derived for real time recognition of map, is a dynamic programming based algorithm based on sequence matching techniques that would process the data as it arrives and could therefore provide continuously updated neighbor information estimates. Through several simulation experiments, real time reconstruction of the nonlinear map information is processed.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.351-356
• /
• 2004

The binding update of the Mobile IPv6 which does a route optimization in basic by the node which moves frequently brings about the signaling traffic increase of binding update. It supplements this the MAP(Mobile Anchor Point) for to let, and Hierarchical Mobile IPv6 which considers a macro mobility and a micro rambling regional mobility was proposed. But Mobile IPv6 when transmitting the packet, always does to pass by the mP, the packet intensive actual condition of the MAP to occur it does not guarantee a route optimization. In this study, It accomplishes the course improvement which considers the mobility of mobile node and it interprets the relaxation quality of packet intensive actual condition with the MAP

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.340-342
• /
• 2004

정보통신 기술의 발달로 사용자는 이동간에도 지속적인 인터넷 서비스를 받길 원한다. 이에 이동성 지원을 위한 많은 연구들이 있었다. 이동성 지원을 위한 HMIPV6환경에서 이동노드(Mobile Node)가 새로운 MAP 도메인으로 이동하거나 처음으로 MAP 도메인에 진입할 때 이동 노드는 홈 에이전트(Home Agent)와 상대 노드(Correspondent Node)에게 자신의 바인딩 정보를 갱신 하여야만 한다. 이 때 이동노드는 MAP 도메인 내에서 LCoA와 RCoA를 MAP에게 바인딩을 하고 자신의 HoA(Home Address)를 이용하여 홈 에이전트와 상대노드에게 바인딩 갱신 메시지를 보내어 바인딩 정보를 갱신한다. 본 논문은 이동 노드가 지역 바인딩 갱신(LBU)메시지와 함께 보내는 바인딩 갱신 메시지를 이용하여 MAP가 이동노드 대신 바인딩 갱신 메시지를 보냄으로써 시그널링을 줄이는 방안을 제시하고자 한다.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.3
• /
• pp.171-175
• /
• 2004

This paper proposes a seamless handoff scheme that enables a mobile node to continue a session when moving to an overlapping area. During handoff due to the weakness of signaling, mobile node makes new Care-of Addresses using signals received from access router when MN reaches the edge of its area in addition to its current CoA, and it sends temporary binding update messages to Mobility Anchor Point which manage the area covering MN. MAP receives that binding update messages from MN, and temporarily stores new binding informations from them to its binding cache besides existing binding information for MN. This scheme ensures a seamlessly handoff using multicasting until MN enter a new access router area and sends a confirmed binding update message to MAP.

• The KIPS Transactions:PartD
• /
• v.19D no.3
• /
• pp.229-236
• /
• 2012

The demand for map applications in both Web and mobile environments has been rapidly increased with the population of Web and smart phone usage. Web-based map applications are mostly developed on such environments as ArcGIS and MapServer and mobile map applications are developed on such API levels as Google Maps and Yahoo Maps. But many parts of map applications are still constructed by coding because these environments don't support high level of automation. Our MapAppGen that we have designed and implemented enhances the Web-based map application productivity by generating the map related modules that can be applied to the Drupal that is one of popular content management systems(CMS's). Comparing the applications that are constructed by the Drupal-supported GMap or NodeMap, the applications that are constructed by MapAppGen provide information on not only the interested geographical feature but also its related geographical features. MapAppGen uses Google Maps API and Drupal is a module-based system that supports the creation, composition and management of contents. We are now working on automatic generation of mobile map applications with MapAppGen.

• Tuberculosis and Respiratory Diseases
• /
• v.78 no.3
• /
• pp.180-189
• /
• 2015

Accurate lymph node staging of lung cancer is crucial in determining optimal treatment plans and predicting patient outcome. Currently used lymph node maps have been reconciled to the internationally accepted International Association for the Study of Lung Cancer (IASLC) map published in the seventh edition of TNM classification system of malignant tumours. This article provides computed tomographic illustrations of the IASLC nodal map, to facilitate its application in day-to-day clinical practice in order to increase the appropriate classification in lung cancer staging.

• The Journal of Korea Robotics Society
• /
• v.8 no.4
• /
• pp.256-265
• /
• 2013

A local map-based exploration algorithm for mobile robots is presented. Segmented frontiers and their relative transformations constitute a tree structure. By the proposed efficient frontier segmentation and a local map management method, a robot can reduce the unknown area and update the local grid map which is assigned to each frontier node. Although this local map-based exploration method uses only local maps and their adjacent node information, mapping completion and efficiency can be greatly improved by merging and updating the frontier nodes. Also, we suggest appropriate graph search exploration methods for corridor and hall environments. The simulation demonstrates that the entire environment can be represented by well-distributed frontier nodes.