• Convergence Security Journal
• /
• v.21 no.1
• /
• pp.93-100
• /
• 2021

Damage caused by intelligent cyber attacks not only disrupts system operations and leaks information, but also entails massive economic damage. Recently, cyber attacks have a distinct goal and use advanced attack tools and techniques to accurately infiltrate the target. In order to minimize the damage caused by such an intelligent cyber attack, it is necessary to block the cyber attack at the beginning or during the attack to prevent it from invading the target's core system. Recently, technologies for predicting cyber attack paths and analyzing risk level of cyber attack using big data or artificial intelligence technologies are being studied. In this paper, a cyber attack path analysis method using attack tree and RFI is proposed as a basic algorithm for the development of an automated cyber attack path prediction system. The attack path is visualized using the attack tree, and the priority of the path that can move to the next step is determined using the RFI technique in each attack step. Based on the proposed mechanism, it can contribute to the development of an automated cyber attack path prediction system using big data and deep learning technology.

• The KIPS Transactions:PartA
• /
• v.18A no.5
• /
• pp.215-224
• /
• 2011

In this paper, a mechanism connecting all weighted migration routes with minimum cost with EGOSST is proposed. Weighted migration routes may be converted to weighted input edges considered as not only traces but also traffics or trip frequencies of moving object on communication lines, roads or railroads. Proposed mechanism can be used in more wide and practical area than mechanisms considering only moving object traces. In our experiments, edge number, maximum weight for input edges, and detail level for grid are used as input parameters. The mechanism made connection cost decrease average 1.07% and 0.43% comparing with the method using weight minimum spanning tree and weight steiner minimum tree respectively. When grid detail level is 0.1 and 0.001, while each execution time for a connecting solution increases average 97.02% and 2843.87% comparing with the method using weight minimum spanning tree, connecting cost decreases 0.86% and 1.13% respectively. This shows that by adjusting grid detail level, proposed mechanism might be well applied to the applications where designer must grant priority to reducing connecting cost or shortening execution time as well as that it can provide good solutions of connecting migration routes with weights.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.3
• /
• pp.648-654
• /
• 2010

Request operations and release operations occur repeatedly in resource allocation systems. The process requesting a resource acquires one by any priority-based mechanism, and returns the resource after some periods. In this system, resource failures lead to delay of resource allocation, or to termination of process holding the failed resource. To analyze this process effectively, this paper designs a probabilistic ACSR, a process algebra that extends ACSR with the probabilistic choice operation. The ability to express/analyze both request-release rates and failure-recovery rates is illustrated using probabilistic ACSR.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1058-1076
• /
• 2013

The WBAN(Wireless Body Area Network) supplies mobile convenience to our medical services. But if we have few effective control variables across this service deployment, the hidden distortions or defects of the system might threaten the lives and rights of the stakeholders. Therefore we need to increase the service credibility, to get WBAN effective. This study proposes a governance mechanism using feasible variables that are currently in use in practices in WBAN environments against medical incidents. Control variables were tested in Seoul National University hospital and related medical industries of South Korea. We assume that WBAN systems would be open based on integrating patients, medical employees and law enforcements to get smart theater operations against medical incidents by implementing proposed MJA(Multilateral Joint Analysis) model. MJA model also contributes to the convergence of computer systems and medical services by demonstrating flexible SOA(Service Oriented Architecture) dashboard of healthcare services with credibility factors in medicine. The important components in MJA model across WBAN, were found to be "Safety, Accuracy and Reliability" in priority order. Factor analysis, correlations and ANOVA were used to evaluate this model and an IT dashboard with a realization of mobile application, was used to support participants' decision-making.

• Journal of the Korean Society of Combustion
• /
• v.21 no.4
• /
• pp.48-60
• /
• 2016

Experimental and numerical studies were conducted to investigate flame behaviors near flammable limits for downstream-interacting SNG-air premixed flames in a counter-flow configuration. The SNG fuel consisted of a methane, a propane, and a hydrogen with volumetric ratios of 91, 6, and 3%, respectively. The most appropriate priority for some reliable reaction mechanisms examined was given to the mechanism of UC San diego via comparison of lean extinction limits attained numerically with experimental ones. Flame stability map was presented with a functional dependencies of lower and upper methane concentrations in terms of global strain rate. The results show that, at the global strain rate of $30s^{-1}$, lean extinction boundary is slanted while rich extinction one is relatively less inclined because of the dependency of such extinction boundary shapes on deficient reactant Lewis number governed by methane mainly. Further increase of global strain rate forces both extinction boundaries to be more slanted and to be shrunk, resulting in an island of extinction boundary and subsequently one flame extinction limit. Extinction mechanisms for lean and rich, symmetric and asymmetric extinction boundary were identified and discussed via heat losses and chemical interaction.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2793-2803
• /
• 2013

In H.264, three different data partition types are used, which have unequal importance to the reconstructed video quality. To improve the performance of H.264 video streaming transmission over IEEE 802.11e Wireless Local Area Networks, a prioritization mechanism that categorizes different partition types to different priority classes according to the calculated distortion within one Group of Pictures. In the proposed scheme, video streams have been encoded based on the H.264 codec with its data partition enabled. The dynamic scheduling scheme based on Enhanced Distributed Channel Access has been configured to differentiate the data partitions according to their distortion impact and the queue utilization ratio. Simulation results show that the proposed scheme improves the received video quality by 1dB in PSNR compared with the existing Enhanced Distributed Channel Access static mapping scheme.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.371-375
• /
• 2007

In this paper, we have implemented the device management system to upgrade T-PAK software in mobile phone. The hybrid scheduling method and selective upgrade method are proposed. Hybrid scheduling method is based on distribution of delivery data in accordance with network traffic load and service priority from device management server to mobile phone. Selective upgrade method manages DSL classified by T-PAK software version to be upgrade using version management established in OMA DM SCOMO. Key mechanism of selective upgrade method is to only deliver DSL to be replaced to the mobile phone. We made an experiment on two methods using MS-700T terminals. The experimental result shows that the proposed method is faster than normal from delivery time standpoint.

• The Journal of the Korea Contents Association
• /
• v.10 no.9
• /
• pp.45-56
• /
• 2010

This paper reports a new mechanism for congestion controls. The proposed congestion detection algorithm can be provided with delay and unnecessary energy consumption. Conventional congestion control methods decide congestion by queue occupancy or mean packet arrival rate of MAC layer only, however, our method can perform precise detection by considering queue occupancy and mean packet arrival rate. In addition, the congestion avoiding method according to congestion degree and scheduling method using priority for real time packets are proposed. Finally, simulation results show that proposed congestion detection and control methods outperforms conventional scheduling schemes for wireless sensor network.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.313-320
• /
• 2003

This paper design and implements a synchronized agent mechanism that be able to synchronize SFT (Slow Frequency Transaction) data among e-business processes in distributed environment. This synchronized agent system is adopted to use mobile agent to guarantee the interoperability of the distributed processes and to solve some problems at the client/server architecture and proposes a policy to synchronize data of e-business processes on the any platforms of distributed heterogeneous systems. The proposed synchronization policy is based on the time-stamp transaction with the system priority on the unicasting transportation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5729-5744
• /
• 2017

Vehicular Ad Hoc Networks (VANET) in the large-scale road section usually have typical characteristics of large number of vehicles and unevenly distribution over geographic spaces. These two inherent characteristics lead to the unsatisfactory performance of VANETs. This poor performance is mainly due to fragile communication link and low dissemination efficiency. We propose a novel routing mechanism to address the issue in the paper, which includes a competition-based routing discovery with priority metrics and a local routing repair strategy. In the routing discovery stage, the algorithm uses adaptive scheme to select a stable route by the priorities of routing metrics, which are the length of each hop, as well as the residual lifetime of each link. Comparisons of different ratios over link length and link stability further show outstanding improvements. In the routing repair process, upstream and downstream nodes also compete for the right to establish repair process and to remain as a member of the active route after repair. Our simulation results confirm the improved performance of the proposed algorithm.