• 한국ITS학회:학술대회논문집
• /
• 2003.11a
• /
• pp.324-329
• /
• 2003

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.33 no.4
• /
• pp.287-296
• /
• 2015

Recent navigation systems provide quick guide services, based on processing real-time traffic information and past traffic information by applying predictable pattern for traffic information. However, the current pattern for traffic information predicts traffic information by processing past information that it presents an inaccuracy problem in particular circumstances(accidents and weather). So, this study presented a more precise predictive traffic information system than historical traffic data first by analyzing route search data which the drivers ask in real time for the quickest way then by grasping traffic congestion levels of the route in which future drivers are supposed to locate. First results of this study, the congested route from Yang Jae to Mapo, the analysis result shows that the accuracy of the weighted value of speed of existing commonly congested road registered an error rate of 3km/h to 18km/h, however, after applying the real predictive traffic information of this study the error rate registered only 1km/h to 5km/h. Second, in terms of quality of route as compared to the existing route which allowed for an earlier arrival to the destination up to a maximum of 9 minutes and an average of up to 3 minutes that the reliability of predictable results has been secured. Third, new method allows for the prediction of congested levels and deduces results of route searches that avoid possibly congested routes and to reflect accurate real-time data in comparison with existing route searches. Therefore, this study enabled not only the predictable gathering of information regarding traffic density through route searches, but it also made real-time quick route searches based on this mechanism that convinced that this new method will contribute to diffusing future traffic flow.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1534-1541
• /
• 1996

Routing security is the confidentiality of route taken by the data transmitted over communication networks. If the route is detected by an adversary, the probability is high that the data 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 a destination node using the shortest direct path. Furthermore, if we use a number of secret routes from a node to a destination node, data security is much stronger since we can transmit partial data rather than entire data along a secret route. Finally, the idea above is implemented on MRNS Network.

• 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 the Korea Contents Association
• /
• v.19 no.2
• /
• pp.159-169
• /
• 2019

Today, the location based service(LBS) is globally developing with the advance of smart phones and IOT devices. The main purpose of this research is to provide users with the most efficient route information, analyzing big data of people with a variety of routes. This system will enable users to have a similar feeling of getting a direct guidance from a person who has often used the route. It is possible because the system server analyzes the route information of people in real time, after composing the distributed processing system on the basis of map information. In the future, the system will be able to amazingly develop with the association of various LBS services, providing users with more precise and safer route information.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1178-1181
• /
• 2009

Geographic forwarding algorithms을 사용하는 Georouting protocol에서는 route maintenance을 위해서 고정된 주기마다 beacon message을 이웃노드에 전송하는 fixed periodical beacon based route algorithm을 사용하여 mobile node 정보를 습득한다. Fixed periodical beacon scheme에서의 기존 연구 이슈는 이웃노드 정보의 신뢰성을 유지하기 위해서 다양한 mobility environment 환경에 맞도록 beacon 전송주기를 적절히 결정하는 연구가 진행되어 왔다. 이와 같은 연구에서는 long periodical interval 사용 시 이웃노드의 위치정보 error을 발생시킬 확률이 높으며 또한 short periodical interval 의 경우 네트워크 내에 high route overhead 을 유발시키는 단점을 가지고 있다. 따라서 고정된 주기 방법은 다양한 mobility environment에 잘 적용되지 못하며 또한 mobility environment 에서 발생하는 route maintenance 내에 이웃노드 정보에 대한 불확실성 문제가 빈번이 발생하여 경로 설정에 잘못된 정보를 제공하여 경로 신뢰성(path reliability)과 낮은 전송률 (transmission rate)을 야기한다. 본 논문에서는 이런 이웃노드 정보의 불확실성 문제를 극복하기 위해서 mobile node가 스스로 자신의 위치를 체크하여 routing table을 능동적으로 갱신하는 방법을 이용하여 이 문제를 극복할 수 있도록 하였다. 모의 실험은 ns2를 이용하여 실시하였으며 결과는 low/high mobility scenario에서는 기존 방법 보다 routing overhead 을 줄이면서 높은 전송률 (transmission rate)을 보인다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.871-874
• /
• 2008

이동성을 제공하기 위한 프로토콜 중 오랜 기간 많은 연구로 표준화가 된 Mobile IPv6 (MIPv6)가 있다. MIPv6는 호스트 기반 이동성 제공 프로토콜로서 이동 단말이 이동성에 필요한 시그널링을 직접수행한다. 한편, 최근에 표준화 작업이 진행 중인 Proxy Mobile IPv6 (PMIPv6)는 네트워크 기반 이동성 제공 프로토콜로서 이동 단말이 아닌 네트워크 자체에서 이동성을 제공한다. PMIPv6는 MIPv6에서 Home Agent와 같은 역할을 하는 Local Mobility Anchor 와 이동 단말이 수행하던 시그널링을 대신하는 Mobile Access Gateway를 정의하여 이동성을 제공한다. PMIPv6의 기본 동작 과정에 대한 표준화가 진행됨에 따라 프로토콜의 최적화에 대한 이슈가 부각되고 있다. Route Optimization은 이러한 최적화 이슈 중 하나로서 패킷 전송 시 최적화 된 경로를 설정하고 발생할 수 있는 전송 지연을 최소화하는 기법이다. 본 논문에서는 PMIPv6에서의 Route Optimization을 적용하기 위해 Liebesch 인터넷 드래프트에서 제안 한 기법의 동작 과정을 살펴보고 PMIPv6의 기본 전송 과정과 비교하여 그 성능을 분석하였다.

• Journal of Digital Contents Society
• /
• v.14 no.4
• /
• pp.447-454
• /
• 2013

As the surveillance CCTVs are increasing every year, big data image processing for the CCTV image data has become a hot issue. In this paper, we propose a Hadoop-based big data image processing technique to recognize a vehicle number from a large amount of automatic number plate images taken from CCTVs. We also implement the vehicle route tracking system that displays the moving path of the searched vehicle on Google Maps with the related information together. In order to evaluate the performance we compare and analysis the vehicle number recognition time for a lot of CCTV image data in Hadoop and the single PC environment.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.3
• /
• pp.273-283
• /
• 2014

Imported and exported agricultural products are facing a very difficult time due to the rising distribution costs spurred by the increasing labor and oil prices. High empty transfer rates, which take place on a return route after the regular transportation of imported and exported agricultural products, are especially a major cause of the rising distribution costs. In an effort to overcome those limitations, this study set out to examine the transportation stages connecting harbor warehouses, processing plants, and central distribution centers on the circulation route of such imported grains as wheat, barley, corn, and soybean and the transportation route from the warehouses devoted to exported agricultural products to harbors for such exported agricultural products as apple, pear, and persimmon in order to develop a model on the creation of a compound logistics complex for processing plants and transshipment of imported and exported agricultural products. The study also promoted the logistic rationalization of imported and exported agricultural products by creating a compound logistics complex that would combine processing plants for imported agricultural products and transshipment functions for exported agricultural products.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.191-198
• /
• 2007

A mobile ad-hoc network (MANET) is an autonomous, infrastructure-less system that consists of mobile nodes. In MANET, on demand routing protocols are usually used because network topology changes frequently. AODV, which is a representative on demand routing protocol, operates using the routing table of each node that includes next hop of a route for forwarding packets. It maintains the established route if there is not an expiration of route or any link break. In the paper, we propose a partially adaptive route maintenance scheme (AODV-PA) based on AODV, which provides dynamic route modification of initial route for selecting the effective route using not only next hop but also next-hop of next-hop (i.e. 2-hop next node) acquired through route discovery process. In addition, the proposed scheme additionally manages the routing table for preventing exceptional link breaks by route modification using HELLO messages. 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, latency, routing overhead.