• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2004년도 가을 학술발표논문집 Vol.31 No.2 (3)
• /
• pp.31-33
• /
• 2004

We suggest an enhanced automatic route shortening method for dynamic source routing (DSR) protocol. DSR is a request / response based protocol which has low routing overhead owing to node movement. The original automatic route shortening is performed on the only nodes that belong to the source route of packets. On the contrary, our suggested method allows all neighbor nodes hearing the packet to participate in automatic route shortening. It makes all possible route shortenings be performed. So we maintain maximal short routes of ongoing data connections. Simulation results show that our method pays small extra overhead for ARS, but increases the ratio of packet transmissions and ARS' are performed from 2 to 5 times as much as original ARS.

• ETRI Journal
• /
• 제35권3호
• /
• pp.406-413
• /
• 2013

In this paper, an orthogonal frequency division multiple access (OFDMA)-based minimum end-to-end delay (MED) distributed routing scheme for mobile backhaul wireless mesh networks is proposed. The proposed scheme selects routing paths based on OFDMA subcarrier synchronization control, subcarrier availability, and delay. In the proposed scheme, OFDMA is used to transmit frames between mesh routers using type-I hybrid automatic repeat request over multipath Rayleigh fading channels. Compared with other distributed routing algorithms, such as most forward within radius R, farthest neighbor routing, nearest neighbor routing, and nearest with forwarding progress, simulation results show that the proposed MED routing can reduce end-to-end delay and support highly reliable routing using only local information of neighbor nodes.

• 대한음성학회지:말소리
• /
• 제52호
• /
• pp.161-169
• /
• 2004

This paper describes the automated call routing for train ticket reservation aid system based on speech recognition. We focus on the task of automatically routing telephone calls based on user's fluently spoken response instead of touch tone menus in an interactive voice response system. Vector-based call routing algorithm is investigated and mapping table for key term is suggested. Korail database collected by KT is used for call routing experiment. We evaluate call-classification experiments for transcribed text from Korail database. In case of small training data, an average call routing error reduction rate of 14% is observed when mapping table is used.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2006년도 추계학술대회 논문집(제1권)
• /
• pp.393-397
• /
• 2006

Significant increase of container flows in marine terminals requires more efficient automatic port systems. This paper presents a novel routing and collision avoidance algorithm of linear motor based shuttle cars using dynamic programming (DP). The proposed DP is accomplished online for determining optimal paths for each shuttle car. We apply our algorithm to Agile port terminal in USA.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• pp.546-549
• /
• 2005

It is evident that advancement of ubiquitous technologies in the near future guarantees more convenient and plentiful living. With regarding to car life, we dream of an automatic driving without any effort of operation. This paper touches the realization issue, a convergence of wireless sensor network and Telematics specializing on an information routing mechanism between participating components in Telematics sensor communication network. We list up new requirements of wireless sensor network deployed for Telematics services. Then context-aware routing architecture is proposed in order to solve these constraints, in which a network topology for routing can be dynamically configured according to the combination of context models of network components.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(2)
• /
• pp.257-260
• /
• 2001

Routing region modeling methods for PCB auto-routing system in Shape based type(non-grid method) used region process type and the shape located in memory as a individual element, and this element consumed small memory due to unique data size. In this paper we design PCB(Printed Circuit Board) auto-routing system using the auction algorithm method that 1) Could be reached by solving the shortest path from single original point to various destination, and 2) Shaped based type without any memory dissipation with the best speed. Also, the auto-routing system developed by Visual C++ in Window environment, and can be used in IBM Pentium computer or in various individual PC system.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.429-432
• /
• 2000

The new MPEG-4 video coding standard enables content-based functionalities. In order to support the philosophy of the MPEG-4 visual standard, each frame of video sequences should be represented in terms of video object planes (VOP’s). In other words, video objects to be encoded in still pictures or video sequences should be prepared before the encoding process starts. Therefore, it requires a prior decomposition of sequences into VOP’s so that each VOP represents a moving object. A parallel processing system is required an automatic segmentation to be processed in real-time, because an automatic segmentation is time consuming. This paper addresses the parallel processing: system for an automatic segmentation for separating moving object from the background in image sequences. The proposed parallel processing system comprises of processing elements (PE’s) and a multi-access memory system (MAMS). Multi-access memory system is a memory controller to perform parallel memory access with the variety of types: horizontal, vertical, and block access way. In order to realize these ways, a multi-access memory system consists of a memory module selection module, data routing modules, and an address calculation and routing module. The proposed system is simulated and evaluated by the CADENCE Verilog-XL hardware simulation package.

• 한국산업정보학회논문지
• /
• 제25권1호
• /
• pp.31-40
• /
• 2020

자유 여행자들이 증가함에 따라 다양한 자동여정생성 서비스가 생겨났지만, 자동여정생성 방법에 대한 연구는 아직 활발히 진행되지 않고 있다. 본 연구에서는 이미 개발된 전문가 추천 경로를 바탕으로 여행지별 선호점수를 수집하고 거리와 선호에 따라 여정을 자동생성하는 알고리듬을 개발하였다. 제안된 여정생성 알고리듬을 성능을 검증하기 위해 싱가포르, 방콕 및 다낭의 세 여행지에 대해서 30개의 여정을 본 연구에서 제안한 자동여정생성 알고리듬과 차량경로문제 알고리듬을 사용하여 생성한 두 여정 데이터의 평균 이동거리를 t-검정과 평가자간 신뢰도를 통해 제안된 알고리듬의 효율성과 효과성을 비교하였다. 실험결과, 제안 알고리듬을 기반으로 한 여정이 차량경로문제(Vehicle routing problem: VRP) 알고리듬의 여정과 다르지 않아 제안된 알고리듬의 효율성을 입증하였고. 두 여행전문가의 정성적 평가를 통해, 제안된 알고리듬으로 생성된 여정이 실제 사용에 충분히 효과적임을 보였다.

• 한국정보과학회논문지:정보통신
• /
• 제34권6호
• /
• pp.475-482
• /
• 2007

이동 무선 애드-혹 네트워크에서 이동 노드들은 일반적인 호스트 기능뿐만 아니라 이동 노드의 위치 변화에 따른 네트워크 토폴로지가 변화는 상태에서 데이타 패킷 전달의 역할도 수행하는 라우팅 기능을 수행한다. 이런 애드-혹 네트워크를 위한 라우팅 프로토콜이 여러 가지 있다. 본 논문에서는 여러 제안된 프로토콜 중에서 네트워크에서 라우팅으로 인한 프로토콜 오버헤드가 작은 요구/응답 방식으로 동작하는 DSR 프로토콜을 대상으로 성능을 향상시키는 새로운 경로 축소 방법을 제안했다. 기존 경로 축소 방법은 소스 경로 상에 있는 노드만이 경로 축소에 참여하는데 반해, 본 논문에서 소스 경로 밖에 있는 인접 노드들도 청취한 패킷으로부터 수집한 정보를 경로 캐쉬로 관리해서. 저장된 캐쉬 경로 정보를 토대로 진행 중인 연결에 대해 더 짧은 경로를 발견한 경우에 기존 경로 대신 새 경로를 사용하도록 경로 축소 작업을 수행하는 방법을 제시했다. ns2를 이용한 시뮬레이션 결과, 제안한 방법이 이동 노드의 위치 변화가 활발한 경우에 기존 방법보다 경로 축소 횟수가 많이 발생했고, 또한 토폴로지의 변화에 대해 신속한 경로 축소를 수행해서 패킷 전송 성공률도 높아졌음을 확인했다. 즉, 약간의 프로토콜 오버헤드를 치루고 노드의 이등성에 따라 두 배에서 다섯 배 정도의 경로 축소로 신속한 패킷 전송과 전체적인 노드의 에너지 소모를 줄일 수 있음을 확인하였다.

• 한국항해항만학회지
• /
• 제30권9호
• /
• pp.773-777
• /
• 2006

Significant increase of container flows in the marine terminals requires more efficient port equipments such as logistic and transfer systems. This paper presents collision avoidance and routing approach based on dynamic programming (DP) algorithm for a linear motor based shuttle car which is considered as a new transfer system in the port terminals. Most of routing problems are focused on automatic guided vehicle (AGV) systems, but its solutions are hardly utilized for LM based shuttle cars since both are mechanically different. Our proposed DP is implemented for real-time searching of an optimal path for each shuttle car in the Agile port terminal located at California in USA.