• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.9
• /
• pp.767-773
• /
• 2014

An economic ship routing means to sail a ship with a goal of minimizing the fuel consumption by utilizing weather forecast information, and there have been various systems which have been recently studied. For a successful economic ship routing system, it is needed to properly control an engine power or change a geographical path considering weather forecast. An optimal geographical path is difficult to be determined, though, because it is a minimal dynamic-cost path search problem where the actual fuel consumption is dynamically variable by the weather condition when the ship will pass the area. In this paper, we propose an geographical path-search algorithm based on evolutionary strategy to efficiently search a good quality solution out of tremendous candidate solutions. We tested our approach with the shortest path-based sailing method over seven testing routes and observed that the former reduced the estimated fuel consumption than the latter by 1.82% on average and the maximum 2.49% with little difference of estimated time of arrival. In particular, we observed that our method can find a path to avoid bad weather through a case analysis.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.7
• /
• pp.131-139
• /
• 2013

To overcome the limitations in performance and power consumption of traditional electrical interconnection based network-on-chips (NoCs), a hybrid optical network-on-chip (HONoC) architecture using optical interconnects is emerging. However, the HONoC architecture should use circuit-switching scheme owing to the overhead by optical devices, which worsens the latency unfairness problem caused by frequent path collisions. This resultingly exert a bad influence in overall performance of the system. In this paper, we propose a new task mapping algorithm for optimizing latency by reducing path collisions. The proposed algorithm allocates a task to a certain processing element (PE) for the purpose of minimizing path collisions and worst case latencies. Compared to the random mapping technique and the bandwidth-constrained mapping technique, simulation results show the reduction in latency by 43% and 61% in average for each $4{\times}4$ and $8{\times}8$ mesh topology, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10B
• /
• pp.619-629
• /
• 2005

In this paper, we propose energy-aware routing schemes which are simple enough to be applicable to the wireless sensor networks. The one hop upstream no de in direction of the base-station is determined in four different ways based on the energy information of neighboring nodes, which are obtainable via the process of self-organization of the network. The fair distribution of the energy consumption over all the possible routes to the base-station is one of the design objectives. Also, an alternate route search mechanism is proposed to cope with the situation in which no routing information is available due to lack of remaining energy of the neighboring nodes. The mechanism turns out to be a supplementary scheme to improve the energy efficiency. Lots of simulations are performed to examine the performance metrics such as the energy efficiency, throughput, network lifetime, and the transmission latency of the proposed schemes. Simulation results show the feasibility of the simple routing schemes for the sensor networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8B
• /
• pp.839-845
• /
• 2009

The Vehicular Ad-hoc Network (VANET) has two main problems to be overcome due to high mobility and frequently changing density: one is short link duration time and the other is high packet loss ratio. To solve the problems, there have been many studies to predict vehicular mobility. Most of the studies try to enhance link expire time and link reliability, however the distance between two relay nodes becomes too short to have high network throughput. In this paper, we propose a new routing algorithm that considers both link expire time and network throughput in the VANET. The proposed algorithm aims to find path with long link expire time and high throughput. Our simulation results show that the proposed algorithm outperforms the legacy greedy algorithm and its variants.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.5
• /
• pp.117-125
• /
• 2022

Recently, as users' interest for travel increases, research on a travel route recommendation service that replaces the cumbersome task of planning a travel itinerary with automatic scheduling has been actively conducted. The most important and common goal of the itinerary recommendations is to provide the shortest route including popular tour spots near the travel destination. A number of existing studies focused on providing personalized travel schedules, where there was a problem that a survey was required when there were no travel route histories or SNS reviews of users. In addition, implementation issues that need to be considered when calculating the shortest path were not clearly pointed out. Regarding this, this paper presents a quantified method to find out popular tourist destinations using social big data, and discusses problems that may occur when applying the shortest path algorithm and a heuristic algorithm to solve it. To verify the proposed method, 63,000 places information was collected from the Gyeongnam province and big data analysis was performed for the places, and it was confirmed through experiments that the proposed heuristic scheduling algorithm can provide a timely response over the real data.

• Journal of the Korea Society for Simulation
• /
• v.19 no.3
• /
• pp.27-35
• /
• 2010

War-games using C4I systems have been used to improve the command ability of commanders and the fighting power of combat forces. During a war-game simulation, a commander makes a plan for the movement of a combat force and issues orders to the combat force according to the plan. If it is possible to minimize damages from the artillery of enemy forces and take the advantage position where is effective for attack/defense, we can hold a dominant position of the battlefield. Therefore, this papers proposes a genetic algorithm-based optimal path searching method. The proposed method creates an optimal path of a combat force by taking into consideration dangerous conditions of the battlefield in which the combat force is. This paper also shows the process of creating an optimal path by using a discrete event specification modeling and simulation method.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2017.05a
• /
• pp.81-81
• /
• 2017

최근 발생하는 태풍 또는 국지성호우는 단기간에 많은 양의 강우를 동반하고 있으며, 이로인한 내수침수 및 외수범람 피해가 빈번히 발생하고 있다. 이와 같은 홍수피해를 저감하기 위한 하나의 대책으로 내수 또는 외수로 인한 피해를 미리 예측하고 대비하는 방법이 필요하다. 피해를 미리 예측하기 위한 기존의 모델들은 지표유출, 지하유출, 침투, 증발산 등 다양한 강우-유출 알고리즘에 의해 홍수범람모의를 분석하게 된다. 따라서 그 모의시간이 길게 나타나 재난상황을 대처하는 데 문제가 있다. 본 연구에서는 홍수로 인한 제내지의 침수 확산 경로 빠른 시간 안에 모의하기 위하여 여러 가지 알고리즘을 단순화시킨 홍수범람 모형을 개발하였다. 개발된 분포형 홍수범람 모형인 SIMOD(Simplified Inundation MODel)는 홍수가 발생된 시점에서 그리드화된 주변셀로의 홍수전의를 위하여 주변셀과의 경사를 이용하여 차등 분배하는 다중흐름방향법(Multi Direction Method, MDM)과, 하나의 낮은 고도의 셀에서 수위가 높아져 인접셀보다 수위가 증가하면 그 수위는 인접 셀들과 균등해 진다는 가정인 평수가정법(Flat-Water Assumption, FWA)인 두 가지 알고리즘을 이용한다. 개발된 모형의 적합성을 확인하기 위하여 상용 모형인 FLO-2D를 이용하여 각 모의시간별 침수면적과 모형의 구동시간을 비교하였다. 비교결과 초기 1시간을 제외하고 홍수피해 면적이 10% 전후로 나타나 SIMOD의 적용성이 확인되었다. 모의 구동시간의 경우 32시간 모의시 SIMOD는 10분 안에 결과가 나오는 반면 FLO-2D는 1시간 이상 소요되는 것으로 나타났다. 또한 대피계획을 수립하기 위하여 제방붕괴시나리오를 이용한 제내지 침수모의를 실시하였다. 대상지역은 금호강하류 성서산업단지 유역으로 계획홍수위는 200년 빈도 홍수위를 기준으로 하였으며 폭 35m, 높이 7m의 제방파제로 인한 외수위 유입을 가정하여 제내지의 시간별 침수면적 모의하였다. 모의된 결과를 이용하여 시간대별 대피경로를 산정함으로써 홍수로 인한 대피 계획 수립에 적용 가능함을 확인하였다.

• Proceedings of the KAIS Fall Conference
• /
• 2010.11b
• /
• pp.546-550
• /
• 2010

무인잠수정이 원하는 경로를 추종할 수 있도록 안정적인 운항제어를 수행하기 위해서는 잠수정의 동역학적 특성을 정확히 파악하는 것이 필요하다. 수중에서 거동하는 무인잠수정의 동역학적 특성은 제어입력뿐만 아니라 유체력계수에 의해 주로 결정되므로, 이러한 계수값을 정확하게 아는 것이 중요한 요소라 할 수 있다. 일반적으로 유체력계수는 PMM 시험과 같은 실험적 방법을 통하여 얻게 되지만 실험방법의 어려움과 실험장비들의 부정확성으로 인한 오차에 의하여, 얻어진 값들의 신뢰성이 많이 저하된다. 계수값들을 구할 수 있는 다른 방법으로는, 확장칼만필터 등과 같은 모델기반 추정 알고리즘을 통하여 유체력계수를 추정하는 것이다. 본 논문에서는 확장칼만필터를 이용하여 유체력계수를 추정하도록 하였으며, 설계된 추정 알고리즘의 성능을 검증하기 위하여 기존에 수행된 PMM 시험에 의해 얻어진 유체력계수의 실험값과 비교 분석하였다. 또한 본 논문에서는 만타형 무인잠수정을 이용하여 원하는 경로를 추종할 수 있도록, 추정된 유체력계수를 사용하여 수심제어 및 방향제어를 위한 슬라이딩 모드 제어기를 설계하였으며, 충분한 정확도를 가지고 원하는 경로를 추종함을 시뮬레이션을 통해 확인하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.174-177
• /
• 2016

Wireless network-on-chip (WNoC) can alleviate critical path problem of existing typical NoCs by integrating radio-frequency module on router. In this paper, core-connection-aware genetic algorithm-based core and WIR mapping methodology at small world WNoC is presented. The methodology could optimize the critical path between cores with heavy communication. The 33% of average latency improvement is achieved compared to random mapping methodology.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.11a
• /
• pp.214-216
• /
• 2010

본 논문에서는, 다중송수신안테나 직교주파수분할다중화 (MIMO-OFDM) 시스템에서 심볼 기반 빔포밍을 위한 제한 피드백 기법을 고려하였다. 공간적 상관도가 존재하는 다중전달경로 채널에서, 심볼 기반 빔포밍을 위한 제한 피드백 기법과 코드북을 제안하였다. 모의실험 결과를 통해 제안한 기법이 낮은 복잡도를 가짐에도 불구하고 기존의 iterative 알고리즘을 기반으로 하는 심볼 기반 빔포밍을 이용한 제한 피드백 기법보다 우수한 성능을 보임을 확인하였다. 또한, 제안한 코드북이 랜덤 벡터 양자화 코드북보다 우수한 성능을 보임을 확인하였다.