• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.377-385
• /
• 2010

In this paper, we propose a SInk-initiated geographic Multicast (SIM) protocol to reduce frequent location updates from mobile sinks to a source and to achieve fast multicast tree construction and data delivery. The proposed protocol allows sinks to construct their own data delivery paths to a source node and a multicast tree to be atomically constructed by merging the paths. Then, the source forwards data to the destinations down the multicast tree. This paper also propose a round-based virtual infrastructure with a radial shape for increasing the merging probability of data delivery paths and reducing reconstruction ratio of the multicast tree due to mobility of sinks. Simulation results show that the proposed protocol is superior to previous SOurce-initiated geographic Multicast (SOM) protocols in term of average data delivery delay and average energy consumption.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.137-148
• /
• 2012

In this paper, we proposed the location-aware coordinate routing algorithm for improving the performance of routing algorithm by using ZigBee in Smart Grid environment. A distributed address allocation scheme used an existing algorithm that has wasted in address space. The x, y and z coordinate axes from divided address space of 16 bit to solve this problems. However, coordinate routing does not take account of wireless link condition. If wiress link condition is not considered, when the routing table is updated, the nodes with bad link conditions are updated in the routing table and can be chosen as the next hop. This brings out the retransmissions because of received packet's errors. Also, because of these retransmissions, additional power is consumed. In this paper, we propose the location-aware coordinate routing algorithm considering wiress link condition, where reliable data transmission is made and the consumed enegy is minimize. and we compared and connected region and transition region of ZigBee location based routing in the aspect of average number of multi hops, subordinate packet delivery ratio, delay time, and energy consumption of proposed algorithm. It turned out that there were improvements in performances of each items.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.3
• /
• pp.193-204
• /
• 2012

This paper specifies a low-cost global mobility management architecture and protocol procedure called LC-$GM^2$, which is based on Proxy Mobile IPv6. In LC-$GM^2$, mobility management is performed by the network entity. The benefit is the elimination of the wireless link data delivery tunnel overhead between a mobile node and the access router. To compare with the well-known Hierarchical Mobile IPv6 mobility management protocol and GPMIP, the location update, packet delivery, and total cost functions generated by a mobile node during its average domain residence time are formulated for each protocol based on Fluid-flow mobility model. Then, the impacts of various system parameters on the cost functions are analyzed. The analytical results indicate that the proposed global mobility management protocol can guarantee lower total costs.

• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.150-167
• /
• 2009

XML has become the new standard for storing, exchanging, and publishing of data over both the internet and the ubiquitous data stream environment. As demand for efficiency in handling XML document grows, labeling scheme has become an important topic in data storage. Recently proposed labeling schemes reflect the dynamic XML environment, which itself provides motivation for the discovery of an efficient labeling scheme. However, previous proposed labeling schemes have several problems: 1) An insertion of a new node into the XML document triggers re-labeling of pre-existing nodes. 2) They need larger memory space to store total label. etc. In this paper, we introduce a new labeling scheme called a Circle Labeling Scheme. In CLS, XML documents are represented in a circular form, and efficient storage of labels is supported by the use of concepts Rotation Number and Parent Circle/Child Circle. The concept of Radius is applied to support inclusion of new nodes at arbitrary positions in the tree. This eliminates the need for re-labeling existing nodes and the need to increase label length, and mitigates conflict with existing labels. A detailed experimental study demonstrates efficiency of CLS.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.876-879
• /
• 2009

As performance and feature set of mobile devices are getting better, the scope of things for which they can be used is also getting widened. More than simply browsing information using mobile web, now these devices can interact with users. It requires various features to manage a web site; supporting full-browsing alone is not enough since there are problems such as processing speed, user interface restriction. However, using mobile devices to manage a web site has its own merits since the can be used without restriction of time and location. In this paper, we introduce a mobile web site administration software that provides both online and offline features. It supports CRUD (Create, Read, Update, Delete) operations for news and users. These operations can be executed both offline and online. A user can do most of things offline; It connects to online only when it's absolutely necessary and does those in batch mode.

• Journal of Digital Convergence
• /
• v.18 no.12
• /
• pp.81-86
• /
• 2020

This study aimed to speculate on Youtube for national certification education in makeup in the Untact period derived from the pandemic phenomenon such as the COVID 19. For the purpose, this study surveyed perception on Youtube on national certification education, characteristics of the programs, selection standards, continuance and recommendation intention and supplementations. The results are: The perception on Youtube was very positive(75.5%); Among characteristics, the mean value of informativeness was 3.54, that of play speed control as an advantage was 4.07 and that of feedback limit as a disadvantage was 3.64. In respect to selection standards, 44.5% of the subjects selected a program based on professionalism; 82.0% had continuance intention and 82.6% had recommendation intention. As for the needs of supplementation, the mean value of sanitation education was 4.20, that of updated regulations was 4.13 and that of feedback was 4.0. Therefore, it is suggested that if an interactive education system is supplemented in exact information and feedback, Youtube makeup certification programs will be further facilitated as useful education materials for makeup development.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.6
• /
• pp.1141-1149
• /
• 2020

Most of the industrial control network is an independent closed network, which is operated for a long time after installation, and thus the OS is not updated, so security threats increase and security vulnerabilities exist. The zero-day attack defense must be applied with the latest patch, but in a large-scale industrial network, it requires a higher level of real-time and non-disruptive operation due to the direct handling of physical devices, so a step-by-step approach is required to apply it to a live system. In order to solve this problem, utility-specific patch impact assessment is required for reliable patch application. In this paper, we propose a method to test and safely install the patch using the regression analysis technique and show the proven results. As a patch impact evaluation methodology, the maximum allowance for determining the safety of a patch was derived by classifying test types based on system-specific functions, performance, and behavior before and after applying the patch. Finally, we report the results of case studies applied directly to industrial control networks, the OS patch has been updated while ensuring 99.99% availability.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.20 no.1
• /
• pp.193-202
• /
• 2021

The update of a high-precision map was carried out by modifying the geometric information using ortho-images or point-cloud data as the source data and then reconstructing the relationship between the spatial objects. These series of processes take considerable time to process the geometric information, making it difficult to apply real-time route planning to a vehicle quickly. Therefore, this study proposed a method to update the road network for route planning using a graph data structure and storage type of graph data structure considering the characteristics of the road network. The proposed method was also reviewed to assess the feasibility of real-time route information transmission by applying it to actual road data.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.75-77
• /
• 2021

A variety of search engines are currently in use. The search engine supports the retrieval of data required by users through three stages: crawling, index generation, and output of search results based on meta-tag information. However, a large number of documents obtained by searching for keywords are often unrelated or scarce. Because of these problems, it takes time and effort to grasp the content from the search results and classify the accuracy. The index of search engines is updated periodically, but the criteria for weighted values and update periods are different from one search engine to another. Therefore, this paper uses the LSTM model, which extracts the relationship between keywords entered by the user and documents instead of the existing search engine, and improves the relationship between keywords and documents by entering keywords that the user wants to find.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.1337-1340
• /
• 2006

플래시 메모리는 비 휘발성, 경량화, 견고성, 빠른 속도 등의 장점을 가지고 있어 임베디드 시스템이나 모바일 기기를 위한 저장 장치로 각광 받고 있다. 그러나 데이터를 업데이트할 때 덮어쓰지 못하고, 지우고 다시 써야 하는 물리적 특성이나, 이 때 생기는 오버헤드, 데이터를 쓰는 횟수의 제한 같은 기술적 문제점이 있기 때문에 저장 장치로 대체되기 위해서는 파일 시스템과 플래시 메모리 사이에 FTL 을 두어 이를 해결해 주어야 한다. 본 논문에서는 데이터를 업데이트할 때 성능 향상을 위해 새로운 가비지 콜렉션 기법을 제안하고, 그 성능을 분석하였다. 플래시 메모리에 수행되는 요청이 존재하지 않을 때 thread 형태로 가비지 콜렉션을 수행하여 시스템의 유휴 시간을 활용하며 이 때 정리할 블록을 효과적으로 선정하여 메모리로의 요청이 없을 때는 최대한 많은 가용 블록을 획득하고 메모리의 요청이 빈번할 때에는 최대한 빨리 가용 블록을 획득할 수 있도록 하는 알고리즘을 제안하고 이를 구현하였다. 이를 사용하는 경우 필요할 때만 가비지 콜렉션을 수행하는 것보다 최대 25% 쓰기 시간을 줄일 수 있음을 확인하고, 시스템의 상황에 따라 블록을 선정하는 알고리즘을 유동적으로 변화시킴으로써 가비지 콜렉션의 성능을 향상시킬 수 있음을 확인하였다.