• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.11
• /
• pp.572-580
• /
• 2007

Wireless sensor networks are sensing, computing and communication infrastructures that allow us to monitor, instrument, observe, and respond to phenomena in the harsh environment. Generally, the wireless sensor networks are composed of many deployed sensor nodes that were designed to be very cost-efficient in terms of production cost. For example, UC Berkeley's MICA motes have only 8-bit CPU, 4KB RAM, and 128KB FLASH memory space. Therefore, sensor operating systems that run on the sensor nodes should be able to operate efficiently in terms of the resource management. In this paper, we present a dynamic threads stack management scheme for space-constrained and multi-threaded sensor operating systems. In this scheme, the necessary stack space of each function is measured on compile-time. Then, the information is used to dynamically allocate and release each function's stack space on run-time. It was implemented in Nano-Qplus sensor operating system. Our experimental results show that the proposed scheme outperforms the existing fixed-size stack allocation mechanism.

• Journal of Intelligence and Information Systems
• /
• v.17 no.1
• /
• pp.1-16
• /
• 2011

The real-time ubiquitous environment is required to be able to process a series of sensor data within limited time. The whole sensor data processing consists of several phases : getting data out of sensor, acquiring context and responding to users. The ubiquitous computing middleware is aware of the context using the input sensor data and a series of data from database or knowledge-base, makes a decision suitable for the context and shows a response according to the decision. When the real-time ubiquitous environment gets a set of sensor data as its input, it needs to be able to estimate the delay-time of the sensor data considering the available resource and the priority of it for scheduling a series of sensor data. Also the sensor data of higher priority can stop the processing of proceeding sensor data. The research field for such a decision making is not yet vibrant. In this paper, we propose a queuing time computation algorithm for sensor data processing in real-time ubiquitous environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1401-1406
• /
• 2006

Mobile Ad-hoc networks have recently attracted a lot of attention in the research community as well as in industry. Although the previous research mainly focused on various of Ad-hoc in routing, we consider, in this paper, how to efficiently support applications such as variable Goocasting basd on Ad-hoc networks. The goal of a geocasting uotocol is deliver data packets to a group of nodes that are located within a specified geocasting region. Previous research that support geocast nice in mobilie computing based on Ad-hoc have the non-optimization problem of data delivery path, overhead by frequent reconstruction of the geocast tree, and service disruption problem. In this paper, we propose the mobility pattern based geocast technique using variable service range according to the nobility of destination node and resource reservation to solve this problem. The experimental results show that our proposed mechanism has improved performance of Connection & Network Overhead than previous research.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.439-448
• /
• 2009

The development of wireless communications provides mobility and accessibility to the wire communication users. Wireless sensor network is one of the leading wireless communication techniques. The security mechanism for wired network communication cannot be applied to wireless sensor network because of the limited resource and computing capability of nodes. Furthermore, communication errors frequently occur and the speed is low. Thus, efficient key management scheme is required in low-speed environment. In this paper, we proposed an efficient and secured master key-based scheme compared to the existing scheme. The advantage of our scheme is that establishing and renewing the pair-wise key is possible. In addition, it provides functions such as establishing group keys and renewing it. Furthermore, adding nodes is enabled through our scheme. The master key-based scheme can be applied to military operations and to radio communications for confidential communications.

• Journal of Satellite, Information and Communications
• /
• v.12 no.4
• /
• pp.62-66
• /
• 2017

In this paper, we present the development of communication and data processing strategy for the electromagnetic wave precipitation gauge system. The electromagnetic wave precipitation gauge system is a small system for deriving area rainfall rates within 1 km radius through dual polarization radar observation at 24GHz band. It is necessary to take consider for measurement of accurate precipitation under limited computing resources originating from small systems and to minimize the use of network for the unattended operation and remote management. To overcome computational resource limitations, we adopted the fuzzy logic for quality control to eliminate non-precipitation echoes and developed the method by weighted synthesis of various rain rate fields using multiple radar QPE formulas. Also we have designed variable data packets rules to minimize the network traffic.

• Journal of Internet Computing and Services
• /
• v.13 no.3
• /
• pp.93-105
• /
• 2012

A data stream is a series of tuples which are generated in real-time, incessant, immense, and volatile manner. As new information technologies are actively emerging, stream processing methods are being needed to efficiently handle data streams. Especially, finding out an efficient evaluation for a multi-way join would make outstanding contributions toward improving the performance of a data stream management system because a join operation is one of the most resource-consuming operators for evaluating queries. In this paper, in order to evaluate efficiently a multi-way join continuous query, we propose a novel method to decrease the cost of a query by eliminating unsuccessful intermediate results. For this, we propose a matrix-based structure for monitoring data streams and estimate the number of final result tuples of the query and find out unsuccessful tuples by matrix multiplication operations. And then using these information, we process efficiently a multi-way join continuous query by filtering out the unsuccessful tuples in advance before actual evaluation of the query.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.216-220
• /
• 2008

Sensor nodes in wireless network have several limitations such as lack of energy resource and network bandwidth. There are many researches to extend lifetime of sensor network and enhance availability. However, most of the previous researches didn't consider the mobile sink node. Those researches aren't suitable in the environment having mobile sinks. In this paper. we propose a scheme that reduces communication overheads and energy consumptions and improves reliability in routing path setup. Proposed scheme has excellent scalability without degrading performance in environment where many sink nodes exist and/or the network size is huge. Proposed scheme saves the energy consumption up to 70% in comparison with the previous grid-based and cluster-based protocol. As a result, proposed scheme increases the lifetime of sensor network and enhances availability of wireless sensor network.

• Journal of KIISE:Software and Applications
• /
• v.35 no.9
• /
• pp.538-546
• /
• 2008

It has limits that system administrator deals with many problems occurred in systems because computing environments are increasingly complex. It is issued that systems have an ability to recognize system's situations and adapt them by itself in order to resolve these limits. But it requires much experiences and knowledge to build the Self-Adaptive System. The difficulty that builds the Self-Adaptive System has been problems. This paper proposes a technique that generates automatically the codes of the Self-Adaptive System in order to make the system to be built more easily. This Self-Adaptive System resolves partially the problems about ineffectiveness of the exceeded usage of the system resource that was previous research's problem and incorrect operation that is occurred by external factors such as virus. In this paper, we applied the proposed approach to the file transfer module that is in the video conferencing system in order to evaluate it. We compared the length of the codes, the number of Classes that are created by the developers, and development time. We have confirmed this approach to have the effectiveness.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.968-972
• /
• 2009

The multi-core processors are being widely exploited by many high-end systems. With significant advances in processor architecture, the network band-width required on the high-end systems is increasing drastically. It is therefore highly desirable to manage multiple cores efficiently to achieve high network band-width with minimum resource requirements. Modern operating systems, however, still have significant design and optimization space to leverage the network performance over multi-core systems. In this paper, we suggest a novel networking process scheduling scheme, which decides the best processor affinity of networking processes based on the processor cache layout, communication intensiveness, and processor loads. The experimental results show that the scheduling scheme implemented in the Linux kernel can improve the network bandwidth and the effectiveness of processor utilization by 20% and 59%, respectively.

• KIISE Transactions on Computing Practices
• /
• v.23 no.2
• /
• pp.128-133
• /
• 2017

In recent years, the number of systems for the analysis of large volumes of data is increasing. Hadoop, a representative big data system, stores and processes the large data in the distributed environment of multiple servers, where system-resource management is very important. The authors attempted to detect anomalies from the rapid changing of the log data that are collected from the multiple servers using simple but efficient anomaly-detection techniques. Accordingly, an Apache Hive storage architecture was designed to store the log data that were collected from the multiple servers in the Hadoop ecosystem. Also, three anomaly-detection techniques were designed based on the moving-average and 3-sigma concepts. It was finally confirmed that all three of the techniques detected the abnormal intervals correctly, while the weighted anomaly-detection technique is more precise than the basic techniques. These results show an excellent approach for the detection of log-data anomalies with the use of simple techniques in the Hadoop ecosystem.