• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.4
• /
• pp.693-704
• /
• 2020

As a company's network structure is getting bigger and the number of security system is increasing, it is not easy to quickly detect abnormal traffic from huge amounts of security system events. In this paper, We propose traffic visualization analysis system(FDANT-PCSV) that can detect and analyze security events of information security systems such as firewalls in real time. FDANT-PCSV consists of Parallel Coordinates visualization using five factors(source IP, destination IP, destination port, packet length, processing status) and Sankey visualization using four factors(source IP, destination IP, number of events, data size) among security events. In addition, the use of big data-based SIEM enables real-time detection of network attacks and network failure traffic from the internet and intranet. FDANT-PCSV enables cyber security officers and network administrators to quickly and easily detect network abnormal traffic and respond quickly to network threats.

• Korean Journal of Remote Sensing
• /
• v.21 no.4
• /
• pp.329-339
• /
• 2005

In the mobile phone map service there are some restrictions of resolutions and process in terminals. So providing a sketch map is very efficient. This simplifies the map data and increases the understanding of the user. This sketched map marks the starting point and ending point. Then simplifies the surroundings like important roads or building so the user can find his/her way easily. First of all this sketch map service needs a method to simplify the route between starting point and ending point and the surroundings. After that it needs to make the simplified data into a sketch map and suitable to the terminal's resolution. To solve these problems this paper proposes a new method to manifest a sketch map efficiently through a mobile phone. The method, introduced in this paper, is surveyed to have a higher efficiency in data usage compared to the current services available in the market. And also it is examined to have a clear vision in process and easily understandable.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.69-70
• /
• 2007

최근, 궤적 정보를 이용한 많은 연구들이 진행되고 있다. 그러나 이동 객체의 실제 궤적 데이터를 획득하기는 어렵기 때문에 대부분의 연구들은 궤적 생성기에 의해 생성된 데이터를 이용하고 있다. 그러나 기존의 궤적 생성기들은 대부분 유클리디언 공간을 바탕으로 궤적을 생성하기 때문에 도로 네트워크 공간에서는 적용될 수 없다. 본 논문에서는 도로 네트워크 공간을 바탕으로 한 이동 객체의 궤적 생성 방안을 제안한다. 실제 이동 객체의 움직임과 비슷한 궤적을 생성하기 위하여 이동 객체는 출발지에서 목적지까지의 최단 경로에 근접하여 움직인다는 현실세계의 특징을 반영한다. 제안하는 기법을 이용하여 생성된 궤적 데이터는 현실 세계를 반영하면서 사용자가 원하는 궤적 데이터를 제공할 수 있기 때문에 다양한 연구에 사용될 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1B
• /
• pp.11-16
• /
• 2007

This paper describes the design and performance of a secure routing protocol with time-space cryptography for mobile ad-hoc networks. The proposed time-space scheme works in the time domain for key distribution between source and destination as well as in the space domain for intrusion detection along the route between them. For data authentication, it relies on the symmetric key cryptography due to high efficiency and a secret key is distributed using a time difference from the source to the destination. Also, a one-way hash chain is formed on a hop-by-hop basis to prevent a compromised node or an intruder from manipulating the routing information. In order to evaluate the performance of our routing protocol, we compare it with the existing AODV protocol by simulation under the same conditions. The proposed protocol has been validated using the ns-2 network simulator with wireless and mobility extensions.

• The KIPS Transactions:PartC
• /
• v.15C no.3
• /
• pp.213-220
• /
• 2008

A MANET is an autonomous, infrastructureless system that consists of mobile nodes. In MANET, on-demand routing protocols are usually used because network topology changes frequently. The current approach in case of broken routes is to flag an error and re-initiate route discovery either at the source or at the intermediate node. Repairing these broken links is a costly affair in terms of routing overhead and delay involved. Therefore, this paper propose a NAODV(Neighbor-aware AODV) protocol that stands on the basis of an AODV. It sets up the route rapidly if it operates for setting the route directly by using sequence number of neighbor nodes without re-search the route when the route to destination node is broken. Also, it reduces loss of packets. We use NS-2 for the computer simulation and validate that the proposed scheme is better than general AODV in terms of packet delivery ratio and average end-to-end delay. Also, when the proposed protocol is applied to the large ad-hoc network with multiple nodes, the performance is more efficient.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1312-1318
• /
• 2006

One of the common services of telematics is the car navigation that finds the shortest path from source to target. Until now, some routing algorithms of the car navigation do not consider the real-time traffic information and use the static shortest path algorithm. In this paper, we prosed the method to predict the traffic flow in the future. This prediction combines two methods. The former is an accumulated speed pattern, which means the analysis results for all past speeds of each road by classfying the same day and the same time inteval. The latter is the Kalman filter. We predicted the traffic flows of each segment by combining the two methods. By experiment, we showed our algorithm gave better precise predicition than only using accumulated speed pattern that is used commonly. The result can be applied to the car navigation to support a dynamic shortest path. In addition, it can give users the travel information to avoid the traffic congestion areas.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1B
• /
• pp.71-79
• /
• 2003

As the traffic grows rapidly in the Internet, the QoS guarantee of the flows and the traffic engineering problems have become very important issues. MPLS has more advantages to solve the problems than existing IP routing because of its use of multiple paths between the source and destination pairs Particularly, the availability of Constraint-based Shortest Path First(CSPF) algorithm and explicit route in MPLS made the problem referred above to be solved efficiently. However, the CSPF algorithm has the characteristic of selecting the shortest path of all paths which meet the traffics' QoS constraints Therefore, even though there are alternative paths to route traffic, alternate QoS paths may not be found and best-effort traffic will be dropped during congestion period In this paper, we present the network resource optimization method related to the traffic engineering by using load balancing through routing in MPLS network.

• Journal of the Korea Computer Graphics Society
• /
• v.30 no.3
• /
• pp.9-22
• /
• 2024

Mobility data is important to understand social phenomena and problem. Previous studies have utilized Origin-Destination (OD) visualization methods to represent human's mobility. However, the effectiveness of visualization tools as a method for understanding social phenomena remains unexplored. Therefore, in this study, we developed a visualization tool called SeoulOD-Vis to facilitate understanding social issues. It included three different modules: map visualization, condition selection, and detailed information presentation. We recruited 28 participants to evaluate the SeoulOD-Vis and compared it with a publicly available visualization tool. The results suggested that the SeoulOD-Vis had higher usability and problem-solving performances. Interview results suggested that it attributed to its 'condition selection' and 'detailed information presentation' modules. Our results will contribute to develop visualization tools to solve social problems using mobility data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.3
• /
• pp.480-490
• /
• 2018

Recently, The MRV (monitoring, reporting and verification) regulation, which measures, reports and verifies the emission gas of vessel to head for member countries of Europe Union (EU), is being implemented. As part this reason, we develop a system that estimates simple fuel consumption and recommends optimized stop-over ports of vessel, to calculate amount of carbon emission. To do this, we analyze fuel, distance and time consumption between port and the other port based on stored voyage data for over 10 years of real-ship, and implement a simple fuel consumption estimation module using analyzed result. Also, we design and implement the optimized route recommendation algorithm, existing navigation route display function including comparison with the optimized routes and user custom route plan function. Therefore, we expect the developed system is helpful when makes a navigation route and so on by reference indexes and we anticipate the system to have a sense for future research which learns and predicts for accuracy result.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.38 no.6
• /
• pp.957-965
• /
• 2018

This study presents a geographic information system based dump truck route exploring system (DRES) which provides construction managers and hauling operators with efficient route information that can improve earthmoving productivity by reducing hauling time. The system is comprised of Network Analyst from Esri as a route exploring engine and a network data model. The network data model includes information on weight limit of bridges, height limit of pedestrian overpasses, and one way that impedes dump trucks' hauling efficiency. A construction manager is expected to input origin and destination point in the user interface, and the system generates an efficient route that avoids bridges with weight limit or pedestrian overpasses with height limit. The system was applied to a real earthmoving project to test its applicability, and it was found that the system functions as intended.