• ETRI Journal
• /
• v.41 no.4
• /
• pp.473-482
• /
• 2019

High availability and reliability have been considered promising requirements for the support of seamless network services such as real-time video streaming, gaming, and virtual and augmented reality. Increased availability can be achieved within a local area network with the use of the virtual router redundancy protocol that utilizes backup routers to provide a backup path in the case of a master router failure. However, the network may still lose a large number of packets during a failover owing to a late failure detections and lazy responses. To achieve an efficient failover, we propose the implementation of fast detection with virtual router redundancy protocol (FDVRRP) in which the backup router quickly detects a link failure and immediately serves as the master router. We implemented the FDVRRP using open neutralized network operating system (OpenN2OS), which is an open-source-based network operating system. Based on the failover performance test of OpenN2OS, we verified that the FDVRRP exhibits a very fast failure detection and a failover with low-overhead packets.

• Journal of Biomedical Engineering Research
• /
• v.24 no.2
• /
• pp.77-82
• /
• 2003

Virtual colonoscopy is a non-invasive computerized procedure to detect polyps by examining the colon from a CT data set. To fly through the inside of colons. the extraction of a suitable flight-path is necessary to Provide the viewpoint and view direction of a virtual camera. However. manual path extraction by Picking Points is a very time-consuming and difficult task due 1,c, the long and complex shape of colon. Also, existing automatic methods are computationally complex. and tend to generate an improper and/or discontinuous path for complicated regions. In this paper, we propose a fast flight-path generation algorithm using the distance and order maps. The order map Provides all Possible directions of a path. The distance map assigns the Euclidean distance value from each inside voxel to the nearest background voxel. By jointly using these two maps. we can obtain a proper centerline regardless of thickness and curvature of an object. Also, we Propose a simple smoothing technique that guarantees not to collide with the surface of an object. The phantom and real colon data are used for experiments. Experimental results show that for a set of human colon data, the proposed algorithm can provide a smoothened and connected flight-path within a minute on an 800MHz PC. And it is proved that the obtained flight-Path provides successive volume-rendered images satisfactory for virtual navigation.

• Journal of Advanced Navigation Technology
• /
• v.26 no.5
• /
• pp.304-311
• /
• 2022

Although the SEAD(suppression to enemy air defenses) mission is a strategically important task in modern warfare, the high risk of direct exposure to enemy air defense assets forces to use of unmanned aerial vehicles. this paper proposes a path planning algorithm for SEAD mission for an unmanned aerial vehicle and a method for calculating the mission effectiveness on the planned path. Based on the RRT-based path planning algorithm, a low-altitude ingress/egress flight path that can consider the enemy's short-range air defense threat was generated. The Dubins path-based Intercept path planning technique was used to generate a path that is the shortest path while avoiding the enemy's short-range anti-aircraft threat as much as possible. The ingress/intercept/egress paths were connected in order. In addition, mission effectiveness consisting of fuel consumption, the survival probability, the time required to perform the mission, and the target destruction probability was calculated based on the generated path. The proposed techniques were verified through a scenario.

• Journal of Power Electronics
• /
• v.17 no.2
• /
• pp.432-441
• /
• 2017

Grid voltage feedforward is extensively used for controlling grid-connected converters. However, the conventional voltage feedforward control reduces the stability margins of the converter connected to a high-impedance grid. The effect mechanism of voltage feedforward on the grid-connected converter control under high-inductive conditions of the grid impedance is clearly explained in this study using the equivalent transformations of control block diagrams. Results show that the delay produced by the digital control is the root cause of this effect. An improved voltage feedforward strategy, in which a bandpass filter (BPF) is introduced into the feedforward path, is proposed to strengthen the converter's robust stability against grid impedance variations. The selection method of the BPF's bandwidth is also provided considering the tradeoff between the response speed to the grid voltage sag and the system's robust stability. The converter can work stably over a wide range of the grid impedance through the proposed approach. Simulation and experimental results fully verify the effectiveness of the BPF-based voltage feedforward strategy.

• Journal of KIISE
• /
• v.43 no.12
• /
• pp.1420-1427
• /
• 2016

This paper proposes a method taking advantage of Fog computing and SDN in the connected vehicle environment which is having an unstable communication channel and a dynamic topology. For this purpose, the controller should understand the current state of the overall network by maintaining recent network topology, especially, the mobility information of mobile nodes. These are managed by the controller, and are important in unstable conditions in the mobile environment. The mobility levels are divided into 3 categories. We can efficiently exploit that information. By utilizing network state information, we suggest two outcomes. First, we reduce the control message overhead by adjusting the period of beacon messages. Second, we propose a recovery process to prepare the communication failure. We can efficiently recover connection failure through mobility information. Furthermore, we suggest a path recovery by decoupling the cloud level and the fog level in accordance with application data types. The simulation results show that the control message overhead and the connection failure time are decreased by approximately 55% and 5%, respectively in comparison to the existing method.

• Journal of Ecology and Environment
• /
• v.35 no.2
• /
• pp.141-147
• /
• 2012

The rapid urbanization in developing countries is accelerating both the depletion and fragmentation of urban green space, despite the known positive effects of green spaces on the environmental conditions in cities and the quality of life of residents. Consequently, there is a need for practical tools that can support the development of networks of urban green spaces. This article presents a study that used a GIS-based least cost path (LCP) analysis to identify the best alternative for developing an urban green space network in the coastal city of Jakarta, Indonesia, which was based on the evaluation of topography and land use characteristics. Pair-wise analysis was used to reduce the sensitivity in the LCP model. The results showed that the coastal wetlands in the northern part of Jakarta and the agricultural fields in the suburban areas of Jakarta play an important role in connecting the green space network. On the other hand, some green spaces in the central part of Jakarta could not be connected by the LCP model. The method used in this study can serve as a tool to support the identification of networks of potential urban green spaces. It can also provide useful information for sustainable urban landscape planning and management in urban ecosystems. However, the inclusion of socio-economic criteria would further improve the model.

• Journal of Korea Multimedia Society
• /
• v.16 no.7
• /
• pp.897-904
• /
• 2013

The recursive circulant network G(N,d) can be widely used in the design and implementation of parallel processing architectures. It consists of N identical nodes, each node is connected through bidirectional, point-to-point communication channels to different neighbors by jumping $d^i$, where $0{\leq}i{\leq}{\lceil}{\log}_dN{\rceil}$ - 1. In this paper, we investigate the routing of a message on $G(2^m,4)$, a special kind of RCN, that is key to the performance of this network. On $G(2^m,4)$ we would like to transmit k packets from a source node to k destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $1{\leq}k{\leq}m-1$, $0{{\leq}}i{{\leq}}m-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(m^4)$ routing algorithm on $G(2^m,4)$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.34 no.6
• /
• pp.230-237
• /
• 1985

Shortest path calculations for a large-scale network have to be performed using a decomposition techniqre, since the calculations require large memory size which increases by the square of the number of vertices in the network. Also, the calculation time increases by the cube of the number of vertices in the network. In the decomposition technique,the network is broken into a number of smaller size subnetworks for each of which shortest paths are computed. A union of the solutions provides the solution of the original network. In all of the decomposition algirithms developed up to now, boundary vertices which divide all the subnetworks have to be included in computing shortest paths for each subnetwork. In this paper, an improved algorithm is developed to reduce the number of boundary vertices to be engaged. In the algorithm, only those boundary vertices that are directly connected to the subnetwork are engaged. The algorithm is suitable for an application to real time computation using a parallel processor system which consists of a number of micro-computers or prcessors. The algorithm has been applied to a 39- vertex network and a 232-vertex network. The results show that it is efficient and has better performance than any other algorithms. A parallel processor system has been built employing an MZ-80 micro-computer and two Z-80 microprocessor kits. The former is used as a master processor and the latter as slave processors. The algorithm is embedded into the system and proven effective for real-time shortest path computations.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.15 no.6
• /
• pp.770-778
• /
• 2012

In this paper, we propose a multi-path construction scheme to improve the survivability of a multicast session in military hybrid networks. A military hybrid network consists of a static backbone network and multiple mobile stub networks where some nodes are frequently susceptible to be disconnected due to link failure and node mobility. To improve the survivability of multicast sessions, we propose a construction scheme of ${\kappa}$ redundant multi-paths to each receiver. In order to take account of different characteristics of static and mobile networks, we propose quite different multi-path setup approaches for the backbone and stub networks, respectively, and combine them at the boundary point called gateway. We prove that our proposed scheme ensures that each receiver of a multicast session has ${\kappa}$ redundant paths to the common source. Through simulations, we evaluate the performance of the proposed schemes from three aspects : network survivability, recovery cost, and end-to-end delay.

• The Journal of the Korea Contents Association
• /
• v.13 no.11
• /
• pp.924-934
• /
• 2013

Traditional village forests in the Jeju Island represent unique cultural landscape with a history of more than several hundred years as a national cultural asset in Korea. There are 368 Oreums, parasitic volcanoes, and 391 shrines of Dang(Divine place) in Jeju. Currently, the shrines of Dang are damaged by the Jeju Olle trail path and road constructions. It's time for cultural consents to be obtained with locality and globality. And need to produce our own unique contents, glocal cultural contents. In this study, the establishment of trail path of Jeoji Oreum in relation to the Dang in the Jeju Island was investigated. By linking the Dangsan forest to the Jeoji Oreum trail path, it enables the path to contact with traditional cultural landscape. Rural villages in Jeju with the Oreum and Dang are expected to get an international attention as to have traditional cultural landscapes of Korea. It needs to be managed to retain their original form and in connection with the trail path.