• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.5
• /
• pp.1525-1534
• /
• 2014

In recent years, the passengers are likely to decide their route on impulse due to the development of the integrated public transport system, and real-time information system. Especially, public transport fare integration in Seoul Metropolitan area, 2004 makes them not to have resistance about changing the modes or routes and their route choice is most effected by the degree of congestion. Assignment model have limitations to describe route changes by congestion. In this study, the concept of a link cost function used in road assignment and Effective frequency is introduced to describe the passengers' behavior when the capacity of public transport is over and the waiting time variation. Two situations, new transit line operation and accident, are set up to validate the model, as a result of the transit assignment by this model, the traffic on networks is not over the capacity. It is expected that this study will be of help to reflect the various behaviors in transit assignments.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.4
• /
• pp.719-728
• /
• 1997

In the AGV routing a vehicle can select the shortest route on which no conflicts are anticipated. The procedure includes time constraint and the node/arc occupation times of vehicles in order to locate the conflicting paths. The slight differences among AGV routing algorithms exist in identifying the conflict regions encountered while reaching out to the destination node. In this paper, a novel approach to the use of the re-routing scheme is presented. It will be used to minimize the travel distance of vehicles in a regular vehicle routing process rather than to cope with emergency situations. The proposed algorithm provides existing active vehicles with the ability of changing their current paths for a new vehicle whenever the equal-distance paths exist, in on attempt to optimize the AGV transportation system. This ability is possible because of the flexibility of on AGV system controlled by a computer system.

• Proceedings of the Korean Institute of Interior Design Conference
• /
• 2007.05a
• /
• pp.105-109
• /
• 2007

Aging society appears immediate social problem in Korea. Housing for aging is required independent and comfortable housing life to live considering about feature of elderly. It is necessary field to prepare. Aged person who suffers the aging process several stages gets changing weak, so living environment is important aging person aspect of social, psychological and physical point. Finally, aged person living together requires facilities for the naturally communicating and active things. Community of aged person required organization of space for keeping independence and connection with each other. According to space of community, housing for aging should have a different access route. In conclusion, congregate housing of the elderly should be planed organization of space to be solved anxiety and tension and to be aware of joining the community.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.202-214
• /
• 2003

The central challenge in the design of ad-hoc networks is the development of dynamic routing protocol that efficiently finds route between mobile nodes. Several routing protocols such as DSR, AODV and DSDV have been proposed in the literature to facilitate communication in such dynamically changing network topology. In this paper, a Node Transition Probability (NTP) based routing algorithm, which determines stable routes using the received power from all other neighboring nodes is proposed. NTP based routing algorithm is designed and implemented using Global Mobile Simulator (GloMoSim), a scalable network simulator. The performance of this routing algorithm is studied for various mobility models and throughput, control overhead, average end-to-end delay, and percentage of packet dropped are compared with the existing routing protocols. This algorithm shows acceptable performance under all mobility conditions. The results show that this algorithm maximizes the bandwidth utilization during heavy traffic with lesser overhead.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.10
• /
• pp.1079-1083
• /
• 2014

In this paper, a new zone radius determination algorithm is proposed for a nature-inspired routing protocol that emulates the foraging behavior of bees based on their ability to find an optimal route from nectar sites. Instead of changing the radius of nodes one-hop by one-hop, the proposed algorithm alters the radius of nodes as gaps of another radius and adapt quickly to network conditions. The simulation results show that the proposed algorithm has higher efficiency compared with existing studies in an aspect of computational complexity and end-to-end delay.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1839-1842
• /
• 2002

Ad hoc networks are characterized by multi- hop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. In this paper, we proposed a new technique to adjust the zone radius by concentrating the changes of network traffic in a particular direction, which we refer to as AZRP. We demonstrate that even though ZRP and AZRP share a similar hybrid routing behavior, the differences in the protocol mechanics can lead to significant performance differentials. We discuss the algorithm and report on the performance of AZRP scheme, and compare it to the ZRP routing protocol. Our results indicate clearly that AZRP outperforms ZRP by reducing significantly the number of route query messages. And thereby increases the efficiency of the network load.

• Journal of Auto-vehicle Safety Association
• /
• v.13 no.4
• /
• pp.114-122
• /
• 2021

In this paper, an automated vehicle intersection collision accident was analyzed through simulation. Recently, the more automated vehicles are distributed, the more accidents related to automated vehicles occur. Accidents may show different trends depending on the sensor characteristics of the automated vehicle and the performance of the accident prevention system. Based on NASS-CDS (National Automotive Sampling System-Crashworthiness Data System) and TAAS (Traffic Accident Analysis System), four scenarios are derived and simulations are performed. Automated vehicles are applied with a virtual system consisting of an autonomous emergency braking system and algorithms that predict the route and avoid collisions. The simulations are conducted by changing the sensor angle, vehicle speed, the range of the sensor and vehicle speed range. A range of variables considered vehicle collision were derived from the simulation.

• Journal of the Architectural Institute of Korea Planning & Design
• /
• v.36 no.1
• /
• pp.15-26
• /
• 2020

The purpose of this study is to develop every possible real-time evacuation scenarios for large-scale buildings which considering continuously changing conditions during the events. From the review of the previous studies on smartphone-based real-time evacuation systems, this study proposed the customized egress scenarios. The scenario considered the characteristics of facilities, disaster types, and individual factors of evacuees. This study verified the proposed process for real-time evacuation scenarios by applying the several actual fire cases happened recently in Korea. Based on the result of this research, necessary technologies for the real-time evacuation systems are identified and can be applied to develop the more effective evacuation system.

• Journal of Digital Contents Society
• /
• v.14 no.4
• /
• pp.429-437
• /
• 2013

Recently, wireless mesh network has been focused as a core technology for resolving the issues of shadow zone and distributed bypass route as it has broad service coverage as well as good scalability features. It, however, provides users with relatively lower QoS than infrastructure-based networks. In order for addressing this QoS issue and also enhancing the routing performance of mobile WiMax mesh network, this paper proposes a load sensing QoS routing (LSQR) scheme. In the proposed LSQR, each node figures out network congestion status and selects a bypass route accordingly. With this scheme, we can expect good load balancing effect by changing the routing paths from centralized links to distributed links under a heavy traffic condition. From the simulation results using NS-2, it has been verified that the LSQR shows lower packet loss rates and data transmission delays than the existing representative routing schemes.

• Journal of Korean Society of Transportation
• /
• v.23 no.8 s.86
• /
• pp.171-179
• /
• 2005

This paper presents the algorithm using fuzzy inference that preestimates each link speed changed by different kinds of road situations. The elements we are considered are time zone, rainfall probability information and lane control information. This paper is consists of three parts. First of all we set up the fuzzy variables, and preestimate link speed changed by various road situations. For this process, we build the membership functions for each fuzzy variable and establish the fuzzy inference relations to find how fuzzy variables influence on link speed. Second, using backtracking method, we search the shortest route influenced by link speed changed by fuzzy inference. Third, we apply this algorithm to hypothetical network and find the shortest path. As a result, it is shown that this algorithm choose appropriate roundabout path according to the changing road situations.