Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The KIPS Transactions:PartC
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 16C, Issue 6 - Dec 2009
Volume 16C, Issue 5 - Oct 2009
Volume 16C, Issue 4 - Aug 2009
Volume 16C, Issue 3 - Jun 2009
Volume 16C, Issue 2 - Apr 2009
Volume 16C, Issue 1 - Feb 2009
Selecting the target year
Implementation and Performance Analysis of Efficient Packet Processing Method For DPI (Deep Packet Inspection) System using Dual-Processors
Yang, Joon-Ho ; Han, Seung-Jae ;
The KIPS Transactions:PartC, volume 16C, issue 4, 2009, Pages 417~422
DOI : 10.3745/KIPSTC.2009.16-C.4.417
Implementation of DPI(Deep Packet Inspection) system on a general purpose multiprocessor platform is an attractive option from the implementation cost point of view, since it does not require high-cost customized hardware. Load balancing has been considered as a primary means to achieve high performance in multi processor systems. We claim, however, that in case of DPI system design simply balancing the load of each processor does not necessarily yield the highest system performance. Instead, we propose a method in which tasks are allocated to processors based on their functions. We implemented the proposed method in dual processor Linux system and compare its performance with the existing load balancing methods. Under the proposed method, one processor is dedicated to deal with interrupt handling and generic packet processing, while another processor is dedicated to DPI processing. According to experimental results, the proposed scheme outperforms the existing schemes by 60%, mainly because of the reduction of cache miss and spin lock occurrences.
A Survey of Code Dissemination Mechanisms on Sensor Networks
Kim, Mi-Hui ; Kim, Ji-Sun ; Kim, Jee-Hyun ; Lim, Ji-Young ; Chae, Ki-Joon ;
The KIPS Transactions:PartC, volume 16C, issue 4, 2009, Pages 423~438
DOI : 10.3745/KIPSTC.2009.16-C.4.423
The sensor network is highlighted because it is one of the essentialbase networks in the ubiquitous computing realization. Researches for providing security and efficiency are being perfomed in the various isuues because of the characteristics of sensor nodes and sensor networks. Recently, code dissemination mechanism is recognized as an important research issue since sensor nodes are in the need of updating new software or the need of modifying bugs in dynamically. Generally lots of nodes are in the sensor networks and they are ramdomly deployed in hostile environments. Thus it is especially important that the code dissemination from the base station to nodes should be processed efficienctly and securely. In this paper, we check up the recent existing code dissemination mechanisms, and comparatively analyze the requirements of the code dissemination and the characteristicsof existing mechanisms. Through the analysis, we present future research issues for the code dissemination area. This research can expedite the research on the code dissemination and improve the usability of sensor networks with efficiency and security.
A Key Management Scheme for Radio Frequency Communication Environment
Kim, Song-Yi ; Lee, Kwang-Woo ; Jeong, Han-Jae ; Cho, Young-Jun ; Cha, Wook-Jae ; Kim, Seung-Joo ; Won, Dong-Ho ;
The KIPS Transactions:PartC, volume 16C, issue 4, 2009, Pages 439~448
DOI : 10.3745/KIPSTC.2009.16-C.4.439
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.
An Improved Signature Hashing Algorithm for High Performance Network Intrusion Prevention System
Ko, Joong-Sik ; Kwak, Hu-Keun ; Wang, Jeong-Seok ; Kwon, Hui-Ung ; Chung, Kyu-Sik ;
The KIPS Transactions:PartC, volume 16C, issue 4, 2009, Pages 449~460
DOI : 10.3745/KIPSTC.2009.16-C.4.449
The signature hashing algorithm provides the fast pattern matching speed for network IPS(Intrusion Prevention System) using the hash table. It selects 2 bytes from all signature rules and links to the hash table by the hash value. It has an advantage of performance improvement because it reduces the number of inspecting rules in the pattern matching. However it has a disadvantage of performance drop if the number of rules with the same hash value increases when the number of rules are large and the corelation among rules is strong. In this paper, we propose a method to make all rules distributed evenly to the hash table independent of the number of rules and corelation among rules for overcoming the disadvantage of the signature hashing algorithm. In the proposed method, it checks whether or not there is an already assigned rule linked to the same hash value before a new rule is linked to a hash value in the hash table. If there is no assigned rule, the new rule is linked to the hash value. Otherwise, the proposed method recalculate a hash value to put it in other position. We implemented the proposed method in a PC with a Linux module and performed experiments using Iperf as a network performance measurement tool. The signature hashing method shows performance drop if the number of rules with the same hash value increases when the number of rules are large and the corelation among rules is strong, but the proposed method shows no performance drop independent of the number of rules and corelation among rules.
Development Testing/Evaluating Methods about Security Functions based on Digital Printer
Cho, Young-Jun ; Lee, Kwang-Woo ; Cho, Sung-Kyu ; Park, Hyun-Sang ; Lee, Hyoung-Seob ; Lee, Hyun-Seung ; Kim, Song-Yi ; Cha, Wook-Jae ; Jeon, Woong-Ryul ; Won, Dong-Ho ; Kim, Seung-Joo ;
The KIPS Transactions:PartC, volume 16C, issue 4, 2009, Pages 461~476
DOI : 10.3745/KIPSTC.2009.16-C.4.461
Digital Printers that are mainly used in enterprises and public institutions are compound machinery and tools which are combined into various functions such as printing, copying, scanning, and fax so on. Digital Printers has security functionality for protecting the important data related with confidential industry technology from leaking. According to the trends, CC(Common Criteria) evaluation and assurance about digital printer is on progress in Japan and USA. Domestically CC evaluation and assurance is started recently. However, the know-how about the digital printer evaluation is not enough and the developers and the evaluators have difficulty in CC evaluation of digital printer products in the country. Therefore, the testing method of digital printer security functionality and evaluation technology is essentially needed for increasing demand for the evaluation afterwards. In this study, we analyze the security functionality and developing trends of digital printer products from internal and external major digital printer companies. Moreover, we research the characters of each security functions and propose guideline for digital printer security functionality evaluation and vulnerability testing methods.
IPS-based Dynamic Bandwidth Allocation Algorithm with Adaptive Maximum Transmission Window to Increase Channel Utilization in EPON
Cho, Seung-Moo ; Oh, Chang-Yeong ; Chung, Min-Young ; Choo, Hyun-Seung ; Lee, Tae-Jin ;
The KIPS Transactions:PartC, volume 16C, issue 4, 2009, Pages 477~486
DOI : 10.3745/KIPSTC.2009.16-C.4.477
This paper proposes a dynamic bandwidth allocation (DBA) algorithm with adaptive maximum transmission window (DBA-AMTW) to increase channel utilization in Ethernet passive optical networks (EPONs). A polling mechanism in EPON determines channel utilization and puts constraints on DBA algorithm and scheduling. DBA algorithms based on interleaved polling with stop (IPS) allocate transmission windows to optical network units (ONU) considering requests of all ONUs. However channel idle time when any ONU does not transmit packets decreases channel utilization. Proposed DBA-AMTW improves efficiency of a network and allocates transmission windows effectively by appropriate DBA computation from REPORT messages of all ONUs. An adaptive maximum transmission window for each ONU determined by a DBA computation in the previous scheduling cycle. Simulation results show that the proposed DBA algorithm improves performance of throughput and average delay time.
Design of VCR Functions With MPEG Characteristics for VOD based on Multicast
Lee, Joa-Hyoung ; Jung, In-Bum ;
The KIPS Transactions:PartC, volume 16C, issue 4, 2009, Pages 487~494
DOI : 10.3745/KIPSTC.2009.16-C.4.487
VOD(Video On Demand) that provides streaming service according to the user's requirement in real time, consists of the video streaming server and the client system. Since it is very hard to apply the traditional server-client model that a server communicates with many clients through 1:1 connection to VOD system because it requires very high network bandwidth, many researches have been done to address this problem. Batching technique is one of VOD system based on Multicast that requires very small network bandwidth. However, the batching based VOD system has a limitation that it is very hard to provide VCR(Video Cassette Recorder) ability. In this paper, we propose a technique that reduces the required network bandwidth to provide VCR function by using the characteristic of MPEG, one of international video compression standard. In the proposed technique, a new video stream for VCR function is constructed with I pictures that is able to be decoded independently. The new video stream for VCR function is transmitted with the video stream for normal play together in Batching manner. The performance evaluation result shows that the proposed technique not only reduces the required network bandwidth and memory usage but also decreases the CPU usages.
An Energy Efficient Cluster-Based Local Multi-hop Routing Protocol for Wireless Sensor Networks
Kim, Kyung-Tae ; Youn, Hee-Yong ;
The KIPS Transactions:PartC, volume 16C, issue 4, 2009, Pages 495~504
DOI : 10.3745/KIPSTC.2009.16-C.4.495
Wireless sensor networks (WSN) consisting of a largenumber of sensors aims to gather data in a variety of environments and is beingused and applied in many different fields. The sensor nodes composing a sensornetwork operate on battery of limited power and as a result, high energyefficiency and long network lifetime are major goals of research in the WSN. Inthis paper we propose a novel cluster-based local multi-hop routing protocolthat enhances the overall energy efficiency and guarantees reliability in thesystem. The proposed protocol minimizes energy consumption for datatransmission among sensor nodes by forming a multi-hop in the cluster.Moreover, through local cluster head rotation scheme, it efficiently manageswaste of energy caused by frequent formation of clusters which was an issue inthe existing methods. Simulation results show that our scheme enhances energyefficiency and ensure longer network time in the sensor network as comparedwith existing schemes such as LEACH, LEACH-C and PEACH.
Data-Dissemination Mechanism used on Multiple Virtual Grids in Wireless Sensor Networks
Jin, Min-Sook ; Lee, Eui-Sin ; Park, Soo-Chang ; Kim, Sang-Ha ;
The KIPS Transactions:PartC, volume 16C, issue 4, 2009, Pages 505~510
DOI : 10.3745/KIPSTC.2009.16-C.4.505
Sensor networks are composed of a great number of sensor nodes. Since all sensor nodes are energy-restricted and hard to recharge, it is very important.However, the energy consumption may significantly increase if mobile sources or sinks exist in sensor networks. The reason is that the routing information for mobile sources and sinks needs to be update frequently for efficientdata delivery. The routing algorithm supporting mobile sinks should consider not only continuous data delivery but also the energy consumption of sensor nodes. However, most of the existing research focuses on even energy consumption while the mobility of sinks and sources is rarely consider. In this paper, we propose an efficient routing protocol with multiple virtual grids to reduce energy consumption and improve packets delivery efficiency. Then this paper considers the mobility. Simulation results show that our algorithm can guarantee high data delivery ratio and lower average delivery delay, while consuming lower energy than existing routing protocols in sensor networks.
Definition of Network Resource and Network Service Interface for Grid Network Resource Manager
Kim, Hae-Hyun ; Cha, Young-Wook ; Han, Jang-Soo ; Kim, Choon-Hee ; Kong, Jong-Uk ; Seok, Woo-Jin ;
The KIPS Transactions:PartC, volume 16C, issue 4, 2009, Pages 511~520
DOI : 10.3745/KIPSTC.2009.16-C.4.511
Grid technology enables high performance computation and mass data processing by connecting geographically distributed computing resources to high-speed network. To carry on grid tasks requiring guaranteed quality of service, we need to build converged infrastructure which controls and manages network resources as well as computing resources. In this paper, we defined grid network service interface and information model to support grid network path, resource creation and reservation. In addition to resource creation and reservation messages of the existing GLIF, grid network path and notification messages were defined in the grid network service interface. We also defined related statuses and messages for two-phase resource reservation mechanism. We designed and implemented network resource management system based on the grid network information model and service interface. We experimented in resource reservation, allocation and release of network resources in grid environment with GMPLS control and transport network.
Routing in UAV based Disruption Tolerant Networks
Kim, Tea-Ho ; Lim, Yu-Jin ; Park, Joon-Sang ;
The KIPS Transactions:PartC, volume 16C, issue 4, 2009, Pages 521~526
DOI : 10.3745/KIPSTC.2009.16-C.4.521
Disruption/Delay Tolerant Network(DTN) is a technology for interconnecting partitioned networks. These days, DTN, especially routing in DTN, draws significant attention from the networking community. In this paper, we investigate DTN routing strategies for highly partitioned ad hoc networks where Unmanned Aerial Vehicles (UAVs) perform store-carry-forward functionality for improved network connectivity. Also we investigate UAV trajectory control mechanisms via simulation studies.
Silent Mobile Content Delivery and Control Scheme using Multimedia Message Service
Kim, Kyu-Won ; Kim, Moon-Jeong ; Eom, Young-Ik ;
The KIPS Transactions:PartC, volume 16C, issue 4, 2009, Pages 527~534
DOI : 10.3745/KIPSTC.2009.16-C.4.527
Almost every mobile phone supports MMS to send and receive multimedia messages among users. MMS is suitable for different types of mobile phones and effectively operates in wireless environments. So the mobile content delivery method using MMS can be efficient. However, there would be some problems if a mobile service provider tries to deliver mobile content to subscribers by using the existing MMS. In this paper, we propose an improved data transmission and control scheme for MMS. Our scheme assists mobile service providers to deliver mobile contents easily by modifying the MMS system software. By using our scheme, mobile service providers are able to manage mobile contents stored in mobile devices. Therefore, they can provide various services such as mobile daily news service, automatic software upgrade service, mobile advertising service, etc. We verify the possibility of the proposed scheme through simulation.
Collaborative Stepwise Movement of Mobile Sensor Nodes for Energy Efficient Dynamic Sensor Network Coverage Maintenance
Han, Ngoc-Soc ; Kim, Seong-Whan ;
The KIPS Transactions:PartC, volume 16C, issue 4, 2009, Pages 535~542
DOI : 10.3745/KIPSTC.2009.16-C.4.535
Wireless Sensor Network (WSN) is a wireless network consisting of spatially distributed autonomous devices, using sensors to cooperatively monitor physical or environmental conditions. WSNs face the critical challenge of sustaining long-term operation on limited battery energy. Coverage maintenance has been proposed as a promising approach to prolong network lifetime. Mobile sensors equipped with communication devices can be leveraged to overcome the coverage problem. In this paper, we propose a stepwise movement scheme using perimeter coverage property for the coverage maintenance problem. In our scheme, each sensor monitors neighboring dead nodes, determines vulnerable node (i.e. dead node which makes uncovered area), computes the center of uncovered area HC, and makes a coordinated stepwise movement to compensate the uncovered area. In our experimental results, our scheme shows at least 50 % decrease in the total moving distance which determines the energy efficiency of mobile sensor.