• Journal of Korean Society of Transportation
• /
• v.23 no.5 s.83
• /
• pp.147-155
• /
• 2005

The purpose of this paper is to develop a method for estimation of reliable path-travel time using data obtained from the toll collection system on freeways. The toll collection system records departure and arrival time stamps as well as the identification numbers of arrival and destination tollgates for all the individual vehicles traveling between tollgates on freeways. Two major issues reduce accuracy when estimating path-travel time between an origin and destination tollgate using transaction data collected by the toll collection system. First, travel time calculated by subtracting departure time from arrival time does not explain path-travel time from origin tollgate to destination tollgate when a variety of available paths exist between tollgates. Second, travel time may include extra time spent in service and/or rest areas. Moreover. ramp driving time is included because tollgates are installed before on-ramps and after off-ramps. This paper describes an algorithm that searches for arrival time when departure time is given between tollgates by a Progressive Iterative Forward and Backward (PIFAB) search method. The algorithm eventually produces actual path-travel times that exclude any time spent in service and/or rest areas as well as ramp driving time based on a link-based procedure.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.905-916
• /
• 2004

Self-organizing hierarchical ad hoc network (SOHAN) is a new ad-hoc network architecture designed to improve the scalability properties of conventional 'flat' ad hoc networks. This network architecture consists of three tiers of ad-hoc nodes, i.e.. access points, forwarding nodes and mobile nodes. This paper presents a topology discovery and routing protocol for the self-organization of SOHAN. We propose a cross-layer path metric based on link quality and MAC delay which plays a key role in producing an optimal cluster-based hierarchical topology with high throughput capacity. The topology discovery protocol provides the basis for routing which takes place in layer 2.5 using MAC addresses. The routing protocol is based on AODV with appropriate modifications to take advantage of the hierarchical topology and interact with the discovery protocol. Simulation results are presented which show the improved performance as well as scalability properties of SOHAN in terms of through-put capacity, end-to-end delay, packet delivery ratio and control overhead.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.69-72
• /
• 2000

In CDMA systems, the performance of the typical multipath searcher degrades much according as the signal to noise ratio becomes low. In this paper, multipath searcher algorithm is proposed based on sliding window to overcome this drawback. In searcher systems, correlation values between incoming and local PN sequences are used to acquire multipath components. Therefore more accurate distributions of correlation values obtained through this proposed algorithm enables to get higher detection probability. In computer simulations, it is verified that proposed algorithm has better performances in Rayleigh fading channel and Gaussian channel.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.529-532
• /
• 2003

본 논문은 UWB(Ultra Wide-band) 통신 시스템에서 효과적인 신호 검출 알고리즘을 제안한다. UWB 통신 시스템은 차세대 통신 시스템으로 각광 받고 있는 기술로써, 매우 낮은 파워의 송신 신호를 사용한다. 그로 인해 잡음 및 다중 경로 환경하에서 신호 검출 알고리즘이 시스템 성능에 매우 중요한 부분으로 작용한다. 제안된 알고리즘은 신호 검출 성능을 높이기 위해, 신호의 정확한 위치를 잡는 Tracking과정에서 사용되는 DLL 구조를 활용하여 보다 세밀한 신호 탐색이 가능하다. 실험 결과 신호 위치를 기준으로 신호길이의 1/3 내에서 신호를 검출할 확률이 AWGN 15dB 이하에서 30% 정도 높아짐을 확인하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05a
• /
• pp.317-320
• /
• 2003

본 논문에서는 각 도시마다 가중치가 있는 City domain을 tour하기 위한 문제를 해결하기 위해 Simulated Annealing Algorithm을 확장한 알고리즘을 제시하였고 Capacitated vehicle routing problem을 변형한 Augmented multiple salesman traveling problem을 정의하고 이를 해결하기 위한 에너지 함수와 알고리즘을 제시하였다.

• Journal of Advanced Marine Engineering and Technology
• /
• v.36 no.6
• /
• pp.823-829
• /
• 2012

Data communications networks at sea in the future can be modelled by overlapped MANET networks with Broadband Wireless Access carriers. A novel routing scheme (CPLR) is proposed in this paper, which finds out an optimal route by selecting an optimal carrier for each hop in routes based on carrier preferences of each application, and locations of ships as well. As distances between each ships and destination ships are considered in this scheme, routing can be done much faster. Performance is compared with that of the CPR (only Carrier Preference-based Routing Scheme), and it shows some improvements.

• Journal of KIISE
• /
• v.42 no.8
• /
• pp.1057-1064
• /
• 2015

The tactical network is system based on wireless networking technologies that ties together surveillance reconnaissance systems, precision strike systems and command and control systems. Several alternative paths exist in the network because it is connected as a grid to improve its survivability. In addition, the network topology changes frequently as forces and combatants change their network access points while conducting operations. However, most Internet routing standards have been designed for use in stable backbone networks. Therefore, tactical networks may exhibit a deterioration in performance when these standards are implemented. In this paper, we propose Priority based Multi-Path routing with Local Optimization(PMPLO) for a tactical backbone network. The PMPLO separately manages the global and local metrics. The global metric propagates to other routers through the use of a routing protocol, and it is used for a multi-path configuration that is guaranteed to be loop free. The local metric reflects the link utilization that is used to find an alternate path when congestion occurs, and it is managed internally only within each router. It also produces traffic that has a high priority privilege when choosing the optimal path. Finally, we conducted a simulation to verify that the PMPLO can effectively distribute the user traffic among available routers.

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.645-652
• /
• 2004

In this paper, we aggregate multi-links information between boundary nodes using the line segment scheme that aggregates topology in-formation within PG referring bandwidth and delay parameter. The proposed scheme can search multi-links efficiently using the depth priority method based on hop count instead of searching all links. To do this, we propose a modified line segment algorithm using two line segment method that represents two points which consist of delay-bandwidth pair to reduce topology information and provide a flexibility to the multi pie-links aggregation. And we apply it to current star topology aggregation. To evaluate performance of the proposed scheme, we compare/analyze the current method with the proposed scheme with respect to call success rate, access time and crankback rate. Through the simulation result analysis, the proposed star topology aggregation scheme presents the better performance than existing scheme.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.155-160
• /
• 2004

배열센서를 사용한 표적의 위치 추정은 레이다 및 소나에서 잘 알려진 문제이다. 최근에 Lee 등은 1 차원 수평 선배열 센서만을 사용하여 다중경로를 통해 들어오는 신호로부터 표적의 3 차원 위치를 추정하였다. 그러나 이 알고리즘에서 수중에서의 음속은 수심에 관계없이 일정하다고 가정하였기 때문에 음속이 수심에 따라 다양하게 변화하는 실제 수중환경에서는 그 추정성능이 현저히 저하된다. 따라서 본 논문에서는 표적의 거리, 깊이, 방위각으로 구성되는 3 차원 위치 추정을 위해 비균일 음속환경에서의 음파전달모델(ray propagation model)을 이용한 ML 기법(maximum likelihood estimation)을 적용하였으며 일정한 음속을 가정한 Lee 기법의 추정치를 초기값으로 한 탐색을 통해 ML 기법의 연산량을 감소시켰다.

• The Journal of the Korea Contents Association
• /
• v.8 no.7
• /
• pp.35-42
• /
• 2008

The proposed scheme in this paper can search multi-links efficiently using the depth priority method based on hop count instead of searching the all links. To do this, we proposed a modified line segment scheme using two line segment method. The scheme represents two points which consist of delay-bandwidth pair to reduce topology information and provide a flexibility to the multiple-links aggregation. And we apply it to current spanning tree topology aggregation. To evaluate performance of the proposed scheme, we compare/analyze the current method with the proposed scheme with respect to call success rate, access time and crankback rate. Simulation result analysis showed the proposed spanning tree topology aggregation scheme presents the better performance than existing scheme.