• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7A
• /
• pp.746-754
• /
• 2007

In this paper, we propose a fast handoff algorithm for micromobility management enhancement in HMIPv6 networks, which eliminates the DAD procedure involved in the regular HMIPv6 in order to o decrease handoff latency and increase the resource utilization efficiency. In the proposed scheme, the MAP is designed to guarantee the uniqueness of MN's interface identifier within a MAP domain as long as the MN moves in a MAP domain, so that the MN configures the new address without the DAD procedure resulting in the decreased handoff latency significantly When the MN resides in a subnet, MIPv6 is used adaptively as a mobility management protocol, which is to reduce bandwidth waste from the IP packet header overhead of IP-in-IP tunneling from the regular HMIPv6. We evaluate the performance of the proposed handoff micromobility algorithm in terms of handoff delay and packet loss thru computer simulation. Thru various computer simulation results, we verified the superior performance of the proposed scheme by comparing with the results of other schemes, MIPv6 and HMIPv6.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.4 no.3
• /
• pp.13-20
• /
• 2001

The purpose of this study is development of the management and guide system for convenient use of new address guide system for systematic management and use of spatial information gained by mapping of numerical map of building and road to large basic new address, survey and input of main gate, decision of the road session, naming and input of road name, grant of numbering of all houses and buildings, new address guide, real life geographical information and added information service on web site in Jecheon-si city area. In this study, the development and establishment of new address management and guide system in local cities are designed by making full use of GIS function of client server based system. A guide system is designed the same database as management system, and it is transformed into Web GIS environment and developed in order to add the various functions of life GIS as well as new address guide. In the result, the effectiveness of new address system and guide of Jecheon-si city could be highly increased owing to not only citizens' easy access but also easy availability of various informations necessary in life by developed its system.

• Journal of architectural history
• /
• v.20 no.1
• /
• pp.7-22
• /
• 2011

This paper deals with a fundamental study for '$Tonhobeondo$統戶番圖-making' of Hanseongbu(modern Seoul) before the Japanese colonial period. '$Tonhobeondo$統戶番圖-making' will be accomplished through analysis on Kwangmu-census光武戶籍 as a map of address-system in the Joseon period. It is possible to consider the urban changes of Hanseongbu(modern Seoul) because of '$Tonhobeondo$統戶番圖' reflects a urban situation from the 1897 to 1906. At present, an address-system of Korea was made by the cadastral survey in the 1914. By the way, new address-system was a completely different from traditional address-system of Joseon period. Consequently, different two address-system caused a lot of difficulties the study on the urban changes. For such a reason '$Tonhobeondo$統戶番圖-making' is very important. If '$Tonhobeondo$統戶番圖-making' would be accomplished, it will be used by a field of urban, architectural and historical science study besides.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11B
• /
• pp.960-968
• /
• 2006

HMIPv6 improved the handover management of basic MIPv6 by introducing the new protocol agent MAP. In this new protocol, MAP instead of the Mobile Node intercepts all packets and redirects the packets to CoA of the Mobile Node. However, this process may degrade the network performance due to the centralization phenomenon of registration occurring in the hierarchical MAP structure. ffe propose two schemes to improve real time traffic performance. First proposal is a MAP selection mettled in which MAP is selected based on traffic characteristics. And we also propose differentiated traffic processing scheme with multi-level queues when Home Agent or Correspondent Nodes process Binding Update messages. Performances of the proposed scheme are analyzed. Analysis result shows that our model has good performance in the respect of location update cost and total cost of Mobile Nodes.

• Journal of Environmental Impact Assessment
• /
• v.21 no.4
• /
• pp.573-579
• /
• 2012

Many countries have recently been expanding efforts for low-carbon global economy to solve the problem of global warming. Development and research for various types of new reusable energy is on the rise throughout the world. The most promising source of energy is the solar photovoltaic energy and the government take an initiative to establish both short-term and long-term policies to develop the solar energy potential resource map. The solar energy and industrialize area researched by GIS methods for optimum site for solar power transfer system. This study attempts to address the hot issue of the development and suitability of the solar photovoltaic energy site using GIS spatial analysis. We need to analyze and describe the solar technology, green energy policies and the energy market trend of the field.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.5
• /
• pp.435-444
• /
• 2012

Although the multi-scale map database should be constructed for the web map services and location-based services, much part of generation process is based on the manual editing. In this study, the map generalization methodology for automatic construction of multi-scale database from the primary data is proposed. Moreover, the generalization methodology is applied to the real map data and the prototype of multi-scale map dataset is generated. Among the generalization operators, selection/elimination, simplification and amalgamation/aggregation is applied in organized manner. The algorithm and parameters for generalization is determined experimentally considering T$\ddot{o}$pfer's radical law, minimum drawable object of map and visual aspect. The target scale level is five(1:1,000, 1:5,000, 1:25,000, 1:100,000, 1:500,000) and for the target data, new address data and digital topographic map is used.

• 한국전산유체공학회:학술대회논문집
• /
• 2005.10a
• /
• pp.1-10
• /
• 2005

A new approach, Multi-Objective Design Exploration (MODE), is presented to address Multidisciplinary Design Optimization (MDO) problems by CFD-CSD coupling. MODE reveals the structure of the design space from the trade-off information and visualizes it as a panorama for Decision Maker. The present form of MODE consists of Kriging Model, Adaptive Range Multi Objective Genetic Algorithms, Analysis of Variance and Self-Organizing Map. The main emphasis of this approach is visual data mining. An MDO system using high fidelity simulation codes, Navier-Stokes solver and NASTRAN, has been developed and applied to a regional-jet wing design. Because the optimization system becomes very computationally expensive, only brief exploration of the design space has been performed. However, data mining result demonstrates that design knowledge can produce a good design even from the brief design exploration.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.4
• /
• pp.104-114
• /
• 2016

Potholes have caused diverse problems such as wheel damage and car accident. A pothole detection technology is the most important to provide efficient pothole maintenance. The previous pothole detections have been performed by manual reporting methods. Thus, the problems caused by potholes have not been solved previously. Recently, many pothole detection systems based on video cameras have been studied, which can be implemented at low costs. In this paper, we propose a new pothole detection algorithm based on saliency map information in order to improve our previously developed algorithm. Our previous algorithm shows wrong detection with complicated situations such as the potholes overlapping with shades and similar surface textures with normal road surfaces. To address the problems, the proposed algorithm extracts more accurate pothole regions using the saliency map information, which consists of candidate extraction and decision. The experimental results show that the proposed algorithm shows better performance than our previous algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.4
• /
• pp.49-58
• /
• 2007

Hierarchical Mobile IPv6 (HMIPv6) has been proposed by Internet Engineering Task Force (IETF) to compensate for such problems as handover latency and signaling overhead in employing Mobile IPv6 (MIPv6). HMIPv6 supports micro-mobility within a domain and introduces a new entity, namely mobility anchor point (MAP) as a local home agent. However, HMIPv6 causes load concentration at a particular MAP and longer handover latency when inter-domain handover occurs. In order to solve such problems, this paper establishes a virtual domain (VD) of a higher layer MAP and proposes a MAP changing algorithm in which the routing path changes between mobile node (MN) and correspondent node(CN) according to the mobile position and the direction of the MN before inter-domain handover occurs. The proposed algorithm not only enables complete handover binding-update of the on-link care of address (LCoA) only when inter-domain handover occurs, but concentrated load of a particular MAP is distributed as well. This is because the MNs registered with higher layer MAP and lower layer MAP coexist in the VD. We simulate the performance of the proposed algorithm and compare with HMIPv6.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2335-2337
• /
• 2001

In this paper, we address a new complete coverage navigation algorithm and guidance methodology for the cleaning robot. The proposed algorithm is based on the grid map. Six templates, excluding a Back-Trace(BT) template are used as the local navigation method. The effectiveness of the algorithm proposed in this paper is thoroughly demonstrated through simulations and the evaluation of parameters for the path execution.