• International Journal of Contents
• /
• v.8 no.1
• /
• pp.55-60
• /
• 2012

Most Korean and overseas major portal sites include map servers to provide map services, and offer open APIs to allow their users to make use of maps or spatial information directly. At the early design stage, geographic spatial data do not tend to require high accuracy, and thus there would be no problem using data which have been obtained and then utilized through map servers provided by portal sites. This study has chosen the shortest route between starting point and destination, using GIS techniques. Moreover, for the chosen route, it also has calculated the elevation for the cross-section, using Google map and GPS measurements. This study aims to create APIs, which can extract vertical profile of routes from the Google Map server, by using JAVA, and to compare centerline profile results obtained by GPS(Global Positioning System) to explore their utilize abilities. The result demonstrated a height error of 0.5 to 1 m, compared to the GPS results, but they were mutually satisfactory. In short, the data extracted in this study are useful for centerline profile drawings in selecting routes, such as streets, Olle roads, and bike lanes.

• Journal of the Korean Geographical Society
• /
• v.43 no.4
• /
• pp.544-560
• /
• 2008

This study seeks to clarify the background and factors for the expansion of bus networks that connect Incheon International Airport with its hinterlands. For this research objective, this paper analyzes the relationships among the change of bus routes, competitive transportation modes, passenger fares, and the shortest time distance. Previously, the hinterlands of route bus networks that connect Gimpo International Airport were Seoul metropolitan area, Chungcheong region, Jeonju and Iksan in Jeollabuk-do(province). However, the opening of Incheon International Airport resulted in the expansion of the hinterlands of bus networks to Gangwon-do, Gwangju, and major cities in Youngnam region. Simultaneously, route bus networks also expanded in Seoul metropolitan area. Each bus route connecting Incheon International Airport with its hinterlands was opened by a single bus company or various bus companies. In many cases, due to the uncertainty of revenues or bus company's regional ties, a bus route was opened by various bus companies. In this paper, the analysis of the number of one-way route bus service and density of flight passengers shows that the frequency of the route bus service for Seoul except Gangseo-gu(ward) and for Seoul's satellite cities(Suwon, Seongnam, Anyang, Gunpo, Guri, and Osan) should be decreased. The analysis also shows that the frequency of the route bus services for the other cities, counties(Guns), and wards(gus) should be increased. In Seoul metropolitan area, although route bus fares are more expensive than subway fares, passengers use route bus more frequency than subway because time distance of route bus is shorter than that of subway and subway transfer is inconvenient. In general, outside Seoul metropolitan area, air flight is preferred in the regions that have airports. In contrast, the route bus is preferred in Daegu and other regions that do not have airports.

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.1
• /
• pp.69-80
• /
• 2016

Some studies were conducted for the purpose of minimizing total clearance time for rapid evacuation from the indoor spaces when disaster occurs. Most studies took a long time to calculate the optimal evacuation route that derived minimum evacuation time. For this reason, this study proposes an evacuation route assignment algorithm that can shorten the total clearance time in a short operational time. When lots of exits are in the building, this algorithm can shorten the total clearance time by assigning the appropriate pedestrian traffic volume to each exit and balances each exit-load. The graph theory and greedy algorithm were utilized to assign pedestrian traffic volume to each exit in this study. To verify this algorithm, study used a cellular automata-based evacuation simulator and experimented various occupants distribution in a building structure. As a result, the total clearance time is reduced by using this algorithm, compared to the case of evacuating occupants to the exit within shortest distance. And it was confirmed that the operation takes a short time In a large building structure.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.1
• /
• pp.35-42
• /
• 2013

This paper shows the positivistic approach for analyzing the effect of ICT on the reduction of greenhouse gas (GHG) emission. The real-time navigation was selected for the ICT based service in this research, and the CO2 reduction ratios of the optimized routes in the navigation were compared with the reduction ratios of the shortest routes in existing navigations. The results of experiments showed the driving based on the optimized routes has more reduction effects than the driving on the basis of the shortest routes. Also, new evaluation method for GHG emission was suggested by the quantification and monitoring approaches on the basis of the Clean Development Mechanism (CDM) in this paper. The results of this paper can be used as a preliminary research for the effect of ICT on the reduction of GHG emission. The evaluation method which suggested in this paper will be suggested to CDM as the new standard for the reduction of GHG emission in the transportation field as well.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.3
• /
• pp.72-86
• /
• 2018

Schedule-based public transit routing algorithm computes a single route that calculated minimum travel time using the departure and arrival times for each stop according to vehicle operation plan. However, additional factors such as transfer resistance and alternative route choice are not reflected in the path finding process. Therefore, this paper proposes a improved RAPTOR that reflected transfer resistance and multi-path searching. Transfer resistance is applied at the time of transfer and different values can be set according to type of transit mode. In this study, we analyzed the algorithm's before and after results compared with actual route of passengers. It is confirmed that the proposed algorithm reflects the various route selection criteria of passengers.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.7 no.3
• /
• pp.105-116
• /
• 1997

Routing security is related to the confidentiality of the route taken by the data transmitted over the network. If the route is detected by the adversary, the probability is higher that the data are lost or the data can be intercepted by the adversary. Therefore, the route must be protected. To accomplish this, we select an intermediate node secretly and transmit the data using this intermediate node, instead of sending the data to the destination node using the shortest path. Furthermore, if we use a number of secret routes from the starting node to the destination node, data security is much stronger since we can transmit partial data rather than the entire data along a secret route. In this paper, the routing algorithm for multiple secret paths on MRNS(Mixed Radix Number System) Network, which requires O(1) for the time complexity where is the number of links on a node, is presented employing the HCLS(Hamiltonian Circuit Latin Square) and is analyzed in terms of entropy.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.6
• /
• pp.1221-1228
• /
• 2022

With the development of modern technology, the use of unmanned automation equipment that can replace humans in logistics and industrial sites is increasing. The technology of one such automation facility, the Unmanned Carrier (AGV), includes Line Tracing, which allows you to recognize a line through infrared sensors and drive a predetermined route. In this paper, the shortest time algorithm using Arduino is configured in the line tracing technology to enable efficient driving. It is also designed to collect location and time information using RFID tags.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.543-550
• /
• 2005

Many routing algorithms, proposed for ad-hoc wireless networks, we based on source routing scheme and shortest path route has short lifetime especially in highly dense ad-hoc wireless networks. So some routing protocols such as SSA and ABR are considering the link stability and try finding more stable route. In this paper we propose a new routing algorithm considering utilization metric based on SSA routing algerian in Ad-Hoc networks. To reduce the bottleneck by specific metric of SSA, proposed scheme makes load balancing in networks by distributing the connections to several routes. For the evaluation of the performance we compare our scheme with existent routing protocol AODV and SSA. And the results, obtained using the ns-2 network simulation platform, show good performance that reduced the number of reconstructions remarkably by distributing the whole traffic to several routes when there are several stable routes.

• Journal of Advanced Navigation Technology
• /
• v.24 no.5
• /
• pp.348-357
• /
• 2020

An important challenge in commercialization of eVTOL PAV is to reduce noise for urban air mobility (UAM) operation. Therefore, in this paper, noise priority routes were created to minimize the number of people affected by noise using aviation environmental design tool (AEDT) software and population distribution data for administrative districts, and noise analyses during operation were performed. Also, it was analyzed how much noise exposure could be reduced compared to the number of people affected by noise in the shortest route. Considering that the eVTOL PAV developers do not provide data, the analysis was conducted using a helicopter model. As a result, it was shown that the noise priority route that minimized the amount of noise exposure was more efficient than other routes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.1
• /
• pp.30-35
• /
• 2002

Dynamic routing uses routing protocols to select the best routes and to update the routing table. RP (Routing Information Protocol)using a distance-vector algorithm becomes generally known a routing protocol on the network. RIP selects the route with the lowest "hop count" (metric) as the best route. but RIP has a serious shortcoming. a mP router cannot maintain a complete routing table for a network that has destinations more than 15 hops away. To overcome this defect, It uses the OSPF (Open Shortest Path First) of link -state protocols developed for TCP/IP. It is suitable for very large networks and provides several advantages over RIP. This paper analyzes the traffic and the link efficiency between two protocols such as message delivery and delay, link utilization, message counts on the same network.e network.