• Communications for Statistical Applications and Methods
• /
• v.10 no.3
• /
• pp.795-804
• /
• 2003

In this article, a tomography for the estimation of the origin-destination(OD) traffic intensities in dynamic routing network is considered. Vardi(1996)'s approach based on fixed route is not directly applicable to dynamic routing protocols, which arises from the fact that we cannot access the route at every observation time. While it uses link-wise traffics as the observations, the proposed method considers the triple of ingress/outgress/relayed traffics data at each node so that we can transform the problem into a routing-independent tomography. An EM algorithm for implementation and some simulated experiments are provided.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2019.05a
• /
• pp.38-39
• /
• 2019

Optimal route planning is the route planning to minimize voyage time or fuel consumption in a given ocean environment. Unlike the previous studies on weather routing, this study proposes an optimization method for the route planning to avoid the grounding risk in the coast. The route way-points were searched using Dijkstra algorithm, and then the optimization was performed to minimize fuel consumption by setting the optimization design parameter to the engine rpm. To set the engine rpm, a method to use the fixed rpm from the departure point to the destination point, and a method to use the rpm for each section by dividing the route were used. The ocean environmental factors considered for route planning were wind, wave, and current, and the depth information was utilized to compute grounding risk. The proposed method was applied to the ship passing between Mokpo and Jeju, and then it was confirmed that fuel consumption was reduced by comparing the optimum route and the past navigated route.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.336-346
• /
• 2001

A wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastnlcture or centralized administration. Currently, numerous routing protocols have been developed for changing messages between nodes in a wireless ad-hoc network. Applications of wireless ad-hoc network technology are various and proper routing protocol must be used according to application domain or network size. In a wireless ad-hoc network. some hosts want services from fixed networks. For supporting such services, it is necessary to interconnect wireless ad-hoc networks and fixed networks. The DSMIHDynamic Source Multipath Routing) protocol, proposed in this paper, focuses on supporting seamless communication services between the nodes within a wireless ad-hoc network and providing fixed networks to the mobile hosts in wireless an-hoc networks. In DSMR protocol, each node need not broadcast routing messages periodically. and mobile hosts that to send data packets initiate route request and route establishment procedure. By maintaining multiple paths in each node. faster route re-establishment is also possible in our scheme.

• 한국연소학회:학술대회논문집
• /
• 2014.11a
• /
• pp.29-32
• /
• 2014

The practical route for disposal of sewage sludge becomes energy recovery by combustion after its ocean dumping is banned in 2012 in Korea. Due to the high moisture content, however, sewage sludge is required to be dried before transport and combustion. In this study, pyrolysis and combustion characteristics of dried sewage sludge was investigated in a small-scale fixed bed reactor in order to provide fundamental data for energy recovery of the fuel. As the first step of combustion, the primary products of pyrolysis were analyzed in a fixed bed reactor for the condensable volatiles (tar), non-condensable gases, and char. For the combustion characteristics, another fixed bed reactor was constructed to monitor the weight and temperature of the fuel particles during ignition and combustion under different air flow rates. The test results were used to derive the ignition and burning rates.

• Korean Journal of Hazardous Materials
• /
• v.3 no.1
• /
• pp.28-36
• /
• 2015

In early 2011, the Fukushima nuclear power plant had greater damage due to earthquake in Japan, and the awareness of safety has increased. In particular, special response systems should be required to handle disaster situations in plant sites which are likely to occur for large disasters. In this study, a program is designed to set up optimum escape routes, by a smart phone application, when a disaster situation occurs. This program could get information of the cumulative damage from sensors and display the escape route of the smallest damage in real-time on the screen. Utilizing our application in real-time evacuation has advantage in reducing cumulative damage. The optimal evacuation route, focusing on horizontal path, is calculated based on getting the data of fire, detected radioactivity and hazardous gas. Thus, using our application provides information of optimal evacuation to people who even can not hear sensor alarms or do not know geography, without requiring additional costs except fixed sensors or server network deployment cost. As a result, being informed of real-time escape route, the user could behave rapidly with suitable response to individual situation resulting in improved evacuation than simply reacting to existing warning alarms.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.2726-2730
• /
• 2011

This paper proposes a CBTC wayside signaling system, which redeems existing track-circuit-based ones by using movement authorities mixed with logical block and moving block. Only one train can be entered into the logical block or the route for existing wayside signaling system. Applying moving block for CBTC system enables the train to get nearer to the preceding one, because its protection mechanism uses train's safe boundary, not fixed block unit. By narrowing the existing route set to switch machine and applying the moving block beyond that area, more than one train can enter into one route area. This paper shows that the efficient train control, i.e. shortening the headway, is possible using the moving block mixed with logical block in wayside signaling system.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.9
• /
• pp.65-72
• /
• 2016

Vehicle and marine navigation which are currently being commercialized provide route guidance service by specifying a fixed position as a destination. In the route guidance service of existing navigation, if the destination has to be changed in the middle, a new destination must be designated again to obtain the navigation service. However, if the destination can't be designated, it is difficult to clearly use it. In this paper, in order to overcome the difficulties of directions in the existing navigation, a new navigation specifying moving targets as the destination has been developed to get the directions. A proposed system is that a group is made and a group manager is appointed as a destination and then a user can get the route guidance based on location of the group manager. In the service way, relationship between the group manager and user is one-to-many and relationship between the user and group manager is one-to-one. The proposed technology is able to provide services that the user can easily find the moving targets such as the positioning surrogate drivers, tracking routes and location among travelers and finding children.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.447-454
• /
• 2006

An ad-hoc network routing protocol, AODV(Ad-hoc On-demand Distance Vector) initially uses ERS(Expanding Ring Search) algorithm to control the RREQ(Route Request) retransmission in the route discovery process. Because ERS uses the fixed NTT(Node Travesal Time), it does not reflect accurately ad-hoc network environment. In this paper, we propose an improved ERS algorithm which lowers the retransmission rate. It uses RREP(Route Reply) and gives different weights in NTT of each node in accordance with the adjacency to an originating node. To show the effectiveness of the proposed algorithm, we perform a simulation using ns2. The simulation results showed that the proposed algorithm has better performance than existing algorithms.

• Journal of Information Processing Systems
• /
• v.17 no.5
• /
• pp.879-891
• /
• 2021

With improvements in living conditions, an increasing number of people are choosing to spend their time traveling. Comfortable tour routes are affected by the season, time, and other local factors. In this paper, the influencing factors and principles of scenic spots are analyzed, a model used to find the available routes is built, and a multi-route choice model based on a game theory utilizing a path recommendation weight is developed. A Monte Carlo analysis of a tourist route subjected to fixed access point conditions is applied to account for uncertainties such as the season, start time, end time, stay time, number of scenic spots, destination, and start point. We use the Dijkstra method to obtain multiple path plans and calculate the path evaluation score using the Monte Carlo method. Finally, according to the user preference in the input path, game theory generates path ordering for user choice. The proposed approach achieves a state-of-the-art performance at the pseudo-imperial palace. Compared with other methods, the proposed method can avoid congestion and reduce the time cost.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.593-603
• /
• 2000

In this paper, a dynamic route control scheme to increase speed of data communication over public network is presented. And a new structure of gateway which is suitable for the public network environments is proposed and analyzed. For dynamic allocation of transmission routing resources of the gateway and improvement of call processing ratio of the system, virtual queue is used. As results, route utilization ratio of the proposed scheme can be improved up to 60% as compared to the conventional fixed route control scheme. For the case of limited number of routes, it provides high speed data communication while maintaining delay time as low as possible. In addition, as the allocation period at call access node can be varied with the traffic in the proposed scheme, various traffics can be applied easily. Thus, it can be expected that the presented dynamic route control gateway may be suitable for application in high speed data communication over public network.