• Journal of the Korea Society for Simulation
• /
• v.13 no.4
• /
• pp.55-69
• /
• 2004

In MANET(Mobile Ad-hoc Network), unlike in wired networks, a path configuration should be in advance of data transmission along a routing path. Frequent movement of mobile nodes, however, makes it difficult to maintain the configured path and requires re-configuration of the path very often. It may also leads to serious problems such as deterioration of QoS in mobile ad-hoc networks. In this paper, we proposed a Reactive Routing Keyword (RRK) routing procedure to solve those problems. Firstly, we noticed it is possible in RRK routing to assign multiple routing paths to the destination node. We applied this feature into active networks and SNMP information based routing by storing unique keywords in cache of mobile nodes corresponding to present and candidate routings in a path configuration procedure. It was shown that the deterioration of QoS which may observed in Dynamic Source Routing(DSR) protocol was greatly mitigated by using the proposed routing technique.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4C
• /
• pp.559-569
• /
• 2004

It has become more difficult to correspond an cyber attack quickly as a pattern of attack becomes various and complex. And, current security mechanisms just have passive defense functionalities. In this paper, we propose new network security architecture to respond various cyber attacks rapidly and to chase and isolate the attackers through cooperation between security zones. The proposed architecture make possible to deal effectively with cyber attacks such as IP spoofing or DDoS(Distributed Denial of Service) using active packet technology including a mobile sensor on active network. Active Security Management System based on proposed security architecture consists of active security node and active security server in a security zone, and is designed to have more active correspondent than that of existing mechanisms. We implemented these mechanisms in Linux routers and experimented on a testbed to verify realization possibility of Active Security Management System. The experimentation results are analyzed.

• Biomaterials and Biomechanics in Bioengineering
• /
• v.2 no.3
• /
• pp.143-157
• /
• 2015

Successful integration of cementless femoral stems using porous surfaces relies on effective periimplant bone healing to secure the bone-implant interface. The initial stages of the healing process involve protein adsorption, fibrin clot formation and cell osteoconduction onto the implant surface. Modelling this process in vitro, the current work considered the effect of fibrin deposition on the responses of human mesenchymal stromal cells cultured on ferritic fibre networks intended for magneto-mechanical actuation of in-growing bone tissue. The underlying hypothesis for the study was that fibrin deposition would support early stromal cell attachment and physiological functions within the optimal regions for strain transmission to the cells in the fibre networks. Highly porous fibre networks composed of 444 ferritic stainless steel were selected due to their ability to support human osteoblasts and mesenchymal stromal cells without inducing untoward inflammatory responses in vitro. Cell attachment, proliferation, metabolic activity, differentiation and penetration into the ferritic fibre networks were examined for one week. For all fibrin-containing samples, cells were observed on and between the metal fibres, supported by the deposited fibrin, while cells on fibrin-free fibre networks (control surface) attached only onto fibre surfaces and junctions. Initial cell attachment, measured by analysis of deoxyribonucleic acid, increased significantly with increasing fibrinogen concentration within the physiological range. Despite higher cell numbers on fibrin-containing samples, similar metabolic activities to control surfaces were observed, which significantly increased for all samples over the duration of the study. It is concluded that fibrin deposition can support the early attachment of viable mesenchymal stromal cells within the inter-fibre spaces of fibre networks intended for magneto-mechanical strain transduction to in-growing cells.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2010.05a
• /
• pp.457-458
• /
• 2010

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5A
• /
• pp.372-380
• /
• 2009

In this paper, we analyze the active RFID systems ISO/IEC 18000-7 and ISO/IEC 18000-4. In order to improve the coverage in sensor networks, which consist active RFID tag, we propose RFID multi-hop relay system using active RFID relay tag. To compare the performance between the existing ISO/IEC 18000-7 system and the proposed RFID multi-hop relay system, we introduce new system efficiency measure and sensitivity-based measure of achieved coverage. Also, we analyze the performance of the proposed system and compare it with that of the existing system through MCL (Minimum Coupling Loss) analysis and SLS (System Level Simulation) analysis.

• Journal of the Korean Regional Science Association
• /
• v.13 no.2
• /
• pp.55-74
• /
• 1997

This paper investigates the spatial characteristics of networks, which arise as a firm's strategy to enhance its competitiveness to cope with the changing economic environments characterized by technological changes and increasing competitiveness. The theoretical framework in this study proposes that networks emerge as a firm's strategies to promote its competitiveness through the vertical/horizontal disintegration of the production system. Futhermore, regional industries of networks. The study examines the types of cooperation and the spatial boundary of the computer industry networks in Korea. Questionnaire survey was conducted on 1, 128 computer companies which had more than 10 employees, with 126 questionnaires being used for analysis. In addition, newpaper articles were used to supplement the foregoing work on network characteristics. The review of these articles covers the period from Jan. 1994 to June 1996. Major findings of this study are as follows: The spatial range of cooperative networks varies according to the specific characters of cooperation(R & D, production, and seles). Intralocal networks are being developed in Kangnam and Youido area, the computer industry agglomeration clusres of Seoul. There are the regional differnces in the agents and contents of cooperation. In intra-national R & D and production networks, regional differnces in agglomeratins and non-agglomerations are not detercted. Most networks of this type are found between large firms and small firms. In contrast, foregn R & D and production networks, which are operated mostly by large firms, are found in Kangnam, Youido, and CBD. Intra-national and foreign productino networks are also focused in Kangnam, Youido, and CBD. Small firms are playing an active role in making this type of cooperation possible. In the perspective of localization-globalization, Korean computer industry can be analyzed in two respects: industrial and regional. The localization of small firms and the localization-globalization of large firms' networks are being developed in industrial contexts, while the localization-globalization of agglomerations and the localization of non-agglomerations networks are being developed in regional contexts. As networks for the localization-globalization of industry are growing in agglomerations, interfirm networks could be related to trends in the formation or intensification of industrial agglomerations. industrial agglomeration areas function as a facilitator of localization through subcontracts, intraregional network and interregional network. They also facilitate globalization via foregn networks. In non-agglomeratin areas, localization networks, which are connected with agglomeration areas via subcontracting, interregional R & D. or production cooperation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.1113-1116
• /
• 2003

무선 네트워크를 통해 인터넷에 접속하려는 이동노드 수가 늘어남에 따라 다수의 이동노드에게 무선 서비스를 제공해야하는 HA(Hone Agent)와 FA(Foreign Agent)에서의 부하도 함께 증가하고 있다. 특히 지역적 등록(Regional Registration)에서와 같이 투선 네트워크 도메인의 최상위 FA가 현재 도메인에 로밍한 모든 이동노드의 COA로 동작함으로 인해 발생하는 부하는 최상위 FA에서 혼잡 및 지연의 원인이 된다. 이에 본 논문에서는 최상위 FA에서 발생말 수 있는 부하를 하위 FA에게 분산하기 위하여 두 가지 접근방법인 Passive Approach와 Active Approach를 제안한다 Passive Approach는 부모 FA가 부하 분산 시점을 결정하여 자식 FA에게 분산해주는 기법이고 Active Approach는 임의의 FA가 스스로 분산 시점을 결정하여 상위 FA에서 발생할 수 있는 부하를 완화시켜주는 기법이다. 시뮬레이션을 통해 Active Approach의 한 형태를 띠고 있는 기존 연구인 LNSP 기법과 성능을 비교하여 가장 효율적인 부하 분산 방법을 제시한다.

• The Journal of the Acoustical Society of Korea
• /
• v.42 no.4
• /
• pp.329-344
• /
• 2023

In this study, we comprehensively analyze the generalization performance of various deep learning-based active sonar target classifiers when applied to small and imbalanced active sonar datasets. To generate the active sonar datasets, we use data from two different oceanic experiments conducted at different times and ocean. Each sample in the active sonar datasets is a time-frequency domain image, which is extracted from audio signal of contact after the detection process. For the comprehensive analysis, we utilize 22 Convolutional Neural Networks (CNN) models. Two datasets are used as train/validation datasets and test datasets, alternatively. To calculate the variance in the output of the target classifiers, the train/validation/test datasets are repeated 10 times. Hyperparameters for training are optimized using Bayesian optimization. The results demonstrate that shallow CNN models show superior robustness and generalization performance compared to most of deep CNN models. The results from this paper can serve as a valuable reference for future research directions in deep learning-based active sonar target classification.

• ETRI Journal
• /
• v.23 no.4
• /
• pp.158-167
• /
• 2001

We examine the diffusion layers of some block ciphers referred to as substitution-permutation networks. We investigate the practical and provable security of these diffusion layers against differential and linear cryptanalysis. First, in terms of practical security, we show that the minimum number of differentially active S-boxes and that of linearly active S-boxes are generally not identical and propose some special conditions in which those are identical. We also study the optimal diffusion effect for some diffusion layers according to their constraints. Second, we obtain the results that the consecutive two rounds of SPN structure provide provable security against differential and linear cryptanalysis, i.e., we prove that the probability of each differential (resp. linear hull) of the consecutive two rounds of SPN structure with a maximal diffusion layer is bounded by $p^n(resp.q^n)$ and that of each differential (resp. linear hull) of the SDS function with a semi-maximal diffusion layer is bounded by $p^{n-1}(resp. q^{n-1})$, where p and q are maximum differential and linear probabilities of the substitution layer, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.213-224
• /
• 2009

Most of existing routing methods in wireless sensor networks to counter the local eavesdropping-based packet-tracing deal with a single asset and suffer from the packet-delivery latency as they prefer to take a separate path of many hops for each packet being sent. Recently, the author proposed a routing method, GSLP-w(GPSR-based Source-Location Privacy with crew size w), that enhances location privacy of the packet-originating node(i.e., active source) in the presence of multiple assets, yet taking a path of not too long. In this paper, we present a refined routing(i.e., next-hop selection) procedure of it and empirically study privacy strength and delivery latency with varying the crew size w(i.e., the number of packets being sent per path). It turns out that GSLP-w offers the best privacy strength when the number of packets being sent per path is randomly chosen from the range [$1,h_{s-b}/4$] and that further improvements on the privacy are achieved by increasing the random walk length TTLrw or the probability prw that goes into random walk(where, $h_{s-b}$ is the number of hops of the shortest path between packet-originating node s and sink b).