• The KIPS Transactions:PartC
• /
• v.15C no.3
• /
• pp.213-220
• /
• 2008

A MANET is an autonomous, infrastructureless system that consists of mobile nodes. In MANET, on-demand routing protocols are usually used because network topology changes frequently. The current approach in case of broken routes is to flag an error and re-initiate route discovery either at the source or at the intermediate node. Repairing these broken links is a costly affair in terms of routing overhead and delay involved. Therefore, this paper propose a NAODV(Neighbor-aware AODV) protocol that stands on the basis of an AODV. It sets up the route rapidly if it operates for setting the route directly by using sequence number of neighbor nodes without re-search the route when the route to destination node is broken. Also, it reduces loss of packets. We use NS-2 for the computer simulation and validate that the proposed scheme is better than general AODV in terms of packet delivery ratio and average end-to-end delay. Also, when the proposed protocol is applied to the large ad-hoc network with multiple nodes, the performance is more efficient.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.23 no.2
• /
• pp.117-128
• /
• 2005

This study presented the route location method by applying AHP and evaluating quantitatively. This study developed the program that can be easily applied to this kind of road design, and built the decision support system fur route location. The study results are summarized as follows : We could quantitatively evaluate the appropriateness of exiting routes by applying the AHP based on GIS. If we apply this to the roads that will be newly constructed, we can make the objective and reliable route location when making road plans and basic designs. We improved the technique of route location by applying the decision support system with third-dimensional data, which considers even the vertical alignment plan, to the existing decision support system with second-dimensional data. had, since we call set those data such as vertical slope, earth-volume, structure size, location and construction cost to independent variables, we can make road designs more scientifically and reasonably.

• International conference on construction engineering and project management
• /
• 2020.12a
• /
• pp.510-519
• /
• 2020

Within an intelligent automated cyber-physical system, the realization of the autonomous mechanism for data collection, data integration, and data analysis plays a critical role in the design, development, operation, and maintenance of such a system. This construct is particularly vital for fault-tolerant route-finding systems that rely on the imprecise GPS location of the vehicles to properly operate, timely plan, and continuously produce informative feedback to the user. More essentially, the integration of digital twins with cyber-physical route-finding systems has been overlooked in intelligent transportation services with the capacity to construct the network routes solely from the locations of the operating vehicles. To address this limitation, the present study proposes a conceptual architecture that employs digital twin to autonomously maintain, update, and manage intelligent transportation systems. This virtual management simulation can improve the accuracy of time-of-arrival prediction based on auto-generated routes on which the vehicle's real-time location is mapped. To that end, first, an intelligent transportation system was developed based on two primary mechanisms: 1) an automated route finding process in which predictive data-driven models (i.e., regularized least-squares regression) can elicit the geometry and direction of the routes of the transportation network from the cloud of geotagged data points of the operating vehicles and 2) an intelligent mapping process capable of accurately locating the vehicles on the map whereby their arrival times to any point on the route can be estimated. Afterward, the digital representations of the physical entities (i.e., vehicles and routes) were simulated based on the auto-generated routes and the vehicles' locations in near-real-time. Finally, the feasibility and usability of the presented conceptual framework were evaluated through the comparison between the primary characteristics of the physical entities with their digital representations. The proposed architecture can be used by the vehicle-tracking applications dependent on geotagged data for digital mapping and location tracking of vehicles under a systematic comparison and simulation cyber-physical system.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.591-595
• /
• 1998

This paper proposes a new concept of optimal shortest path algorithm which reduce average vehicle wating time and improve average vehicle speed, Electro sensitive traffic system can extend the traffic cycle when three are many vehicles on the road or it can reduce the traffic cycle when there are small vehicles on the road. But electro sensitive traffic light system doesn't control that kind of function when the average vehicle speed is 10km -20km. Therefore, in this paper to reduce vehicle waiting time we developed design of traffic cycle software tool that can arrive destinination as soon as possible using optimal shortest pass algorithm. Computer simulation result proved 10%-32% reducing average vehicle wating time and average vehicle speed which can select shortest route using built in G.P.S. vehicle is better than not being able to select shortest route function.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10c
• /
• pp.56-61
• /
• 2006

최근 공간 네트워크 데이터베이스를 위한 질의처리 알고리즘에 관한 연구가 많이 진행되어 왔다. 그러나 현재 좌표-기반 질의에 대한 연구는 활발히 진행중인 반면, 경로-기반 질의에 대한 연구는 매우 미흡한 실정이다. 공간 네트워크 데이터베이스에서는 이동객체가 공간 네트워크상에서만 이동하기 때문에 경로-기반 질의의 유용성이 매우 증대되므로, 경로-기반 질의에 대한 효율적인 질의처리 알고리즘 연구가 필수적이다. 따라서 본 논문에서는 경로-기반 질의의 대표적인 방법인 In-Route Nearest Neighbor 질의처리 알고리즘을 분석하여 기존 연구에서 고려하지 않은 시간 및 공간제약을 고려한 경로-기반 질의처리 알고리즘을 설계한다.

• Journal of Korean Society of Transportation
• /
• v.26 no.5
• /
• pp.185-194
• /
• 2008

The objective of this paper is to design the dynamic route guidance system(DRGS) and develop an ant algorithm based on routing mechanism for finding the multiple shortest paths within limited time in real traffic network. The proposed ant algorithm finds a collection of paths between source and destination considering turn-restrictions, U-turn, and P-turn until an acceptable solution is reached. This method can consider traffic constraints easily comparing to the conventional shortest paths algorithms.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.70-73
• /
• 2004

We have developed an optimization algorithm based formulation for performing efficient time driven simultaneous place and route for FPGAs. Field programmable gate array (FPGAs) provide of drastically reducing the turn-around time for digital ICs, with a relatively small degradation in performance. For a variety of application specific integrated circuit application, where time-to-market is most critical and the performance requirement do not mandate a custom or semicustom approach, FPGAs are an increasingly popular alternative. This has prompted a substantial amount of specialized synthesis and layout research focused on maximizing density, minimizing delay, and minimizing design time.

• Journal of the Korean Society for Railway
• /
• v.7 no.3
• /
• pp.215-222
• /
• 2004

Optimal route selection of railway should take consideration of the function of the railway, topography, practicability of construction and management as well as the cost. This study performed the surveys for experts and surrounding industries and the review for the bid guidelines in order to develop the quality model with the AHP method and establish the weight for each factor. Six quality models were developed for such as the efficiency of railway operation, structure design and practicability, economic feasibility, correspondence with other plans, civil appeal and environmental sustainability, and correspondence with system. The detailed evaluation elements were also derived by each factors.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.5
• /
• pp.45-54
• /
• 2011

Currently various applications related to bus route are used on smart devices to obtain bus arrival times, and route information. However, applications are unable to provide various ways for users to provide their destination. This study has designed an algorithm based on user's six patterns. An Android application and a server that communicate with each other have been based on the algorithm. The applications and the server use the Google Maps service and location-based information to provide users with possible routes from the starting place to the destination. They also provide user's with users' current position and any transfer information. They provide practical and efficient information, and are easy to use.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.849-864
• /
• 2010

This paper proposes a multipath routing protocol called cross-layer multipath AODV (CM-AODV) for wireless ad hoc networks, which selects multiple routes on demand based on the signal-to-interference plus noise ratio (SINR) measured at the physical layer. Note that AODV (Ad hoc On-demand Distance Vector) is one of the most popular routing protocols for mobile ad hoc networks. Each time a route request (RREQ) message is forwarded hop by hop, each forwarding node updates the route quality which is defined as the minimum SINR of serialized links in a route and is contained in the RREQ header. While achieving robust packet delivery, the proposed CM-AODV is amenable to immediate implementation using existing technology by neither defining additional packet types nor increasing packet length. Compared to the conventional multipath version of AODV (which is called AOMDV), CM-AODV assigns the construction of multiple paths to the destination node and makes it algorithmically simple, resulting in the improved performance of packet delivery and the less overhead incurred at intermediate nodes. Our performance study shows that CM-AODV significantly outperforms AOMDV in terms of packet delivery ratio and average end-to-end delay, and results in less routing overhead.