• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.627-634
• /
• 2006

Overlay network eliminates the need to change the application-layer tree when the underlying network changes and enables the overlay network to survive in environments where nonmember nodes do not support multicast functionality. An overlay protocol monitors group dynamics, while underlying unicast protocols track network dynamics, resulting in more stable protocol operation and low control overhead even in a highly dynamic environment. But, if overlay multicast protocols does not know the location information of node, this makes it very difficult to build an efficient multicasting tree. So, we propose a Hierarchical Overlay Multicast Architecture (HOMA) with the location information. Because proposed architecture makes static region-based dynamic group by multicast members, it is 2-tired overlay multicasts of application layer that higher layer forms overlay multicast network between members that represent group, and support multicast between multicast members belonging to region at lower layer. This use GPS, take advantage of geographical region, and realizes a region-sensitive higher layer overlay multicast tree which is impervious to the movements of nodes. The simulation results show that our approach solves the efficiency problem effectively.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.83-96
• /
• 2005

The multichannel switch is an architecture widely used for ATM (Asynchronous Transfer Mode). It is known that the fault tolerant characteristic can be incorporated into the multichannel crossbar switching fabric. For example, if a link belonging to a multichannel group fails, the remaining links can assume responsibility for some of the traffic on the failed link. On the other hand, if a fault occurs in a switching element, it can lead to erroneous routing and sequencing in the multichannel switch. We investigate several fault localization algorithm in multichannel crossbar ATM switches with a view to early fault recovery. The optimal algorithm gives the best performance in terms of time to localization but it is computationally complex which makes it difficult to implement. We develop an on-line algorithm which is computationally more efficient than the optimal one. We evaluate its performance through simulation. The simulation results show that the Performance of the on-line algorithm is only slightly sub-optimal for both random and bursty traffic. There are cases where the proposed on-line algorithm cannot pinpoint down to a single fault. We enumerate those cases and investigate the causes. Finally, a fault recovery algorithm is described which utilizes the information provided by the fault localization algorithm The fault recovery algorithm providesadditionalrowsandcolumnstoallowcellstodetourthefaultyelement.

• The Journal of Bigdata
• /
• v.4 no.2
• /
• pp.159-173
• /
• 2019

Last-Mile delivery optimization plays a key role in the urban supply chain operation, which is the most expensive and time-consuming and most complicated part of the whole delivery process. The urban consolidation center (UCC) is regarded as a significant asset for supporting customer demand in the last-mile delivery service. It is the key benefit of UCC to improve the load balance of vehicles and to reduce the total traveling distance by finding the better route with the well-organized multi-leg vehicle journey in the urban area. This paper presents the model using multiple scenario analysis integrated with mathematical optimization techniques using Geographic Information System (GIS). The model aims to find the best solution for the distribution network consisted of DC and UCC, which is applied to the case of Ulaanbaatar Mongolia. The proposed methodology integrates two sub-models, location-allocation model and vehicle routing problem. The multiple scenarios devised by selecting locations of UCC are compared considering the general performance and delivery patterns together. It has been adopted to make better decisions the quantitative metrics such as the economic value of capital cost, operating cost, and balance of using available resources. The result of this research may help the manager or public authorities who should design the distribution network for the last mile delivery service optimization using UCC within the urban area.

• Journal of Korea Water Resources Association
• /
• v.38 no.5 s.154
• /
• pp.391-399
• /
• 2005

The purpose of this study is to evaluate hydrological impact by the land cover change of typhoon damage. For the typhoon RUSA (rainfall 1,402 mm) occurred in 2002 (August $31\;{\sim}$ September 1), satellite images of Landsat 7 ETM+ of September 29, 2000 and Landsat 5 TM of September 11, 2002 were selected, and each land cover was classified for Namdae-cheon watershed $192.7km^2$ located in the middle-eastern part of Korea Peninsula. SCS unit hydrograph for watershed runoff and Muskingum for streamflow routing of WMS HEC-1 was adopted. 30m resolution DEM & hydrological soil group using 1:50,000 soil map were prepared. The model was calibrated using three available data of storm events of 1985 to 1988 based on 1985 land cover condition. To predict the streamflow change by damaged land cover condition, rainfall of 50 years to 500 years frequency were generated using 2nd quantile of Huff method. The damaged land cover condition treated as bare soil surface increased streamflow of $50.1\;m^3/sec$ for 50 years rainfall frequency and $67.6\;m^3/sec$ for 500 years rainfall frequency based on AMC-I condition. There may be some speedy treatment by the government for the next coming typhoon damage.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.659-667
• /
• 2005

A Mobile Ad Hoc Network(MANET) is a multi hop wireless network with no prepared base stations or centralized administrations, where flocks of peer systems gather and compose a network. Each node operates as a normal end system in public networks. In addition to it, a MANET node is required to work as a router to forward traffic from a source or intermediate node to others. Each node operates as a normal end system in public networks, and further a MANET node work as a router to forward traffic from a source or intermediate node to the next node via routing path. Applications of MANET are extensively wide, such as battle field or any unwired place; however, these are exposed to critical problems related to network management, node's capability, and security because of frequent and dynamic changes in network topology, absence of centralized controls, restricted usage on network resources, and vulnerability oi mobile nodes which results from the special MANET's character, shared wireless media. These problems induce MANET to be weak from security attacks from eavesdropping to DoS. To guarantee secure authentication is the main part of security service In MANET because networks without secure authentication are exposed to exterior attacks. In this paper, a multistage authentication strategy based on CGSR is proposed to guarantee that only genuine and veritable nodes participate in communications. The proposed authentication model is composed of key manager, cluster head and common nodes. The cluster head is elected from secure nodes, and key manager is elected from cluster heads. The cluster head will verify other common nodes within its cluster range in MANET. Especially, ID of each node is used on communication, which allows digital signature and blocks non repudiation. For performance evaluation, attacks against node authentication are analyzed. Based on security parameters, strategies to resolve these attacks are drawn up.

• The KIPS Transactions:PartB
• /
• v.9B no.4
• /
• pp.481-490
• /
• 2002

Off-line handwritten character recognition is in difficulty of incomplete preprocessing because it has not dynamic information has various handwriting, extreme overlap of the consonant and vowel and many error image of stroke. Consequently off-line handwritten character recognition needs to study about preprocessing of various methods such as binarization and thinning. This paper considers running time of watershed algorithm and the quality of resulting image as preprocessing for off-line handwritten Korean character recognition. So it proposes application of effective watershed algorithm for segmentation of character region and background region in gray level character image and segmentation function for binarization by extracted watershed image. Besides it proposes thinning methods that effectively extracts skeleton through conditional test mask considering routing time and quality of skeleton, estimates efficiency of existing methods and this paper's methods as running time and quality. Average execution time on the previous method was 2.16 second and on this paper method was 1.72 second. We prove that this paper's method removed noise effectively with overlap stroke as compared with the previous method.

• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.115-122
• /
• 2004

In this paper, the multiple-valued adders and multipliers are implemented by current-mode CMOS. First, we implement the 3-valued T-gate and the 4-valued T-gate using current-mode CMOS which have an effective availability of integrated circuit design. Second we implement the circuits to be realized 2-variable 3-valued addition table and multiplication table over finite fields $GF(3^2)$, and 2-variable 4-valued addition table and multiplication table over finite fields $GF(4^2)$ with the multiple-valued T-gates. Finally, these operation circuits are simulated under $1.5\mutextrm{m}$ CMOS standard technology, $15\mutextrm{A}$ unit current, and 3.3V VDD voltage Spice. The simulation results have shown the satisfying current characteristics. The 3-valued adder and multiplier, and the 4-valued adder and multiplier implemented by current-mode CMOS is simple and regular for wire routing and possesses the property of modularity with cell array. Also, since it is expansible for the addition and multiplication of two polynomials in the finite field with very large m, it is suitable for VLSI implementation.

• The KIPS Transactions:PartB
• /
• v.14B no.3 s.113
• /
• pp.171-182
• /
• 2007

We propose a simple method for tracking a nonparameterized subject contour in a single video stream with a moving camera and changing background. Then we present a method to eliminate the tracked contour object by replacing with the background scene we get from other frame. First we track the object using LOD (Level-of-Detail) canny edge maps, then we generate background of each image frame and replace the tracked object in a scene by a background image from other frame that is not occluded by the tracked object. Our tracking method is based on level-of-detail (LOD) modified Canny edge maps and graph-based routing operations on the LOD maps. We get more edge pixels along LOD hierarchy. Our accurate tracking is based on reducing effects from irrelevant edges by selecting the stronger edge pixels, thereby relying on the current frame edge pixel as much as possible. The first frame background scene is determined by camera motion, camera movement between two image frames, and other background scenes are computed from the previous background scenes. The computed background scenes are used to eliminate the tracked object from the scene. In order to remove the tracked object, we generate approximated background for the first frame. Background images for subsequent frames are based on the first frame background or previous frame images. This approach is based on computing camera motion. Our experimental results show that our method works nice for moderate camera movement with small object shape changes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.623-628
• /
• 2009

The emergence of compact and low-power wireless communication sensors and actuators in the technology supporting the ongoing miniaturization of processing and storage allows for entirely the new kinds of embedded systems. These systems are distributed and deployed in environments where they may have been designed into a particular control method, and are often very dynamic. Collection of devices can communicate to achieve a higher level of coordinated behavior. Wireless sensor nodes deposited in various places provide light, temperature, and activity measurements. Wireless sensor nodes attached to circuits or appliances sense the current or control the usage. Together they form a dynamic and multi-hop routing network connecting each node to more powerful networks and processing resources. Wireless sensor networks are a specific-application and therefore they have to involve both software and hardware. They also use protocols that relate to both applications and the wireless network. Wireless sensor networks are consumer devices supporting multimedia applications such as personal digital assistants, network computers, and mobile communication devices. Wireless sensor networks are becoming an important part of industrial and military applications. The characteristics of modem embedded systems are the capable of communicating adapting the different operating environments. In this paper, We designed and implemented sensor network system which shows through host PC sensing temperature and humidity data transmitted for wireless sensor nodes composed wireless temperature and humidity sensor and designs sensor nodes using embedded system with the intention of studying USN.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.3
• /
• pp.585-600
• /
• 2012

Security issues in online games are increasing as the online game industry grows. Real money trading (RMT) by online game users has become a security issue in several countries including Korea because RMT is related to criminal activities such as money laundering or tax evasion. RMT-related activities are done by professional work forces, namely gold-farmers, and many of them employ the automated program, bot, to gain cyber asset in a quick and efficient way. Online game companies try to prevent the activities of gold-farmers using game bots detection algorithm and block their accounts or IP addresses. However, game bot detection algorithm can detect a part of gold-farmer's network and IP address blocking also can be detoured easily by using the virtual private server or IP spoofing. In this paper, we propose a method to detect gold-farmer groups by analyzing their connection patterns to the online game servers, particularly information on their routing and source locations. We verified that the proposed method can reveal gold-farmers' group effectively by analyzing real data from the famous MMORPG.