• Title/Summary/Keyword: 경로인지

Search Result 15,317, Processing Time 0.04 seconds

An AODV-Based Two Hops Dynamic Route Maintenance in MANET (MANET에서의 AODV 기반 2홉 동적 경로유지 기법 연구)

  • Moon, Dae-Keun;Kim, Hag-Bae
    • 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.

A dynamic Shortest Path Finding with Forecasting Result of Traffic Flow (교통흐름 예측 결과틀 적용한 동적 최단 경로 탐색)

  • Cho, Mi-Gyung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.5
    • /
    • pp.988-995
    • /
    • 2009
  • One of the most popular services of Telematics is a shortest path finding from a starting point to a destination. In this paper, a dynamic shortest path finding system with forecasting result of traffic flow in the future was developed and various experiments to verify the performance of our system using real-time traffic information has been conducted. Traffic forecasting has been done by a prediction system using Bayesian network. It searched a dynamic shortest path, a static shortest path and an accumulated shortest path for the same starting point and destination and calculated their travel time to compare with one of its real shortest path. From the experiment, over 75%, the travel time of dynamic shortest paths is the closest to one of their real shortest paths than one of static shortest paths and accumulated shortest paths. Therefore, it is proved that finding a dynamic shortest path by applying traffic flows in the future for intermediated intersections can give more accurate traffic information and improve the quality of services of Telematics than finding a static shortest path applying by traffic flows of the starting time for intermediated intersections.

Route Travel Time Stabilization by Real Time Traffic Information Improvement (실시간 교통정보 제공수준향상에 의한 경로통행시간의 안정화)

  • Lee Chung-Won
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.2 no.1 s.2
    • /
    • pp.101-108
    • /
    • 2003
  • When drivers encounter multiple available routes, they may evaluate the utility of each route. Two important factors in the evaluation are travel time and travel cost. Without hewing the current travel time of each route, drivers' decisions are not necessarily optimum. It is called 'transparency issue' that drivers are blinded to choose the optimum route among the others because of the limited travel time information. As a result of this, competing route travel times tend to fluctuate. This case study to utilize the data of Namsan traffic information system confirms that this travel time fluctuation can be lessened as real time traffic information is provided.

  • PDF

The Effect of the Typoon Course on the Shallow Water Wave (천해역 파랑발달에 대한 태풍경로의 영향)

  • Lee, Kyung-Seon;Kim, Jung-Tae;Ryu, Cheong-Ro
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2006.11a
    • /
    • pp.473-476
    • /
    • 2006
  • 천해역의 파랑발달에 대한 태풍경로의 영향력을 분석 하였다. 우리나라 남동해안에 주로 피해를 초래할 것으로 판단되는 태풍의 경로를 '남해안 상륙 후 내륙 통과'와 '대한해협통과'로 분류하고 각 경로에 따른 태풍규모와 파랑발달을 1956년 부터 2004년까지의 기상자료를 바탕으로 검토하였다. 태풍 경로의 영향력 분석은 천해역 파랑발달의 주요외력이 지형조건에 의해 결정되므로(즉, 폐쇄해역은 태풍의 바람장이 주요외력이며, 개방해역은 심해 전달파랑과 바람장의 영향을 동시에 받는다), 개방해역과 폐쇄해역의 경우로 나누어 수치모형실험을 통해 수행하였다. 실험조건은 태풍 "매미"의 강도와 특성 값을 기준으로 하였으며, 대상해역은 부산신항 인근해역과 원전항 인근해역을 개방형과 폐쇄형 해역으로 대별하여 실험을 수행하였다. 자료의 분석결과 최근 이상기후현상으로 태풍의 강도가 커지고 있음을 뒷받침 하는 근거는 찾아보기 힘들었으며, 2000년대 이후로 남해안에 상륙하는 경로'1'이 대한해협을 통과하는 경로(경로'2')보다 그 내습빈도가 커지고 있음을 볼 수 있었다. 태풍의 경로와 풍향이 같은 방향인 경로'1'일 때 에너지가 집중되어 태풍중심기압과 풍속과 파고의 증가가 함께 일어난다. 그러나 태풍의 경로와 풍속의 방향이 일치하지 않는 경로'2'의 경우는 에너지가 분산되므로 태풍중심기압과 풍속은 함께 증가하나 파랑에너지는 함께 발달하지 않는 것으로 보였다. 내습한 태풍의 강도를 경로별로 비교한 결과, 경로'1'이 경로'2'보다 큰 강도를 가지고 연악역에 영향을 미치는 것으로 판단되었다.

  • PDF

Analysis the Overhead of IEEE 802.11 RTS/CTS Handshake in Ad-hoc Networks Based Multipath Routing (다중경로 라우팅 기반 Ad-hoc Networks에서 IEEE 802.11 RTS/CTS 핸드세이크 오버헤드 분석)

  • Kim, Hyun-Chang;Lee, Jai-Yong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.6
    • /
    • pp.33-44
    • /
    • 2008
  • Multipath routing protocols with load balance, fault tolerance, aggregated bandwidth in Ad-hoc Networks provide improved throughput and reliable route as compared with singlepath routing protocols. However, multipath routing protocols have not been explored thoroughly in the domain of overhead in Ad-hoc Networks. In this paper, we analyze and compare on-demand singlepath and multipath routing with IEEE 802.11 DCF in terms of Routing overhead and MAC overhead. The results reveals that in comparison with singlepath routing protocol, multipath routing mechanism creates more overheads but provides better performance in congestion and capacity provided that the route length is within a certain upper bound which is derivable. The analytical results are further confirmed by simulation.

Design and Implementation of the Postal Route Optimization System Model (우편 경로 최적화 시스템 모델 설계 및 구현)

  • Nam, Sang-U
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.6
    • /
    • pp.1483-1492
    • /
    • 1996
  • In this paper, related on the postal business with the GIS(Geographics Information System), it discusses design and implementation of the PROS(Postal Route Optimization System) model and its main module, the shortest path generation algorithm, for supporting to postal route managements. It explains examples requirements of postal route system, and suggests the efficient PROS model using our developed shortest path generation algorithm. Because the shortest path algorithm adopts not only consider the Dijkstra algorithm of graph theory, but also the method with the direction property, PROS can be implemented with fast and efficient route search. PROS is mainly constituted of the Shortest Generator, the Isochronal Area Generator, and the Path Rearrangement Generator. It also exploits the GIS engine and the spatial DBMS (Data Base Management System) for processing coordinates in the map and geographical features. PROS can be used in the management of postal delivery business and delivery area and route, and in the rearrangement of route. In the near future, it can be also applied to commercial delivery businesses, guides of routs and traffic informations, and auto navigation system with GPS(Global Positioning System).

  • PDF

Backup path Setup Algorithm based on the Bandwidth Sharing in Mesh Networks (메쉬 구조의 망에서 대역 공유를 통한 복구 경로 설정 알고리즘)

  • 이황규;홍석원
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.1
    • /
    • pp.41-47
    • /
    • 2002
  • Path setup considering QoS is one of the main problems to solve in Internet traffic engineering. In network restoration that is one of the traffic engineering components, to establish a backup path or backup path for a working path to be protected is the main task. The backup path should have enough bandwidth to guarantee the working paths. Thus this work requires the QoS routing solution that is to set up a backup path as well as a working path at the same time provisioning enough bandwidth. In this paper, we propose an algorithm to setup a backup path that shares the bandwidth of other backup paths whose working path does not pass along the same link with the working path we are considering. In this way we can reduce much bandwidth consumption caused by setting up backup paths. We also analyze the disjoint path computation algorithms. Finally we show simulation results how the algorithm can reduce the bandwidth consumption and how it will affect blocking when we setup paths.

Managing Hybrid Marketing Channels for Fashion Apparel Industry(in Korea) (패션의류시장에 있어서 하이브리드 마케팅 경로 관리 연구)

  • Shon, Sanggi;Kwon, Soongi;Kim, Stephen K.
    • International Area Studies Review
    • /
    • v.12 no.3
    • /
    • pp.89-109
    • /
    • 2008
  • Using hybrid channel affords the benefits of achieving control through the direct channel and achieving flexibility through the indirect channel. However, using a hybrid channel also poses special challenges to a manufacturer, including the problem of managing multiple channel members with disparate goals and priorities. The purpose of this study is to enhance our understanding on the management of hybrid channel. We study marketing channels for fashion apparel to examine governance challenges and solutions of a hybrid channel. We have two objectives to fulfill that purpose. First, we aim to tie two largely separate research streams of salesforce management and marketing channel management together by examining both intrafrim governance and interfirm governance issues under one conceptual framework. Second, we aim to lay a ground work for rigorous further research on this topic by tying two major theoretical approaches of governance together under one conceptual framework. Our predictions were tested with data from the survey of apparel manufacturers and retailers. The analysis results support the predictions moderately.

온라인과 오프라인 유통경로에서 소비자 구매행동에 대한 비교연구

  • Park, Cheol
    • Distribution Business Review
    • /
    • no.2
    • /
    • pp.49-63
    • /
    • 2002
  • 최근 인터넷 상거래가 급속히 확산되면서 기업의 경쟁이 실물세계와 가상세계에서 발생하는 현상이 전개되고 있다. 즉, 유통경로의 측면에서 볼 때 기존의 물리적 세계에 존재하는 전통적인 유통경로와 사이버공간에 존재하는 가상 유통경로가 서로 경쟁하는 형국이 벌어지고 있는 것이다. 온라인 유통경로가 활성화 되면서 두 유통경로간의 갈등양상도 나타나고 있다. 예를 들어, 자동차, 보험, 증권 등의 업종에서 온라인 경로를 통한 판매는 즉각적으로 오프라인 영업사원들의 반발을 불렀다. 컴팩의 경우는 자기 웹사이트나 대리점보다 더 싸게 자사제품을 판매하는 온라인 쇼핑몰에는 제품공급중단을 선언하기도 했다.(중략)

  • PDF

An Improved AODV Algorithm Using Local Repair (지역적 복구를 이용한 개선된 AODV 알고리즘)

  • 안태영;서주하
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10c
    • /
    • pp.265-267
    • /
    • 2003
  • 이동성을 가진 다수의 노드들로 구성된 Ad­Hoc 무선 네트워크는 유선망이나 기지국이 존재하지 않는 환경에서 통신망을 구성하기 위한 목적으로 연구되어 왔다. Ad­Hoc 무선 네트워크에서 라우팅 프로토콜은 이동 노드들간의 연결을 위한 경로를 제공하며, 본 논문에서는 무선 Ad­Hoc 라우팅 프로토콜 중 AODV(Ad­Hoc On­Demand Distance Vector routing)의 개선된 알고리즘을 제안하고자 한다. AODV는 경로획득, 경로유지. 경로복구의 크게 3단계로 나누어져 있고, AODV에서의 경로복구는 전체 경로를 재설정하는 것으로 많은 오버헤드를 가지고 있다. 제안한 방법에서는 링크손실로 인한 경로복구의 과정을 링크 손실이 발생한 인접 지역내에서 행하게 함으로써 전체적인 성능 향상을 가져왔다.

  • PDF