• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.3
• /
• pp.332-337
• /
• 2016

The rapid reconstruction of a transfer path is caused by frequent secession of nodes in many applications using overlay multicast. For this, however, many studies have been proposed, but a study of fast path recovery is required. This paper proposes a new method for fast path recovery to improve the path reconstruction time and for stable path maintain caused by the sudden secession of the parent node on overlay multicast. The proposed method uses the virtual transfer path and the candidate parent node for the fast path recovery. All nodes exchange periodically the RTT (Round Trip Time) information between the other nodes of similar position itself and neighboring node. All nodes have a candidate parent node list, and each node stores the exchanged RTT information on the list. Each node constructs the virtual transfer path to reduce the recovery time after deciding a candidate parent node that is one of them by the RTT order. In this way, when the parent node is seceded, all nodes can recover the transfer path quickly using the virtual transfer path. The simulation result showed that the recovery time of the proposed method is an average 30% faster than the known method.

• Communications for Statistical Applications and Methods
• /
• v.4 no.2
• /
• pp.515-522
• /
• 1997

In this paper, we find the second derivative of mean busy cycle with respect to a parameter of inter-arrival time distribution. We show that this derivative can be estimated from single sample path. We do the similar thing for the mean number of arrivals during busy cycle.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.23 no.6
• /
• pp.661-668
• /
• 2017

The purpose of this study is to analyze the chemical reaction pathway for explosion accident of mixed cargo. The analysis used a structural scenario using event-tree analysis. Structural scenarios were constructed by estimating various chemical reaction paths in the content of the mixed cargo accident recorded in the written verdict. The analytical method was applied to three kinds of analysis: chemical analysis based on chemical theory, quantitative analysis using chemical reaction formula, and probabilistic analysis through questionnaire. As a result of analysis, the main pathway of the accident occurred in three ways: the path of explosion due to the reaction of concentrated sulfuric acid with water, the path of explosion due to the reaction of metal and mixed acid, and the path of explosion by synthesizing with special substances. This result is similar to the path recorded in the validation, and it leads to thar the proposed path analysis method is valid. The proposed method is expected to be applicable to chemical reaction path estimation of various chemical accidents.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.5
• /
• pp.688-693
• /
• 2022

In this paper, channel propagation path loss was measured in building corridors for frequency bands of 3.7 GHz and 28 GHz, which are used in 5G mobile communication, and compared and analyzed with CI (Close-In) and FI (Floating-Intercept) channel models. To measure the propagation path loss, the measurement was performed while moving the receiver (Rx) from the transmitter (Tx) by 10 m. As a result of the measurement, the PLE (Path Loss Exponent) values of the CI model at 3.7 GHz and 28 GHz were 1.5293 and 1.7795, respectively, and the standard deviations were analyzed as 9.1606 and 8.5803, respectively. In the FI model, 𝛼 values were 79.5269 and 70.2012, 𝛽 values were -0.6082 and 1.2517, respectively, and the standard deviations were 5.8113 and 4.4810, respectively. In the analysis results through the CI model and the FI model, the standard deviation of the FI model is smaller than that of the CI model, so it can be seen that the FI model is similar to the actual measurement result.

• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.5
• /
• pp.178-185
• /
• 2008

This paper proposes a new handover scheme to minimize handover delay and signaling costs, using the fact that a new packet forwarding path could be same or similar to the old one in Mobile IPv4. In the proposed scheme a foreign agent estimates the correlation between the new and old routing paths by using routing costs after receiving a registration request message from a mobile node. If the new packet forwarding path could be same or similar to the old one, the mobile node can receive packets from its old foreign agent without registering its new location with its home agent or correspondent node. The performance analysis shows that the proposed scheme can efficiently reduce handover delay and signaling costs.

• Journal of Digital Contents Society
• /
• v.8 no.4
• /
• pp.459-465
• /
• 2007

In this paper, we implemented a ray-tracing simulator with a ray-launching technique and generated the propagation path of each ray in a multiple-wall indoor environment. In this simulator, we adopted two dimension ray-tracing techniques considering the reflection and penetration were dominant propagation factor in the indoor channel. From the result, we verified that this ray-tracing simulator shows the similar path pattern and delay distribution with the experiment results of the previous research. Especially, impulse responses of the ray were corresponding to reference result in non-line of sight of multiple-wall indoor environment. Furthermore, we confirmed that channel profiles having respectively different departure angle 1 degree to 7 degree were similar between them.

• Journal of Korea Multimedia Society
• /
• v.24 no.2
• /
• pp.312-319
• /
• 2021

This study aims to help users to have a more satisfying encounter based on the problems found by comparing and analyzing similar applications. That is, an application that derives intermediate points through the subway, which is a public transportation means, and provides information on nearby convenience facilities was proposed. The middle point calculation process uses the dijkstra algorithm, which stores the minimum number of nodes in the stored path from the first input location to the last location. The stack and arraylist are used to search all paths from the first input position to the last position, and then the path with the smallest number of nodes is selected. After that, the number of stations in the route is divided in half and the resulting station is output. In addition, this study provides information on convenience facilities near intermediate points in order to have differences from similar applications. It categorizes within a 1km radius of the point and provides a function that helps to conveniently identify only facilities around the middle point. In particular, by visualizing the number of convenience facilities with radar charts and numbers, it is possible to grasp the commercial district around the midpoint at a glance.

• Restorative Dentistry and Endodontics
• /
• v.42 no.4
• /
• pp.316-323
• /
• 2017

Objectives: This study compared the amount of apically extruded bacteria during the glide-path preparation by using multi-file and single-file glide-path establishing nickel-titanium (NiTi) rotary systems. Materials and Methods: Sixty mandibular first molar teeth were used to prepare the test apparatus. They were decoronated, blocked into glass vials, sterilized in ethylene oxide gas, infected with a pure culture of Enterococcus faecalis, randomly assigned to 5 experimental groups, and then prepared using manual stainless-steel files (group KF) and glide-path establishing NiTi rotary files (group PF with PathFiles, group GF with G-Files, group PG with ProGlider, and group OG with One G). At the end of canal preparation, 0.01 mL NaCl solution was taken from the experimental vials. The suspension was plated on brain heart infusion agar and colonies of bacteria were counted, and the results were given as number of colony-forming units (CFU). Results: The manual instrumentation technique tested in group KF extruded the highest number of bacteria compared to the other 4 groups (p < 0.05). The 4 groups using rotary glide-path establishing instruments extruded similar amounts of bacteria. Conclusions: All glide-path establishment instrument systems tested caused a measurable apical extrusion of bacteria. The manual glide-path preparation showed the highest number of bacteria extruded compared to the other NiTi glide-path establishing instruments.

• Journal of Internet Computing and Services
• /
• v.11 no.4
• /
• pp.33-39
• /
• 2010

In this paper, a data dissemination protocol that transmits data collected for Wireless Sensor Networks (WSNs) is newly proposed, and the proposed proactive protocol takes into account energy consumption minimized and delay time disseminated. The well-known SPMS (Shortest Path Mined SPIN) forms the shortest path-based routing table obtained by Bellman Ford Algorithm (BFA) and disseminates data using a multi-hop path in order to minimize energy consumption. The mentioned properties of SPMS cause memory burden to create and maintain the routing tables. In addition, whenever BFA is executed, it is necessary to suffer from the energy consumption and traffic occurred. In order to overcome this problem, a proactive dissemination protocol using Residual Energy and Signal Strength, called RESS, is proposed in this paper. Simulation results show that RESS outperforms SPMS up to 84% in terms of the number of traffic messages and the transmitted delay time of RESS is similar to that of SPMS using the shortest path.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.430-448
• /
• 2001

In navigation system, a primary task is to compute the minimum cost route from the current location to the destination. One of major problems for navigation systems is that a significant amount of computation time is required when the digital road map is large. Since navigation systems are real time systems, it is critical that the path be computed while satisfying a time constraint. In this paper, we have developed a HiTi(Hierarchical MulTi) graph model for hierarchically structuring large digital road maps to speedup the minimum cost path computation. We propose a new shortest path algorithm named SPAH, which utilizes HiTi graph model of a digital road map for its computation. We prove that the shortest path computed by SPAH is the optimal. Our performance analysis of SPAH also showed that it significantly reduces the computation time over exiting methods. We present an in-depth experimental analysis of HiTi graph method by comparing it with other similar works.