• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.6
• /
• pp.589-593
• /
• 2008

These days, as a side effect of the growth of the mobile devices, malwares for the mobile devices also tend to increase and become more dangerous. Because embedded Linux is one of the advanced OSes on mobile devices, a solution to preventing malwares from infecting and destroying embedded Linux will be needed. We present a scheme using signature verification for embedded Linux that prevents executallle-Infecting malwares. The proposed scheme works under collaboration between mobile devices and a server. Malware detection is delegated to the server. In a mobile device, only integrity of all executables and dynamic libraries is checked at kernel level every time by kernel modules using LSM hooks just prior to loading of executables and dynamic libraries. All procedures in the mobile devices are performed only at kernel level. In experiments with a mobile embedded device, we confirmed that the scheme is able to prevent all executable-Infecting malwares while minimizing damage caused by execution of malwares or infected files, power consumption and performance overheads caused by malware check routines.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.5
• /
• pp.322-330
• /
• 2009

In order to utilize NAND flash memory as storage media which does not allow update-in-place and limits the number of block erase count, various garbage collection policies supporting wear-leveling have been investigated. Conventional garbage collection policies require cleaning-index calculation for the entire blocks to choose a block to be garbage-collected to support wear-leveling whenever a garbage collection is required, which results in performance degradation of system. This paper proposes a garbage collection policy which supports wear-leveling using a threshold value, which is in fact a variance of erase counts and by the maximum erase count of all blocks, without calculating the cleaning-index. During garbage collection, the erase cost is minimized by using the Greedy Policy if the variance is less than the threshold value. It achieves wear-leveling by excluding the block with the largest erase count from erase target blocks if the variance is larger than threshold value. The proposed scheme shows that a standard deviation approaches to zero as the erase count of blocks approaches to its upper limit and the measured speed of garbage collection is two times faster than the conventional schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1B
• /
• pp.1-12
• /
• 2002

In the multimedia CDMA mobile communication service, it is required to support various applications, such as voice, video, file transfer, e-mail, and Internet access, with guaranteed QoS. In the mixed traffic environment ,which consists of voice, stream data, and packet data, we analyze the network where preemptive priority is granted to delay-intolerant voice service and a buffer is offered to delay-tolerant stream data service. And, for best-effort packet data service, the access control by transmission permission probability is applied to obtain prominent throughput. To analyze the multimedia CDMA mobile communication system, we build a 2-dimensional markov chain model about prioritized-voice and stream data services and accomplish numerical analysis in combination with packet data traffic based on residual capacity equation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.1
• /
• pp.8-18
• /
• 2010

Traditional storage server suffers from duplicated data blocks which cause an waste of storage space and network bandwidth. To address this problem, various de-duplication mechanisms are proposed. Especially, lots of works are limited to backup server that exploits Contents-Defined Chunking (CDC). In backup server, duplicated blocks can be easily traced by using Anchor, therefore CDC scheme is widely used for backup server. In this paper, we propose a new de-duplication mechanism for improving a storage system. We focus on efficient algorithm for supporting general purpose de-duplication server including backup server, P2P server, and FTP server. The key idea is to adapt stride scheme on traditional fixed block duplication checking mechanism. Experimental result shows that the proposed mechanism can minimize computation time for detecting duplicated region of blocks and efficiently manage storage systems.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.4
• /
• pp.127-134
• /
• 2023

This paper describes how to port the eCos operating system and PROFINET communication stack developed based on gcc to the IAR compiler. The eCos operating system provides basic functions such as multi-thread, TCP/IP, and device driver for PROFINET operation, so there is no need to change it when developing PROFINET applications. Therefore, in this study, we reuse an eCos library built with gcc and it link with PROFINET communication stack that are ported to IAR complier. Due to the different of the gcc and IAR linker, symbol definitions and address of the constructors should be changed using the external tool that generates symbol definitions and address of the constructors from MAP file. In order to verify the proposed method, it was confirmed that the actual I/O was operating normally through PROFINET IRT communication by connecting to the Siemens PLC. IAR compiler has better performance in both the compile time and the size of the generated binary. The proposed method in this study is expected to help port various open sources as well as eCos and PROFINET communication stacks to other compilers.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.30 no.7
• /
• pp.1-10
• /
• 2002

Multidisciplinary Design Optimization (MDO) is a new design approach, which aims to reduce the design cycle and the development cost, while improving the performance of the product. In order to develop a framework software where the multidisciplinary design is possible, several methods about the analysis codes integration, the analysis and optimization process management, and the software architecture, are proposed in this study. Centralized DataBase Management System (DBMS) is adopted. Both the Dynamic Link Library(DLL) and the File Interface are suggested and implemented as analysis codes integration methods. To efficiently manage the optimization process and the data flow, the Graphic Programming approach is introduced. The proposed integration methods are verified by two test case examples: Simple house design example and the aircraft wing design problem using three dimensional Panel Code.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.18 no.1
• /
• pp.160-165
• /
• 2014

In this study, an efficiency test was performed by fabricating MEMS (Micro Electro Mechanical Systems) based 3-axis acceleration sensor modules and an earthquake monitoring system was composed. Data acquisition device (NI-9239) with a 24bit ADC (Analog to Digital Converter) was used for improving the performance of 3-axis acceleration sensor modules and filtered data (100Hz Low Pass Filter) was used for reducing noises. Also this paper focused on detecting meaningful vibration in the building by developing the earthquake monitoring software. If vector sum of 3-axis acceleration is greater than the preset value, the value will be recorded and saved to the file.

• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.45-52
• /
• 2006

To perform on-line maintenance for Distributed Information System, it is indispensable to disseminate files to participant nodes in the network. When users' requests for file deployment occur simultaneously in a short period a deployment server falls into overload phase, which is often called Flash Crowds. h common solution to avoid Flash Crowds is to increase hardware capacity. In this paper, we propose a software solution based on P2P, which does not cost any additional expense. In the proposed solution, nodes in the network are grouped into subnetworks one of which is composed of only neighboring nodes. In each subnetwork, copies of deployment files can be transferred to each other. Consequently, it brings about the effect of load balancing in deployment server. To raise the effectiveness, target files for deployment are packed into one package. Before being transferred, each package is divided into multiple equal-sized segments. A deployment server in a normal phase transmits a package requested from nodes in segment units. However a deployment server is overloaded, if segments already exist in the subnetwork participant nodes in the subnetwork receive necessary segments from neighboring nodes. In this paper, we propose data structures and algorithm for this approach and show performance improvement through simulation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.405-414
• /
• 2010

According to the statistics of SecurityFocus in 2008, client-side attacks through the Microsoft Internet Explorer have increased by more than 50%. In this paper, we have implemented a behavior-based malicious web page detection system and a blacklist-based malicious web page filtering system. To do this, we first efficiently collected the target URLs by constructing a crawling system. The malicious URL detection system, run on a specific server, visits and renders actively the collected web pages under virtual machine environment. To detect whether each web page is malicious or not, the system state changes of the virtual machine are checked after rendering the page. If abnormal state changes are detected, we conclude the rendered web page is malicious, and insert it into the blacklist of malicious web pages. The malicious URL filtering system, run on the web client machine, filters malicious web pages based on the blacklist when a user visits web sites. We have enhanced system performance by automatically handling message boxes at the time of ULR analysis on the detection system. Experimental results show that the game sites contain up to three times more malicious pages than the other sites, and many attacks incur a file creation and a registry key modification.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.33-42
• /
• 2013

In the early stage of P2P, the technology was limited to narrow usage of file sharing, but currently, P2P technology has become essential to maximize the efficiency between associated technologies without additional deployment of high costly infrastructure and also the burden of the server. Especially, P2P media streaming service is a highly attractive service to mobile users. which requires a higher quality in the mobile environment in accordance with the development of technology of wired network as well as better mobile terminals. However, P2P technology should consider the trade-off between 'peer selfishness' and QoE for providing fairness. The P2P system also try to maximize the resource utilization through an incentive mechanism for service differentiation and encourage peers to contribute continuously for improving the overall system performance. In this paper, we propose an point-based incentive mechanism based on peer's contribution level and energy availability for service differentiation. We also introduce that the proposed mechanism efficiently enhances the system performance as the peer with incentive using contribution and energy obtains more effective resource distribution.