• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.599-603
• /
• 2006

유비쿼터스 센서 네트워크(Ubiquitous Sensor Network, USN)는 차세대 네트워크로 각광받고 있고 이러한 센서 네트워크의 보안에 대한 관심은 더욱 높아지고 있다. 왜냐하면 센서 네트워크를 외부 공격자로부터 보호하기 위해서는 센서 노드 사이의 암호화 통신과 인증 등이 필요하기 때문이다. 이를 위해서는 안전한 키 생성 및 폐기가 우선 이루어져야 한다. 지금까지 센서 네트워크를 위해 제안된 키 분배 프로토콜은 매우 다양하다. 그러나 이러한 프로토콜들이 기반하고 있는 가정들이 얼마나 안전하고 현실성 있는 지 분석되어 있지 않다. 키 분배의 대표적 프로토콜인 LEAP(Localized Encryption and Authentication Protocol)은 무선 센서 네트워크에 적합한 가정을 하였다고 알려져 있다. 본 논문에서는 이 LEAP 프로토콜을 USN 상에서 구현을 통해 이 가정의 현실성에 대해 분석해 볼 것이다. 이는 차후 다양한 키 분배 프로토콜을 연구 개발하는 데 있어서 상당한 도움이 될 거라 예상된다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11c
• /
• pp.1859-1862
• /
• 2002

비공유 데이터베이스 클러스터는 그 구조의 특성 상 동적인 질의 패턴의 변화, 특정 데이터에 대한 질의 집중에 의한 부하 불균형 및 집중, 사용자 증가에 의한 처리량 한계 등의 문제가 발생한다. 이러한 문제를 해결하기 위해 데이터베이스 클러스터는 최근에 제안된 온-라인 확장기법을 사용하며, 이 기법은 데이터 베이스의 확장성에 의해 큰 영향을 받는다. 일반적으로 클러스터 시스템에서 사용되는 데이터 분할 기법에는 키 값의 순서대로 분할하는 라운드-로빈 분할 기법, 해쉬 함수를 이용해 데이터를 분할하는 해쉬 분할 기법, 범위에 따라 각 노드에 데이터를 분할하는 범위 분할기법, 그리고 조건식에 따라 데이터를 분할하는 조건식 분할 기법이 있다. 본 논문에서는 이 네 가지 분할 기법의 특성을 정리하고, 비공유 데이터베이스 클러스터에서 확장성에 있어서 우수한 분할 기법을 각 분할 기법의 성능평가를 통해 얻는다. 성능평가에서는 각각의 분한 기법을 평가하기 위해 확장 시 발생되는 이동 데이터의 크기, 질의처리에 대한 영향, CPU 사용률, 그리고 온-라인 확장기법의 수행 시 발생되는 특성에 대한 영향을 분석하며, 얻어진 결과를 토대로 비공유 데이터베이스 클러스터에서 가장 적합하면서도 온-라인 확장 기법적용을 위해 확장성이 우수한 데이터 분할기법을 찾는다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.11
• /
• pp.385-392
• /
• 2016

Recently, Expectation Area-based Real-time Routing (EAR2) protocol has been proposed to support real-time routing in wireless sensor networks. EAR2 considers the expectation area of a mobile sink and uses flooding within the expectation area. However, flooding leads to excessive energy consumption and causes long delay against real-time routing. Moreover, since EAR2 uses single path to the expectation area, it is difficult to support reliable routing in sensor networks with high link failures. Thus, to overcome these limitation of EAR2, this paper proposes a reliable and real-time routing protocol based on virtual grids and multipath for mobile sinks. To support real-time routing, the proposed protocol considers expectation grids belonged to the expectation area. Instead of flooding within the expectation area, the proposed protocol uses multicasting to the expectation grids and single hop forwarding in an expectation grid because the multicasting can save much energy and the single hop forwarding can provide short delay. Also, the proposed protocol uses multipath to the expectation grids to deal with link failures for supporting reliable routing. Simulation results show that the proposed protocol is superior to the existing protocols.

• Journal of KIISE:Software and Applications
• /
• v.34 no.4
• /
• pp.368-376
• /
• 2007

How to represent the search space is as important as which search algorithm to use for finding natural-looking paths for moving NPC (non-player character) in computer games. Recently, various state space representation methods which have been developed for computer games are being used while A* algorithm dominates as the preferred search algorithm. These representation methods show some drawbacks such as the size of state space is too large, there is no guarantee for optimality, the path found is not natural-looking, and the generation of nodes and links is not automatic by depending on a level designer. In this paper the requirements for natural-looking paths are introduced and to find paths satisfying these requirements, the use of the generalized visibility graphs which is the extended version of the visibility graph in Robotics is proposed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.12
• /
• pp.34-43
• /
• 2007

Recently, in addition to the sharp increase of mobile nodes, various kinds of wireless technologies are available for mobile nodes. If IPv6 technology is applied to the network, multi-homing terminals which have several public IP addresses on one interface will be common. Accordingly, there are many research activities on mobility management for multi-interface, multi-homming nodes. In this paper we propose an extended fast handover mechanism for multi-interface MIPv6 environments that uses multi-interface FBU (MFBU) message instead of the existing FBU message. The MFBU message has the "tunnel destination" mobility option that points a specific tunnel destination other than NAR, and "T" flag that indicates the existence of tunnel destination option. The proposed mechanism can improve the TCP performance by mitigating packet reordering during FMIPv6 handover that can cause unnecessary congestion control due to 3 duplicate ACKs. In this paper, we implemented a multi-Interface MIPv6 simulator by extending a single-interface MIPv6 simulator in NS-2, and showed that the performance of TCP traffic is improved by using the proposed multi-interface fast MIPv6.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.8
• /
• pp.8-16
• /
• 2016

This study presents the visualization of shape information based on Octree using 3D laser scanning. The process of visualization was established to construct the Octree structure from the 3D scan data. The scan data was converted to a 2D surface through the mesh technique and the surface was then converted to a 3D object through the Raster/Vector transformation. The 3D object was transmitted to the Octree Root Node and The shape information was constructed by the recursive partitioning of the Octree Root Node. The test-bed was selected as the steel bridge structure in Sungkyunkwan University. The shape information based on Octree was condensed into 89.3%. In addition, the Octree compressibility was confirmed to compare the shape information of the office building, a computer science campus in Germany and a New College in USA. The basis is created by the visualization of shape information for double-deck tunnel and it will be expected to improve the efficiency of structural health monitoring and maintenance.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.131-138
• /
• 2007

In wired networks, packet losses mostly occur due to congestion. TCP reacts to the congestion by decreasing its congestion window, thus to reduce network utilization. In wireless networks, however, losses may occur due to the high bit-error rate of the transmission medium or due to fading and mobility. Nevertheless, TCP still reacts to packet losses according to its congestion control scheme, thus to reduce the network utilization unnecessarily. This reduction of network utilization causes the performance of TCP to decrease. In this paper, we predict packet loss by using RSS(Received Signal Strengths) on the wireless and suggest adding RSS flag bit in ACK packet of MH. By using RSS flag bit in ACK, the FH(Fixed Host) decides whether it adopt congestion control scheme or not for the maximum throughput. The result of the simulation by NS-2 shows that the proposed mechanism significantly increases sending amount and receiving amount by 40% at maximum.

• Proceedings of the Korea Information Assurance Society Conference
• /
• 2004.05a
• /
• pp.29-34
• /
• 2004

As the number of internet users grows rapidly, the services which users required becomes various. However, for fulfilling these various user requirements, the existing passive network should be standardized for a long time. To resolve the delay on providing services, active network as a new technology was suggested. Its router or switch with DARPA as center has the program running ability, so user oriented network can be composed. However, active network's architecture can resolve the user required service using mobile code on the network node, but it is more complex, easy-to-attack, various than the passive network. Many researchers have tried to resolve this problem. So, this paper studied the mobile code security service in active network environment to provide user's convenience and accommodation, and introduced ANASP system as an alternative.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.7-16
• /
• 2005

Resource Reservation Protocol(RSVP) can provide Quality-of-Service(QoS) guarantees for real-time services in wired networks. However, RSVP suffers from mobility problem in the mobile Internet. Therefore, to provide seamless QoS services, it is needed that a mobile node makes a reservation everywhere it visits. Recently, many protocols have been proposed to provide QoS guarantees through advance resource reservation. But, these proposals have problems with a waste of bandwidth and the signaling overhead due to advance resource reservation. In this paper, we propose new advance resevation protocol, Proportional Aggregate RSVP(PA-RSVP) to minimize the resource reservation bandwidth and the signaling overhead in the mobile Intemet while providing QoS guarantees. Based on the performance evaluation, we show that the proposed protocol provides an improved performance over existing protocols under various system conditions.

• Journal of Korean Society of Transportation
• /
• v.28 no.1
• /
• pp.77-86
• /
• 2010

The study developed physical distribution channel choice models reflecting decision making of the firms and studied how choice decision factors influence selection of distribution channel. The distribution channel survey data in Korea was used to do empirical study. As a choice set, distribution channels were classified into two main choice channels: direct and indirect channels. In addition, indirect channels were classified into other three channels according to the type of intermediate point: distribution center, wholesale store, and agency. This study developed choice models by applying both binary and multinomial logit model with various set of factors. The results showed that the developed logit models seemingly reflect distribution channel choice behaviors. The hypothesis tests on how each factor influences choice of distribution channel were performed and discussed as well.