• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.1
• /
• pp.36-43
• /
• 2013

This paper provides an overview of the security in the System Architecture Evolution (SAE) / Long-Term Evolution (LTE) system. Security is an integral part of SAE/LTE with improvements over the Third Generation (3G) system. This paper reviews the SAE/LTE system architecture, and discusses the security requirements, algorithms, Authentication and Key Agreement (AKA), Security Mode Command (SMC), key hierarchy and security for mobility.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.11 no.3
• /
• pp.207-220
• /
• 2011

Coarse-grained reconfigurable architecture (CGRA) based embedded systems aims to achieve high system performance with sufficient flexibility to map a variety of applications. However, the CGRA has been considered as prohibitive one due to its significant area/power overhead and performance bottleneck. In this work, I propose reconfigurable multi-array architecture to reduce power/area and enhance performance in configurable embedded systems. The CGRA-based embedded systems that consist of hierarchical configurable computing arrays with varying size and communication speed were examined for multimedia and other applications. Experimental results show that the proposed approach reduces on-chip area by 22%, execution time by up to 72% and reduces power consumption by up to 55% when compared with the conventional CGRA-based architectures.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.2 no.4
• /
• pp.233-241
• /
• 2007

In an ubiquitous environment, for controlling user access according to environment of users, a number of access control models enforcing dynamic environment of users have been proposed. However, they do not support personalized environments of each user and have a run-time overhead of searching active roles. In this paper, we propose a new model, PE-RBAC, that extends the RBAC architecture by addition of a personalized environment component as a constraint to accommodate dynamic and mobile users. In this model, a dynamic role activation is presented by using a new role-to-environment structure instead of the conventional role hierarchy, which makes it efficient to find the active roles according to a user's personalized environment.

• The Journal of Korea Robotics Society
• /
• v.6 no.4
• /
• pp.353-364
• /
• 2011

In ubiquitous computing environments, users want to receive the robot services regardless of various physical status or devices such as time, place, various sensors, and high-performance servers. Thus, the ubiquitous service robots have to provide users with automated services according to situational information that they properly recognize. Beyond these problems, robot software has to establish a foundation to support the functions with the network infrastructure that are not able to be solved by a single independent resource. On the basis of a robot middleware that is capable of minimizing dependencies among hierarchy structures, the robot software also has to provide execution environment to control the flow of robot application services. In this paper, we propose a layered architecture to provide users with automated services through ubiquitous robots. The proposed architecture is based on CAWL (Context-Aware Workflow Language) and RSEL (Robot Services Execution Language). CAWL easily represents the flow of robot services from user application service levels, and RSEL is able to support the composition and reusability of robot services through abstraction of robot device services. In our experiments, we applied the proposed architecture to an example of "booth guide robot service".

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.3
• /
• pp.563-577
• /
• 2017

Due to the Internet and computing capability, new and variant malware are discovered around 1 Million per day. Companies use dynamic analysis such as behavior analysis on virtual machines for unknown malware detection because attackers use unknown malware which is not detected by signature based AV effectively. But growing number of malware types are not only PE(Portable Executable) but also non-PE such as MS word or PDF therefore dynamic analysis must need more resources and computing powers to improve detection effectiveness. This study elicits the pre-filtering system evaluation factor to improve effective dynamic malware analysis system and presents and verifies the decision making model and the formula for solution selection using AHP(Analytics Hierarchy Process)

• Journal of Information Processing Systems
• /
• v.16 no.4
• /
• pp.845-858
• /
• 2020

This paper proposes a modified end-to-end secure low energy adaptive clustering hierarchy (ME-LEACH) algorithm for enhancing the lifetime of a wireless sensor network (WSN). Energy limitations are a major constraint in WSNs, hence every activity in a WSN must efficiently utilize energy. Several protocols have been introduced to modulate the way a WSN sends and receives information. The end-to-end secure low energy adaptive clustering hierarchy (E-LEACH) protocol is a hierarchical routing protocol algorithm proposed to solve high-energy dissipation problems. Other methods that explore the presence of the most powerful nodes on each cluster as cluster heads (CHs) are the sparsity-aware energy efficient clustering (SEEC) protocol and an energy efficient clustering-based routing protocol that uses an enhanced cluster formation technique accompanied by the fuzzy logic (EERRCUF) method. However, each CH in the E-LEACH method sends data directly to the base station causing high energy consumption. SEEC uses a lot of energy to identify the most powerful sensor nodes, while EERRCUF spends high amounts of energy to determine the super cluster head (SCH). In the proposed method, a CH will search for the nearest CH and use it as the next hop. The formation of CH chains serves as a path to the base station. Experiments were conducted to determine the performance of the ME-LEACH algorithm. The results show that ME-LEACH has a more stable and higher throughput than SEEC and EERRCUF and has a 35.2% better network lifetime than the E-LEACH algorithm.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.7
• /
• pp.775-787
• /
• 2010

Unlike general-purpose CPUs, the GPUs have been specialized as many-core streaming processors, and are frequently replacing the CPUs in an increasing range of computations thanks to their outstanding parallel computing capacity. In order to respond to such trend, NVIDIA has recently issued a new parallel computing architecture called CUDA(Compute Unified Device Architecture), offering a flexible GPU programming environment for GPGPU(General Purpose GPU) computing. In general, when programmers use the CUDA API, they should clearly understand many aspects of GPU's computing architecture to produce efficient parallel software. In this article, we explain several optimization techniques for CUDA programming that we have verified through a lot of experiment and trial and error, and review how those techniques affect the performance of code execution. In particular, we use a specific problem as an example to analyze several elements that affect performances, such as effective accesses to hierarchical memory system, processor occupancy, and latency hiding. In conclusion, we present several directions that may be utilized effectively in CUDA-based parallel programming.

• Journal of Internet Computing and Services
• /
• v.16 no.5
• /
• pp.75-86
• /
• 2015

Internet of Thing (IoT) computing is an environment where various devices with sensors and actuators are connect, and interact together to acquire contexts and provide useful services. With the advances of IoT technologies, its usability becomes an in important issue. However, there exist various types of faults in IoT computing which are not conventionally addressed in software research community. Providing reliable IoT services is challenging. In this paper, we present a hierarchy of IoT faults and analyze causes and symptoms of the faults. Based on the analysis, we define effective methods for managing IoT faults. We believe that our proposed framework for managing IoT faults can be utilized in reducing the development cost of IoT applications and enhancing the quality of the applications.

• Journal of Digital Convergence
• /
• v.11 no.5
• /
• pp.31-39
• /
• 2013

Smart TV is a television set with internet capabilities, computing ability, and broadcasting service that increases user interactions. Usability has been regarded as one of the most important criteria for measuring and evaluating smart TV. To evaluate smart TV from the perspective of usability, we first need to develop a measurement model by determining the major factors affecting usability, which become a measurement the evaluation criteria of the model. The objective of this paper is to suggest an AHP(Analytic Hierarchy Process) model for measuring usability of smart TV. Factors affecting usability are described from the prior research. We show how the judgment data is acquired and the usability score is computed by an numerical example.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.5
• /
• pp.656-662
• /
• 2018

Pattern matching algorithm is widely used in many application fields such as bio-informatics, intrusion detection, etc. Among many string matching algorithms, KMP (Knuth-Morris-Pratt) algorithm is commonly used because of its fast execution time when using large texts. However, the processing speed of KMP algorithm is also limited when the text size increases significantly. In this paper, we propose a high throughput parallel KMP algorithm considering CPU-GPU memory hierarchy based on OpenCL in GPGPU (General Purpose computing on Graphic Processing Unit). We focus on the optimization for the allocation of work-times and work-groups, the local memory copy of the pattern data and the failure table, and the overlapping of the data transfer with the string matching operations. The experimental results show that the execution time of the optimized parallel KMP algorithm is about 3.6 times faster than that of the non-optimized parallel KMP algorithm.