• The KIPS Transactions:PartB
• /
• v.10B no.1
• /
• pp.1-12
• /
• 2003

In this paper, we Introduce the Unreal Tournament (UT) game and the Gamebots system. The former it a well-known 3D first-person action game and the latter is an intelligent agent research testbed based on UT And then we explain the design and implementation of KGBot, which is an intelligent non-player character deploying effectively within the 3D virtual environment provided by UT and the Gamebots system. KGBot is a bot client within the Gamebots System. KGBot accomplishes its own task to find out and dominate several domination points pro-located on the complex surface map of 3D virtual environment KGBot adopts UM-PRS as its control engine, which is a general BDI agent architecture. KGBot contains a hierarchical knowledge base representing its complex behaviors in multiple layers. In this paper, we explain details of KGBot's Intelligent behaviors, tuck af locating the hidden domination points by exploring the unknown world effectively. constructing a path map by collecting the waypoints and paths distributed over the world, and finding an optimal path to certain destination based on this path graph. Finally we analyze the performance of KGBot exploring strategy and control engine through some experiments on different 3D maps.

• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.91-98
• /
• 2004

This study focuses on the development of dynamic assignment for evaluation and application for dynamic route guidance strategy. Travelers are classified according to information contents which they received pre/on trip. The first group have no traffic information, so they travel with fixed route. The second group have real-time shortest path and travel according to it. The last group have car navigation system or individual method(cellular phone, PDA-two way communication available) for traffic information on trip. And then they are assigned in accordance with the proposed multiclass dynamic assignment model. At this time the last group is gotten under control with DFS(decentralized feedback strategy). In use of this Process we expect that various traffic information strategy can be tested and also be the key factor for success of ITS, location of VMS(variable message sign), cycle of information, area of traffic information, etc).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.239-243
• /
• 2011

In wireless ad-hoc network, the detection of link breakage and re-establishing the route path causes lots of network overhead and results in communication delay. In the LBN method, the node causing a link breakage actively sends a message to neighbors so that they can instantly start re-establishing process of new path. In this paper we describe the result of network simulation we performed using NS2 to show the effectiveness of LBN method.

• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.61-68
• /
• 2010

As the mobile technology advances, file searching among the mobile device users becomes more important. In this paper, we propose the uniform grid, greedy, and MIS P2P systems that have double-layered topology to search files efficiently for mobile ad-hoc networks. In these systems, peers are classified into two groups, super-peers and sub-peers, and each super-peer manages its neighboring sub-peers. In the proposed systems, each super-peer maintains the appropriate information of its sub-peers so that when a peer requests a file, the request is sent to its super-peers and then to neighboring super-peers. Hence the proposed systems could avoid multi-broadcasting and reduce network overheads. The experimental results show that the proposed systems outperform a single-layered P2P system in terms of the average number of messages to find target files. Especially the MISsystem improves by reducing the average number of messages by 48.9% while maintaining the same search accuracy.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.201-208
• /
• 2005

Recently, the container terminal requires the study of method to increase efficiency through change of its operation method. Loading plan is a very important part to increase the efficiency of container terminal. Loading Plan is largely divided into two cases, deciding loading location and loading scheduling and this Paper proposes a more efficient method of container loading scheduling. Container loading scheduling is a problem of combination optimization to consider several items of loading location and operation equipments. etc. An existing method of cluster composition that decides the order of container loading scheduling has a restriction to increase the efficiency of work owing to rehandling problem. Therefore, we Propose a more efficient method of container loading scheduling which composes containers with identical attribution, based on ship loading list and yard map, into stack units of cluster, applying to hierarchical clustering method, and defines the restriction of working order. In this process, we can see a possible working path among clusters by defining the restriction of working order and search efficiency will be increased because of restricted search for working path.

• Journal of the Korea Society for Simulation
• /
• v.16 no.3
• /
• pp.49-56
• /
• 2007

There are many application areas of wireless sensor networks, such as combat field surveillance, terrorist tracking and highway traffic monitoring. These applications collect sensed data from sensor nodes to monitor events in the territory of interest. One of the important issues in these applications is the existence of the radio-jamming zone between source nodes and the base station. Depending on the routing protocol the transmission of the sensed data may not be delivered to the base station. To solve this problem we propose a genetic algorithm based routing method for reliable transmission while considering the balanced energy depletion of the sensor nodes. The genetic algorithm finds an efficient routing path by considering the radio-jamming zone, energy consumption needed fur data transmission and average remaining energy level. The fitness function employed in genetic algorithm is implemented by applying the fuzzy logic. In simulation, our proposed method is compared with LEACH and Hierarchical PEGASIS. The simulation results show that the proposed method is efficient in both the energy consumption and success ratio of delivery.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.323-326
• /
• 2013

최근 지능형 교통 시스템 (ITS) 에 대한 관심이 증가함에 따라 ITS 응용을 지원해 줄 수 있는 차량 에드혹 네트워크 (VANET, Vehicular Ad-Hoc Network) 기술이 주요 이슈로 대두되고 있다. 특히 트랜스포트 계층에서는 종단간 신뢰성이 요구되는 ITS 응용들을 지원하기 위해 TCP를 적용할 필요가 있다. 하지만 VANET 환경에서 TCP는 혼잡 제어 기능의 오동작, 이동성에 의한 경로 재설정 오버헤드, 경쟁(contention) 등으로 인해 throughput을 불필요하게 감소시킬 수 있다. 따라서 VANET 환경에서 TCP 성능을 향상시킬 수 있는 다양한 기법들에 대한 연구가 진행되고 있다. 본 논문에서는 이러한 기법들을 크게 혼잡 탐색 기법, cross-layer 기법으로 나누어 대표적인 두 가지 기법들을 각각 비교, 분석한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.6
• /
• pp.1121-1125
• /
• 2022

HAL-Fuzz, a fuzzing technique to find firmware vulnerabilities, is efficient by using the HAL function of the hardware abstraction layer provided by MCU vendors. However, it cannot handle most firmware that unused the exact HAL function. In this paper, we propose a new method for identifying pseudo-HAL functions to increase the fuzzing availability of HAL-Fuzz. In experiments, we identified not only the HAL but also the pseudo-HAL functions, implemented by the developer, and that fuzzing is possible.

• 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 Internet Computing and Services
• /
• v.8 no.5
• /
• pp.133-140
• /
• 2007

Currently, as the requirement for high quality Internet access from anywhere at anytime is consistently increasing, the interconnection of pure ad hoc networks to fixed IP networks becomes increasingly important. Such integrated network, referred to as hybrid ad hoc networks, can be extended to many applications, including Sensor Networks, Home Networks, Telematics, and so on. We focus on some data communication problems of hybrid ad hoc networks, such as broadcasting and routing. In particular. power failure of mobile terminals is the most important factor since it affects the overall network lifetime. We propose an energy-efficient routing protocol based on clustering for hybrid ad hoc networks. By applying the index-based data broadcasting and selective tuning methods, the infra system performs the major operations related to clustering and routing on behalf of ad hoc nodes. The proposed scheme reduces power consumption as well as the cost of path discovery and maintenance, and the delay required to configure the route.