• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3B
• /
• pp.224-236
• /
• 2003

MANET(Mobile Ad hoc networks) is a mobile, multi-hop, and wireless network which is bandwidth constrained, energy constrained, resource constrained, autonomous, and self operating systems with dynamic topology. These constraints make the routing between communicating nodes in ad hoc networks difficult. In this paper we survey several routing protocol for mobile ad hoc networks. Especially, we focus on Zone Routing Protocol, hybrid routing framework suitable for a wide of mobile ad hoc networks and analyze performance of ZRP. In the case of ZRP protocol, it is essential that the use of optimal zone radius for efficient use. Otherwise it was proved through an simulation that performance of whole network is rapidly decrease with greatly increasing overhead of ZRP traffic that need for transmission of packet by IARP or IERP traffic. Also we suggest the process of finding QoS path that use in-band signal for QoS routing in ad hoc network. This method guarantees route that make real time multimedia service for QoS enabled path.

• IE interfaces
• /
• v.16 no.4
• /
• pp.450-462
• /
• 2003

In this paper, we deal with a process and layout design for producing a planned amount of Sikhye in a given limited time period under a reasonable production schedule. We represent a Sikhye production line as a vector N, the element of which denotes the number of tanks required in each process and our objective is to find an appropriate vector which minimizes the total investment cost. We suggest a systematic method for finding an appropriate N and an appropriate layout to N. In detail, first, we decide the required sequence of processes and the required operations for each process and we estimate standard operating times. Second, constructing a precedence diagram, we find a critical path in order to reduce the total production lead time for a batch of Sikhye. Third, given a limited N space, we manage to construct manually each production schedule using both the processing times of the critical operations and transfer times. Finally, we find an optimal vector N which gives a minimum investment cost and meets both the time constraint and quantity constraint. In addition, with the estimated relative size of each tank, we suggest an appropriate conceptual layout design including an expansion area for future demands, based on the span technique used in the field of architectural design.

• Journal of Internet Computing and Services
• /
• v.23 no.1
• /
• pp.1-9
• /
• 2022

Recently, interest in living safety and crime prevention is increasing. The reality is that most women have anxiety about social safety and ultimately want a safe return to home. As a result of these issues, the Seoul Metropolitan Government and the National Police Agency are implementing various services to alleviate them. However, there are limitations such as that the service can be used only during a limited time or the process of checking whether the patrol is really completed is complicated. Therefore, in this paper, we propose a service platform that overcomes these limitations and suggests the best and shortest patrol route to the police based on the desired patrol location applied by citizens. It is designed based on the MVC pattern, and the functions are divided for each user. It is hoped that the platform will reduce crime rates and allow citizens to ultimately return home with peace of mind. Also we expect that the police will ablet to find places where they did not know about or need to patrol with more attention through the recommended route of the platform, which will be helpful in their task.

• Journal of Korean Society for Geospatial Information Science
• /
• v.21 no.3
• /
• pp.3-9
• /
• 2013

As interest in green growth picks up, the importance of bicycles which are an environment friendly means of communication has been magnified. However, bicycle routes which are the base of bicycles are designed without considering topographic elements and thus many users are experiencing inconvenience in using bicycles. The present study presents a routing technique to select optimal routes when selecting routes in commuting to school utilizing bicycles. To this end, a formula for optimum route calculation considering slope and intersections was drawn and a method to select optimum routes by applying modified Dijkstra Algorithms was studied. According to the results, the bicycle routes for commuting to school should be selected by the shortest time rather than the shortest distances to the destination, because it required reach the destination faster. Therefore when selecting the routes, it must be based on the shortest time considering waiting time due to crosswalks or crossroads and speed variations due to slopes.

• Journal of Korean Society of Transportation
• /
• v.23 no.7 s.85
• /
• pp.99-110
• /
• 2005

Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.

• Journal of Korean Society of Transportation
• /
• v.23 no.2
• /
• pp.117-130
• /
• 2005

In both deteministic user Optimal Traffic Assignment Model (UOTAM) and stochastic UOTAM, travel time, which is a major ccriterion for traffic loading over transportation network, is defined by the sum of link travel time and turn delay at intersections. In this assignment method, drivers actual route perception processes and choice behaviors, which can become main explanatory factors, are not sufficiently considered: therefore may result in biased traffic loading. Even though there have been some efforts in Stochastic UOTAM for reflecting drivers' route perception cost by assuming cumulative distribution function of link travel time, it has not been fundamental fruitions, but some trials based on the unreasonable assumptions of Probit model of truncated travel time distribution function and Logit model of independency of inter-link congestion. The critical reason why deterministic UOTAM have not been able to reflect route perception cost is that the route perception cost has each different value according to each origin, destination, and path connection the origin and destination. Therefore in order to find the optimum route between OD pair, route enumeration problem that all routes connecting an OD pair must be compared is encountered, and it is the critical reason causing computational failure because uncountable number of path may be enumerated as the scale of transportation network become bigger. The purpose of this study is to propose a method to enable UOTAM to reflect route perception cost without route enumeration between an O-D pair. For this purpose, this study defines a link as a least definition of path. Thus since each link can be treated as a path, in two links searching process of the link label based optimum path algorithm, the route enumeration between OD pair can be reduced the scale of finding optimum path to all links. The computational burden of this method is no more than link label based optimum path algorithm. Each different perception cost is embedded as a quantitative value generated by comparing the sub-path from the origin to the searching link and the searched link.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.4
• /
• pp.35-45
• /
• 2000

The vertex-based boundary encoding scheme is widely used in object-based video coding area and computer graphics due to its scalability with natural looking approximation. Existing single framebased vertex encoding algorithm is not efficient for temporally correlated video sequences because it does not remove temporal redundancy. In the proposed method, a vertex point is selected from not only the boundary points of the current frame but also the vertex points of the previous frame to remove temporal redundancy of shape information in video sequences. The problem of selecting optimal vertex points is modeled as finding shortest path in the directed acyclic graph with weight The boundary is approximated by a polygon which can be encoded with the smallest number of bits for maximum distortion. The temporal redundancy between two successive frames is efficiently removed with the proposed scheme, resulting in lower bit-rate than the conventional algorithms.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2010.11a
• /
• pp.833-837
• /
• 2010

This study aims at finding an optimal exhaust diffuser design of a high altitude testing chamber for a low bypass turbofan engine (F404-402) with thrust pound force of 17,700 and air mass flow rate of 66kg/s ejecting at a speed of Mach 1.66. The final proposed ejector size has better pressure recovery characteristics and targets to reduce operational cost at engine performance testing. Conventional high altitude test chamber layout was adopted and first drawn in two dimensions using Autocad software so as to determine the gas path, the ejector frontal size was then determined from gas dynamics equations considering traditional gas ejection method where both the engine exhaust and cell cooling air are exhausted via the ejector. Modification to a smaller ejector with an alternative secondary cell cooling exhaust port was then performed and modelled in 3D using Solid Works software.

• Journal of Advanced Marine Engineering and Technology
• /
• v.40 no.9
• /
• pp.824-829
• /
• 2016

Passenger casualties in the case of ship accidents have increased because of the increase in size and complexity of current ships (such as cruise ships). Therefore, in recent years, emergency evacuation systems are receiving increased interest so as to ensure the safety of passengers. Currently, there are only basic instructions provided, such as announcements regarding the situation, alarms, and exit signs; however, no guidance toward a proper escape route has yet been provided. To solve this problem, several emergency guiding schemes have been proposed. However, these systems ignore some of the realities of ship accidents and are impractical because various risk factors are not considered. Therefore, this paper proposes an optimal route guiding system based on an $A^*$ algorithm for emergency escape during disaster situations. This system takes into account various possible risk factors. Performance evaluation using computer simulations showed that the proposed scheme is effective and leads to safe escape routes.

• Journal of Korean Society of Transportation
• /
• v.21 no.1
• /
• pp.91-102
• /
• 2003

There are two goals in this paper. The one is development of existing CA(Cellular Automata) model to explain more realistic deceleration process to stop. The other is the application of the updated CA model to forecasting simulation to predict short term link travel time that takes a key rule in finding the shortest path of route guidance system of ITS. Car following theory of CA models don't makes not response to leading vehicle's velocity but gap or distance between leading vehicles and following vehicles. So a following vehicle running at free flow speed must meet steeply sudden deceleration to avoid back collision within unrealistic braking distance. To tackle above unrealistic deceleration rule, “Slow-to-stop” rule is integrated into NaSch model. For application to interrupted traffic flow, this paper applies “Slow-to-stop” rule to both normal traffic light and random traffic light. And vehicle packet method is used to simulate a large-scale network on the desktop. Generally, time series data analysis methods such as neural network, ARIMA, and Kalman filtering are used for short term link travel time prediction that is crucial to find an optimal dynamic shortest path. But those methods have time-lag problems and are hard to capture traffic flow mechanism such as spill over and spill back etc. To address above problems. the CA model built in this study is used for forecasting simulation to predict short term link travel time in Kangnam district network And it's turned out that short term prediction simulation method generates novel results, taking a crack of time lag problems and considering interrupted traffic flow mechanism.