• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.793-795
• /
• 2001

Ad-hoc 망은 인터넷과는 다른 독립적인 망을 구성하는 경우 사용되게 된다. 이러한 Ad-hoc의 특정 호스트가 인터넷 망과의 연결을 시도하는 경우, 이 호스트로의 패킷의 라우팅을 위해서는 모든 경로상의 라우터에서 이 호스트에 대한 정보의 엔트리가 추가되어야만 한다. 이는 망 구현 과정에서 확장성 (Scalability) 문제를 야기하게 된다. 즉, 라우팅 테이블 엔트리의 증가로 차지하는 라우터의 메모리 문제나, 해당 호스트의 정보를 찾고자 할 때의 소요시간으로 적용하기 어렵다. 이러한 확장성 문제를 제거하는 방법으로 자동으로 주소를 설정 하는 방식인 DHCP(Dynamic Host Configuration Protocol)에 대해서 알아 보았다. 그리고. DHCP의 문제점인 기존의 라우팅 정보를 손실되는 문제가 있어 적용하기 어렵다. 이에 본 논문은 확장성 문제를 제거하는 동시에 엑세스 포인트(access point)에서 NAT(Network Address Translation) 기술을 적용하여 AODV(Ad-Hoc On-Demand Distance Vector) 라우팅 프로토롤과 인터넷의 연동을 위한 메커니즘을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1271-1274
• /
• 2004

현재 운용중인 대부분의 VPN은 모든 CPE(Customer Premise Equipment) VPN GW(Gateway)들이 Center VPN GW에 연결되어 있는 Star 구조를 취하고 있다. 이러한 구조에서는 모든 트래픽들이 항상 Center VPN GW를 거쳐서 전송되므로 비효율적인 트래픽 전송이 이루어진다. 또한 대용량의 멀티미디어 트래픽 전송이 빈번하거나 다수의 지점을 갖고 있는 기업의 경우 Center VPN GW에서의 오버헤드가 증가하게 된다. 이러한 문제를 해결하기 위한 방법으로는 IPSec의 IKE(Internet Key Exchange) 메커니즘을 이용하여 CPE VPN GW간 직접 터널을 맺어 줄 수 있으나, 터널 설립에 앞서 원격지 CPE VPN GW의 주소, 요구되는 보안 등급 등의 터널 설정에 필요한 정보를 관리자가 직접 설정해 주어야 한다. 이는 현재 DHCP와 같은 동적 IP 환경에서 운용되는 ADSL 기반의 VPN 환경에서 관리 오버헤드를 증가시키는 요인이 된다. 이에 본 논문에서는 CPE VPN GW 간 직접 터널 연결이 필요할 시에 자동적으로 제반 기능들이 수행될 수 있게 하는 주문형 터널 생성(On-demand Tunnel Creation) 메커니즘 제안한다. 시뮬레이션을 통해 제안하는 방안에 대하여 성능을 조사하였고, 이와 함께 기존의 Star VPN 구조, Full-mesh VPN 구조와 성능을 비교하였다. 시뮬레이션 결과, 제안하는 방안이 기존의 Star VPN 구조보다 확장성과 트래픽 전송효율성, Center VPN GW의 오버헤드 측면에서 우수한 성능을 보였으며 Full-mesh 구조의 VPN과 거의 비슷한 종단간 지연시간과 처리율을 보였다.

• KIISE Transactions on Computing Practices
• /
• v.23 no.1
• /
• pp.13-27
• /
• 2017

This paper presents a tool that automatically generates mobile web applications from user interface (UI) models which are based on PELUM (Pattern and Event based Logical User Interface Modeling). PELUM is a method for the effective development of UI-centered embedded systems via UI modeling. The proposed tool consists of a model editor and a code generator. The former provides an environment for modeling a Logical UI Model (LUM) and a Programming Interface Model (PIM) on the web. On the other hand, the code generator sets the screen configuration and events' behavior, according to the LUM, synthesizing a local database schema according to the PIM, and then generates an executable mobile web app. It also can produce mashup web apps by receiving an open API address via the PIM. The generated mobile web apps follow the Model-View-Controller (MVC) architecture in order for users to easily customize them. The proposed tool enables them to generate mobile web apps that can be executed on various devices by modeling logical UIs on the web.

• Journal of KIISE:Information Networking
• /
• v.33 no.2
• /
• pp.175-182
• /
• 2006

The CGA proposed by IETF working group prevents address spoofing and stealing and provides digital signature to users, but key collision problem arises. To solve this critical problem, the CGA defines the SEC field within address format, which is set to high value when high security is required and vice versa, but the CGA faces a dilemma between security and the processing time. As SEC value increases, the processing time to generate the CGA grows dramatically while key collision ratio increases if low SEC value is applied to the CGA. We propose modified CGA (MCGA) that has shorter processing time than the CGA and offers digital signature with small overheads. To solve key collision problem, we employ hierarchical ad hoc network. The MCGA is applicable to IPv6 networks as well public networks. In this paper, we design a mathematical model to analyze the processing time for MCGA and CGA first and evaluate the processing time via simulations, where the processing time for MCGA is reduced down 3.3 times when SEC value is set to 0 and 68,000 times when SEC value is set to 1. Further, we have proved that the CGA is inappropriate for both ad hoc networks and IPv6 networks when the SEC field is set to more than 3.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.282-291
• /
• 2008

This paper focuses on message complexity performance analysis of MANET AAPs in reference to link errors generated by the mobile wireless nodes. To obtain the message complexity performance of AAPs in reference to the link error probability ($P_e$), an enhancement was made by proposing the retransmission limit (S) to be computed for error recovery (based on the link error probability), and then for each of the AAPs the control procedures for the retransmission limit have been properly included. The O-notation has been applied in analyzing the upper bound of the number of messages generated by a MANET group of N nodes. Based on a link error probability range of $P_e=0$ to 0.8, the AAPs investigated in this paper are Strong DAD, Weak DAD with proactive routing protocol (WDP), Weak DAD with on-demand routing protocol (WDO), and MANETconf. Based on the simulation results and analysis of the message complexity, for nominal situations, the message complexity of WDP was lowest, closely followed by WDO. The message complexity of MANETconf is higher than that of WDO, and Strong DAD results to be most complex among the four AAPs.

• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.27-38
• /
• 2007

IPv6 has appeared for solving the address exhaustion of IPv4 and for guaranteeing the problems of security and QoS. It occurs the unexpected new attacks of IPv6 as well as the existing attacks of IPv4 because of the increasing address space to 128bits and the address hierarchies for efficient network management and additions of the new messages between nodes and routers like neighbor discovery and auto address configuration for the various comfortable services. For the successful transition from IPv4 to IPv6, we should get the secure compatibility between IPv4 hosts or routers working based on secure and systematic policy and IPv6. Network manager should design security technologies for efficient management in IPv4/IPv6 co-existence network and IPv6 network and security management framework designation. In this paper, we inspected the characteristics of IPv4 and IPv6, study on security requirement for efficient security management of various attacks, protocol, service in IPv4/IPv6 co-existence and IPv6 network, and finally suggest integrated solution about security vulnerability of IPv6 network in considering of analysis of IPv6 system, host and application, IPv6 characteristics, modified CGA(MCGA).

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.6
• /
• pp.643-656
• /
• 2000

MPOA proposed and standardized by the ATM Forum is a protocol tllat provides effective bridging and routing for ATM networks in a diverse network environment. Its plimary goal is to transfer unicast data effectively among the subnets. In this paper, MPOA components are implemented using the SDL(Specification and Description Language) which the ITU has standardized for the development of communication systems. In addition, MPOA procedures for various operations such as address translation for packets from upper layers, Ingress/Egress cache management and shortcut configuration, are examined with tlle help of the SDT(SDL Design Too]) simulator.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.6
• /
• pp.531-537
• /
• 2005

The Tunnel Broker is to provide dedicated servers and to automatically manage tunnel requests coming from the users. This approach is useful to stimulate the growth of IPv6 interconnected hosts and to provide easy access to their IPv6 networks. However, the existing tunnel broker is vulnerable to attacks of malicious users about network resources and services. Therefore, to solve the secure problem of tunnel broker, this paper presents secure IPv6 tunnel broker based on TSP(Tunnel Setup Protocol). The clients and the tunnel broker are communicated based on SHTTP(Secure HTTP) and the XML message of plain text is converted to XML signature by encryption and decryption. finally, Clients and tunnel server use the IPsec method to protect the important information.

• 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.

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.1
• /
• pp.89-98
• /
• 2016

In this paper, we proposed an automated areal feature matching method based on geometric similarity without user intervention and is applied into areal features of many-to-many relation, for confusion of spatial data-sets of different scale and updating cycle. Firstly, areal feature(node) that a value of inclusion function is more than 0.4 was connected as an edge in adjacency matrix and candidate corresponding areal features included many-to-many relation was identified by multiplication of adjacency matrix. For geometrical matching, these multiple candidates corresponding areal features were transformed into an aggregated polygon as a convex hull generated by a curve-fitting algorithm. Secondly, we defined matching criteria to measure geometrical quality, and these criteria were changed into normalized values, similarity, by similarity function. Next, shape similarity is defined as a weighted linear combination of these similarities and weights which are calculated by Criteria Importance Through Intercriteria Correlation(CRITIC) method. Finally, in training data, we identified Equal Error Rate(EER) which is trade-off value in a plot of precision versus recall for all threshold values(PR curve) as a threshold and decided if these candidate pairs are corresponding pairs or not. To the result of applying the proposed method in a digital topographic map and a base map of address system(KAIS), we confirmed that some many-to-many areal features were mis-detected in visual evaluation and precision, recall and F-Measure was highly 0.951, 0.906, 0.928, respectively in statistical evaluation. These means that accuracy of the automated matching between different spatial data-sets by the proposed method is highly. However, we should do a research on an inclusion function and a detail matching criterion to exactly quantify many-to-many areal features in future.