• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1215-1223
• /
• 2014

In multi-hop wireless networks, a message transmission path is set up on demand by a route discovery step, where a shortest path is used in general. The shortest path, however, normally uses the nodes near the center area, which causes a high traffic load in that area and reduces the message transmission reliability. We propose a stable routing protocol considering the remaining energy of nodes. Our protocol uses ETX as a link performance estimator and tries to avoid the nodes with smaller energy. By doing this, we can reduce the route failure probability and packet loss. We have evaluated the performance of the proposed protocol using QualNet and compared with AODV and MRFR protocols. The simulation result shows that our protocol has a similar performance as MRFR in terms of end-to-end message reception ratio, average message delay and delay jitter, but outperforms MRFR in terms of traffic load distribution.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.219-228
• /
• 2007

End-to-end path setup and maintenance are very important for mobile ad-hoc wireless communications, because of the mobility and the limited battery capacity of the nodes in the networks. the AODV routing protocol is the one of mary proposed protocols. However, there are route failure problem with the Proposed protocols between intermediate nodes due to such mobility and exhausted battery characteristics, and this is because only the shortest hop count is considered for the route setup. If route failure happens. Problem such as the waste of bandwidth and the increment of the energy consumption occur because of the discarding data packets in the intermediate nodes and the path re-setup process required by the source node. In addition, it obviously causes the network lifetime to be shortened. This paper proposes a routing protocol based on the AODV routing protocol that it makes use of the remaining energy, signal strength and SNR of the MAC layer resources to setup a path.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2023.05a
• /
• pp.132-133
• /
• 2023

The safe evacuation of people during disasters is of utmost importance. Various life safety evacuation simulation tools have been developed and implemented, with most relying on algorithms that analyze maps to extract the shortest path and guide agents along predetermined routes. While effective in predicting evacuation routes in stable disaster conditions and short timeframes, this approach falls short in dynamic situations where disaster scenarios constantly change. Existing algorithms struggle to respond to such scenarios, prompting the need for a more adaptive evacuation route algorithm that can respond to changing disasters. Artificial intelligence technology based on reinforcement learning holds the potential to develop such an algorithm. As a fundamental step in algorithm development, this study aims to evaluate whether an evacuation algorithm developed by reinforcement learning satisfies the performance conditions of the evacuation simulation tool required by IMO MSC.1/Circ1533.

• Journal of Advanced Navigation Technology
• /
• v.26 no.5
• /
• pp.304-311
• /
• 2022

Although the SEAD(suppression to enemy air defenses) mission is a strategically important task in modern warfare, the high risk of direct exposure to enemy air defense assets forces to use of unmanned aerial vehicles. this paper proposes a path planning algorithm for SEAD mission for an unmanned aerial vehicle and a method for calculating the mission effectiveness on the planned path. Based on the RRT-based path planning algorithm, a low-altitude ingress/egress flight path that can consider the enemy's short-range air defense threat was generated. The Dubins path-based Intercept path planning technique was used to generate a path that is the shortest path while avoiding the enemy's short-range anti-aircraft threat as much as possible. The ingress/intercept/egress paths were connected in order. In addition, mission effectiveness consisting of fuel consumption, the survival probability, the time required to perform the mission, and the target destruction probability was calculated based on the generated path. The proposed techniques were verified through a scenario.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.4
• /
• pp.35-45
• /
• 2000

The vertex-based boundary encoding scheme is widely used in object-based video coding area and computer graphics due to its scalability with natural looking approximation. Existing single framebased vertex encoding algorithm is not efficient for temporally correlated video sequences because it does not remove temporal redundancy. In the proposed method, a vertex point is selected from not only the boundary points of the current frame but also the vertex points of the previous frame to remove temporal redundancy of shape information in video sequences. The problem of selecting optimal vertex points is modeled as finding shortest path in the directed acyclic graph with weight The boundary is approximated by a polygon which can be encoded with the smallest number of bits for maximum distortion. The temporal redundancy between two successive frames is efficiently removed with the proposed scheme, resulting in lower bit-rate than the conventional algorithms.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2010.06a
• /
• pp.185-185
• /
• 2010

문명 발전에 의해 생활공간이 더욱더 복잡해짐에 따라 현실 세계의 3차원 공간으로서의 이해가 필요해졌고, 3차원 공간을 효율적으로 관리 및 분석하기 위하여 3차원 GIS에 대한 중요성이 대두되기 시작하였다. 현재까지의 3차원 GIS는 1990년대에 들어서 3차원 가상도시의 등장으로 도시 모델의 3차원 가시화에 대해 많은 연구가 진행되어 왔다. 이러한 3차원 가상도시는 도시 관리 차원에서 도시공간의 표현, 분석, 모델링, 시뮬레이션 등을 통하여 도시정보의 체계적이고 효율적인 관리를 가능하게 한다. 3D GIS 기술의 활용 사례로는 3차원 도시 경관 분석 및 도시 계획, 3차원 시뮬레이션, 3차원 위치기반 서비스, 도시 행정 관리 등이 있다. 3차원 도시 경관 분석 및 도시 계획 활용 분야에서는 3차원 GIS를 활용하여 새롭게 건설되는 건물들이나 토지 이용 변경에 따른 경관 분석을 가상공간에서 시뮬레이션 분석함으로써 경관 변화 예측 및 적합한 경관 설계에 대한 분석을 한다. 3차원 시뮬레이션의 경우 환경오염도 분석, 최적의 입지선정, 개발 전후의 경관 차이, 각종 재난에 따른 위험도 분석, 경관과 일조량 분석 등을 미리 가상도시에 시뮬레이션 함으로서 불필요한 업무를 줄일 수 있고 발생할 수 있는 결과 값을 예상할 수 있다. 3차원 위치기반 서비스의 경우 자신의 위치를 비교적 정확히 측정함으로서 생소한 도시를 방문하거나 위치를 찾아갈 경우 최단 경로 및 최적 경로를 탐색할 수 있다. 앞으로의 3차원 GIS 기술 동향으로 유비쿼터스 환경에서의 시공간분석(Temporal GIS)과 3차원 실내공간인지 기술 개발 등으로 볼수있다. 시공간분석은 시공간 질의를 통한 공간정보의 시간에 다른 변화 계산 또는 예측된 결과를 분석할 수 있고, 시공간 분석에 사용되는 공간적, 시간적 정보의 조합은 적어도 3차원 이상의 정보를 나타내기 때문에 필요에 따라 다양한 결과를 산출 할 수 있다. 종합적으로 시공간분석은 GIS의 분석 범위를 넓혀 주며 실시간 GIS 응용시스템 개발을 위한 주요 과업이다. 3차원 실내공간정보 표현기법과 공간분석 및 공간인지 기법을 이용한 통한 유비쿼터스 환경에서의 3차원 실내공간인지 기술 개발을 통해 최근 공간정보를 기반으로 한 위치기반서비스내 u-서비스 즉, 인간 행태의 분석, 관리 및 응용을 지원하도록 한다 이는 위치기반서비스 사용자의 주변상황에 대한 인지능력을 향상시켜주고 최근 사회적 이슈가 되고 있는 U-City의 성공여부에 직접적인 영향을 미칠것이다. 이를 위해 다음과 같은 기술개발이 수행되어야 할것이다. 첫째로, 공간인지 기술을 위한 3차원 실내공간표현 방법 개발, 둘째로, 3차원 실내공간정보를 이용한 공간분석 및 공간인지 기법 개발, 마지막으로 유비쿼터스 환경에서 3차원 실내공간인지를 위한 미들웨어 개발을 통해서 공간정보의 활용을 macro-scale 공간에서 micro-scale로 확산될 것이다. 그러므로, 본 세미나를 통해서, 3차원 GIS의 활용의 보편화와 대중화를 위해서는 3차원 데이터 획득 및 처리 방법, 3차원 공간데이타베이스, 공간 분석 및 가시화에 대한 기술적 이슈들을 논하고자 한다.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.348-357
• /
• 2007

Due to the improved performance and cost of personal mobile devices and rapid progress of wireless communication technology, the number of users who utilize these devices is increasing. This trend requires various types of services be available to users. So far, there have been many solutions provided for the shortest path problem. But, technologies which can offer various recommendation services to user depending on user’s current location are focused on Euclidean spaces rather than road network. Thus, in this paper, we extend the previous work to satisfy this requirement on road network database. Our proposed scheme requires pre-computation for the efficient query processing. In the preprocessing step, we first partition the input road network into a fixed number of Voronoi polygons and then pre-compute routing information for each polygon. In the meantime, we select the number of Voronoi polygons in proposition to the scale of road network. Through this selection, the required size of pre-computation is linearly increasing to the size of road network. Using this pre-computated information, we can process queries more quickly. Through experiments, we have shown that our proposed scheme can achieve excellent performance in terms of scheduling time and the number of visited nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4B
• /
• pp.412-421
• /
• 2011

An economic ship routing means to sail a ship with a goal of minimizing the fuel consumption by utilizing weather forecast information, and many such systems have been recently developed. Most of them assume that sailing is carried out with a constraint like a fixed output of engine-power or a fixed sailing speed. However, if the output of engine-power is controlled, it is possible to reduce the fuel consumption by sailing a ship under a relatively good weather condition. In this paper, we propose a novel economic ship routing system which can search optimal outputs of the engine-power for each part of a path by employing an evolutionary strategy. In addition, we develope an $A^*$ algorithm to find the shortest path and a method to enhance the degree of curve representation. These make the proposed system applicable to an arbitrary pair of departure and destination points. We compared our proposed system with another existing system not controlling output of the engine-power over 36 scenarios in total, and observed that the former reduced the estimated fuel consumption than the latter by 1.3% on average and the maximum 5.6% with little difference of estimated time of arrival.

• Journal of Intelligence and Information Systems
• /
• v.29 no.2
• /
• pp.101-114
• /
• 2023

In the wartime, aircraft carrying out a mission to strike the enemy deep in the depth are exposed to the risk of being shoot down. As a key combat force in mordern warfare, it takes a lot of time, effot and national budget to train military flight personnel who operate high-tech weapon systems. Therefore, this study studied the path problem of predicting the route of emergency escape from enemy territory to the target point to avoid obstacles, and through this, the possibility of safe recovery of emergency escape military flight personnel was increased. based problem, transforming the problem into a TSP, VRP, and Dijkstra algorithm, and approaching it with an optimization technique. However, if this problem is approached in a network problem, it is difficult to reflect the dynamic factors and uncertainties of the battlefield environment that military flight personnel in distress will face. So, MDP suitable for modeling dynamic environments was applied and studied. In addition, GIS was used to obtain topographic information data, and in the process of designing the reward structure of MDP, topographic information was reflected in more detail so that the model could be more realistic than previous studies. In this study, value iteration algorithms and deterministic methods were used to derive a path that allows the military flight personnel in distress to move to the shortest distance while making the most of the topographical advantages. In addition, it was intended to add the reality of the model by adding actual topographic information and obstacles that the military flight personnel in distress can meet in the process of escape and escape. Through this, it was possible to predict through which route the military flight personnel would escape and escape in the actual situation. The model presented in this study can be applied to various operational situations through redesign of the reward structure. In actual situations, decision support based on scientific techniques that reflect various factors in predicting the escape route of the military flight personnel in distress and conducting combat search and rescue operations will be possible.

• Journal of Intelligence and Information Systems
• /
• v.23 no.4
• /
• pp.111-126
• /
• 2017

Recommender systems based on association rule mining significantly contribute to seller's sales by reducing consumers' time to search for products that they want. Recommendations based on the frequency of transactions such as orders can effectively screen out the products that are statistically marketable among multiple products. A product with a high possibility of sales, however, can be omitted from the recommendation if it records insufficient number of transactions at the beginning of the sale. Products missing from the associated recommendations may lose the chance of exposure to consumers, which leads to a decline in the number of transactions. In turn, diminished transactions may create a vicious circle of lost opportunity to be recommended. Thus, initial sales are likely to remain stagnant for a certain period of time. Products that are susceptible to fashion or seasonality, such as clothing, may be greatly affected. This study was aimed at expanding association rules to include into the list of recommendations those products whose initial trading frequency of transactions is low despite the possibility of high sales. The particular purpose is to predict the strength of the direct connection of two unconnected items through the properties of the paths located between them. An association between two items revealed in transactions can be interpreted as the interaction between them, which can be expressed as a link in a social network whose nodes are items. The first step calculates the centralities of the nodes in the middle of the paths that indirectly connect the two nodes without direct connection. The next step identifies the number of the paths and the shortest among them. These extracts are used as independent variables in the regression analysis to predict future connection strength between the nodes. The strength of the connection between the two nodes of the model, which is defined by the number of nodes between the two nodes, is measured after a certain period of time. The regression analysis results confirm that the number of paths between the two products, the distance of the shortest path, and the number of neighboring items connected to the products are significantly related to their potential strength. This study used actual order transaction data collected for three months from February to April in 2016 from an online commerce company. To reduce the complexity of analytics as the scale of the network grows, the analysis was performed only on miscellaneous goods. Two consecutively purchased items were chosen from each customer's transactions to obtain a pair of antecedent and consequent, which secures a link needed for constituting a social network. The direction of the link was determined in the order in which the goods were purchased. Except for the last ten days of the data collection period, the social network of associated items was built for the extraction of independent variables. The model predicts the number of links to be connected in the next ten days from the explanatory variables. Of the 5,711 previously unconnected links, 611 were newly connected for the last ten days. Through experiments, the proposed model demonstrated excellent predictions. Of the 571 links that the proposed model predicts, 269 were confirmed to have been connected. This is 4.4 times more than the average of 61, which can be found without any prediction model. This study is expected to be useful regarding industries whose new products launch quickly with short life cycles, since their exposure time is critical. Also, it can be used to detect diseases that are rarely found in the early stages of medical treatment because of the low incidence of outbreaks. Since the complexity of the social networking analysis is sensitive to the number of nodes and links that make up the network, this study was conducted in a particular category of miscellaneous goods. Future research should consider that this condition may limit the opportunity to detect unexpected associations between products belonging to different categories of classification.