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
Improvement of Internet Content Filtering Software
Jeon, Woong-Ryul ; Lee, Hyun-Seung ; Hur, Soon-Hang ; Kim, Kyung-Sin ; Won, Dong-Ho ; Kim, Seung-Joo ;
The KIPS Transactions:PartC, volume 16C, issue 5, 2009, Pages 543~554
DOI : 10.3745/KIPSTC.2009.16C.5.543
The openness of the Web allows any user to access any type of information easily at any time and anywhere. However, with function of easy access for useful information, internet has dysfunctions of providing users with harmful contents indiscriminately. Some information, such as adult content, is not appropriate for children. To protect children from these harmful contents, many filtering softwares are developed. However, these softwares can not prevent harmful contents, perfectly, because of some limitations. In this paper, we analyze existing eleven filtering softwares and state the limitation of these softwares. Furthermore, we propose requirements for new filtering software which overcomes the limitations, and describe framework of the new software.
Packed PE File Detection for Malware Forensics
Han, Seung-Won ; Lee, Sang-Jin ;
The KIPS Transactions:PartC, volume 16C, issue 5, 2009, Pages 555~562
DOI : 10.3745/KIPSTC.2009.16C.5.555
In malware accident investigation, the most important thing is detection of malicious code. Signature based anti-virus softwares have been used in most of the accident. Malware can easily avoid signature based detection by using packing or encryption method. Because of this, packed file detection is also important. Detection methods can be divided into signature based detection and entropy based detection. Signature based detection can not detect new packing. And entropy based detection has a problem with false positive. We provides detection method using entropy statistics of entry point section and `write` properties of essential characteristic of packed file. And then, we show packing detection tool and evaluate its performance.
An Algorithm for Improving the Accuracy of Privacy-Preserving Technique Based on Random Substitutions
Kang, Ju-Sung ; Lee, Chang-Woo ; Hong, Do-Won ;
The KIPS Transactions:PartC, volume 16C, issue 5, 2009, Pages 563~574
DOI : 10.3745/KIPSTC.2009.16C.5.563
The merits of random substitutions are various applicability and security guarantee on the view point of privacy breach. However there is no research to improve the accuracy of random substitutions. In this paper we propose an algorithm for improving the accuracy of random substitutions by an advanced theoretical analysis about the standard errors. We examine that random substitutions have an unpractical accuracy level and our improved algorithm meets the theoretical results by some experiments for data sets having uniform and normal distributions. By our proposed algorithm, it is possible to upgrade the accuracy level under the same security level as the original method. The additional cost of computation for our algorithm is still acceptable and practical.
A Study on the Encrypted Scheme Using Key Management Method Based on the Random Number Rearrangement for the Effective E-Document Management
Kim, Tae-Wook ; Sung, Kyung-Sang ; Kim, Jung-Jae ; Min, Byoung-Muk ; Oh, Hae-Seok ;
The KIPS Transactions:PartC, volume 16C, issue 5, 2009, Pages 575~582
DOI : 10.3745/KIPSTC.2009.16C.5.575
With all merits of electronic documents, there exist threats to the security such as illegal outflow, destroying, loss, distortion, etc. The techniques to protect the electronic documents against illegal forgery, alteration, removal are strongly requested. Even though various security technologies have been developed for electronic documents, most of them are emphasized to prevention of forgery or repudiation. This paper presents some problems in cryptography technologies currently used in the existing electronic document systems, and offer efficient methods to adopt cryptography algorithms to improve and secure the electronic document systems. To validate performance of the proposed random rearrangement method comparing with the existing cryptographies, basic elements have been compared, and it has been proved that the proposed method gives better results both in security and efficiency.
Efficient Regular Expression Matching Using FPGA
Lee, Jang-Haeng ; Lee, Seong-Won ; Park, Neung-Soo ;
The KIPS Transactions:PartC, volume 16C, issue 5, 2009, Pages 583~588
DOI : 10.3745/KIPSTC.2009.16C.5.583
Network intrusion detection system (NIDS) monitors all incoming packets in the network and detects packets that are malicious to internal system. The NIDS should also have ability to update detection rules because new attack patterns are unpredictable. Incorporating FPGAs into the NIDS is one of the best solutions that can provide both high performance and high flexibility comparing with other approaches such as software solutions. In this paper we propose and design a novel approach, prefix sharing parallel pattern matcher, that can not only minimize additional resources but also maximize the processing performance. Experimental results showed that the throughput for 16-bit input is twice larger than for 8-bit input but the used LEs/Char in FPGA increases only 1.07 times.
An Efficient Anonymous Authentication Protocol Based on Multiple Anonymous Certificates in VANET
Jung, Chae-Duk ; Sur, Chul ; Park, Young-Ho ; Rhee, Kyung-Hyune ;
The KIPS Transactions:PartC, volume 16C, issue 5, 2009, Pages 589~596
DOI : 10.3745/KIPSTC.2009.16C.5.589
Until now, some protocols have been presented to provide vehicle`s anonymity and unlinkability in VANET by means of issuing multiple anonymous certificates to each vehicle from the trust authority, or shot-time anonymous certificate to a vehicle after mutual authentication between a Roadside Unit (RSU) and the vehicle. However, these protocols have high overheads of the trust authority, RSUs and vehicles for generating anonymous certificate. In this paper, we propose an efficient anonymous authentication protocol, in which RSUs can issue multiple shot-time anonymous certificates to a vehicle to alleviate system overheads for mutual authentication between vehicles and RSUs. Several simulations are conducted to verify the efficiency of the proposed protocol in terms of RSU valid serve ratio and vehicle`s computational costs. Moreover, the proposed protocol provides unlinkability and traceability when multiple RSUs are compromised, whereas previous protocols do not provide unlinkability and traceability.
A Distributed Architecture Based SMTP Server for Large Email Service
Kim, Young-Jong ; Kwak, Hu-Keun ; Chung, Kyu-Sik ;
The KIPS Transactions:PartC, volume 16C, issue 5, 2009, Pages 597~604
DOI : 10.3745/KIPSTC.2009.16C.5.597
An SMTP(Simple Mail Transfer Protocol) server was designed for delivering and storing user`s email across a network. An SMTP server can be distributed as multiple servers for large service, huge users or massive emails. An SMTP server can be constructed by multiple servers with separating file system as email storing space, and each SMTP server can usually share each file system by using the NFS(Network File system). However the NFS is originally designed for sharing each file system across a network, and contains all attributes and features of regular file system. Using this NFS for email storing space of SMTP servers, it makes overhead due to unnecessary work of regular file system. In this paper, we propose a method to do directly operation with socket for reducing work overhead caused by the NFS. For doing directly operation with socket, this paper defines information based storing space structure and a protocol for storing emails. We performed experiments using Mailstone made by Netscape. The experimental results show the performance improvement of the proposed method compared to the existing method.
Realizing an End-to-End IP Multicast Monitoring Framework for the Support of Networked Collaboration
Jo, Jin-Yong ; Kong, Jong-Uk ;
The KIPS Transactions:PartC, volume 16C, issue 5, 2009, Pages 605~614
DOI : 10.3745/KIPSTC.2009.16C.5.605
Despite its graceful bandwidth saving nature, IP multicast has not been successful in widely spreading and using. Challenging includes policy and technological issues such as inter-domain routing, multicast availability and reachability. Properly detecting and isolating the faults would be the first step to stabilize IP multicast. In this paper, we introduce a scalable multicast monitoring framework. To efficiently cope with multicast network and networking problems, it enlarges its monitoring scopes from collecting delivery statistics to verifying end-to-end multicast availability, reachability and interactivity. We carry out various networking experiments to verify the scalability and feasibility of the proposed framework.
On the Design of ToA Based RSS Compensation Scheme for Distance Measurement in WSNs
Han, Hyeun-Jin ; Kwon, Tae-Wook ;
The KIPS Transactions:PartC, volume 16C, issue 5, 2009, Pages 615~620
DOI : 10.3745/KIPSTC.2009.16C.5.615
Nowadays, wireless infrastructures such as sensor networks are widely used in many different areas. In case of sensor networks, the wirelessly connected sensors can execute different kind of tasks in a diversity of environments, and one of the most important parameter for a successful execution of such tasks is the location information of each node. As to localization problems in WSNs, there are ToA (Timer of Arrival), RSS (Received Signal Strength), AoA (Angle of Arrival), etc. In this paper, we propose a modification of existing ToA and RSS based methods, adding a weighted average scheme to measure more precisely the distance between nodes. The comparison experiments with the traditional ToA method show that the average error value of proposed method is reduced by 0.1 cm in indoor environment (
) and 0.6cm in outdoor environment (
A Distributed Method for Bottleneck Node Detection in Wireless Sensor Network
Gou, Haosong ; Kim, Jin-Hwan ; Yoo, Young-Hwan ;
The KIPS Transactions:PartC, volume 16C, issue 5, 2009, Pages 621~628
DOI : 10.3745/KIPSTB.2009.16C.5.621
Wireless sensor networks (WSNs) have been considered as a promising method for reliably monitoring both civil and military environments under hazardous or dangerous conditions. Due to the special property and difference from the traditional wireless network, the lifetime of the whole network is the most important aspect. The bottleneck nodes widely exist in WSNs and lead to decrease the lifetime of the whole network. In order to find out the bottleneck nodes, the traditional centralized bottleneck detection method MINCUT has been proposed as a solution for WSNs. However they are impractical for the networks that have a huge number of nodes. This paper first proposes a distributed algorithm called DBND (Distributed Bottleneck Node detection) that can reduce the time for location information collection, lower the algorithm complexity and find out the bottleneck nodes quickly. We also give two simple suggestions of how to solve the bottleneck problem. The simulation results and analysis show that our algorithm achieves much better performance and our solutions can relax the bottleneck problem, resulting in the prolonging of the network lifetime.
An Energy Efficient Hybrid Routing Protocol Based on LEACH and PEGASIS
Lee, Young-Han ; Lee, Hyun-Jun ; Lee, Kyung-Oh ;
The KIPS Transactions:PartC, volume 16C, issue 5, 2009, Pages 629~636
DOI : 10.3745/KIPSTC.2009.16C.5.629
Since all sensor nodes in wireless sensor networks work by their own embedded batteries, if a node runs out of its battery, the sensor network can not operate normally. In this situation we should employ the routing protocols which can consume the energy of nodes efficiently. Many protocols for energy efficient routing in sensor networks have been suggested but LEACH and PEGASIS are most well known protocols. However LEACH consumes energy heavily in the head nodes and the head nodes tend to die early and PEGASIS - which is known as a better energy efficient protocol - has a long transfer time from a source node to sink node and the nodes close to the sink node expend energy sharply since it makes a long hop of data forwarding. We proposed a new hybrid protocol of LEACH and PEGASIS, which uses the clustering mechanism of LEACH and the chaining mechanism of PEGASIS and it makes the life time of sensor networks longer than other protocols and we improved the performance 33% and 18% higher than LEACH-C and PEGASIS respectively.
Performance Analysis of Synchronization Clock with Various Clock States Using Measured Clock Noises in NG-SDH Networks
Lee, Chang-Ki ;
The KIPS Transactions:PartC, volume 16C, issue 5, 2009, Pages 637~644
DOI : 10.3745/KIPSTC.2009.16C.5.637
A study about performance analysis of synchronization clock using measured clock noises is required. Therefore this paper executed the study for performance analysis of synchronization clock and acquirement of maximum number of network node with various clock states using measured clock noises in NG-SDH networks. Also this paper generated a suitable clock model using measured clock noises, and carried out simulations with various clock states. Through the simulation results, maximum numbers were 80 or more network nodes in normal state, and were below 37 nodes in short-term phase transient(SPT) state, and were 50 or more in long-term phase transient(LPT) state. Accordingly this study showed that maximum numbers to meet ITU-T specification were below 37 network nodes in three clock states. Also this study showed that when SPT or LPT states occur from NE network before DOTS system, synchronization source must change with other stable synchronization source of normal state.
Adaptive Indoor Localization Scheme to Propagation Environments in Wireless Personal Area Networks
Lim, Yu-Jin ; Park, Jae-Sung ;
The KIPS Transactions:PartC, volume 16C, issue 5, 2009, Pages 645~652
DOI : 10.3745/KIPSTC.2009.16C.5.645
Location-based service providing the customized information or service according to the user`s location has attracted a lot of attention from the mobile communication industry. The service is realized by means of several building blocks, a localization scheme, service platform, application and service. The localization scheme figures out a moving target`s position through measuring and processing a wireless signal. In this paper, we propose an adaptive localization scheme in an indoor localization system based on IEEE 802.15.4 standard. In order to enhance the localization accuracy, the proposed scheme selects the best reference points and adaptively reflects the changes of propagation environments of a moving target to approximate distances between the target and the reference points in RSS(Received Signal Strength) based localization system using triangulation. Through the implementation of the localization system, we verify the performance of the proposed scheme in terms of the localization accuracy.
A Sensor Overlay Network Providing Middleware Services on Wireless Sensor Networks
Kim, Yong-Pyo ; Jung, Eui-Hyun ; Park, Yong-Jin ;
The KIPS Transactions:PartC, volume 16C, issue 5, 2009, Pages 653~660
DOI : 10.3745/KIPSTC.2009.16C.5.653
A research for middleware of WSN can provide sensor applications with avoiding tight coupling of hardware, ease of development, and abstract data access. However, previous works have some limitations which should install their own middleware onto the all sensor nodes resulting in computational and communication overhead. In order to address it, we proposed a virtual sensor overlay network, called TinyONet-Lite which introduced virtual sensors to model a virtual counterpart of physical sensors. These virtual sensors dynamically grouped into an overlay network, Slice, which provides middleware services. We implemented TinyONet-Lite on mote class hardware with TinyOS. In accordance with experiments and comparison with existing researches, TinyONet-Lite was proved to show advantages of extensibility, dynamic service composition and reducing overhead.
Improved ErtPS Scheduling Algorithm for AMR Speech Codec with CNG Mode in IEEE 802.16e Systems
Woo, Hyun-Je ; Kim, Joo-Young ; Lee, Mee-Jeong ;
The KIPS Transactions:PartC, volume 16C, issue 5, 2009, Pages 661~668
DOI : 10.3745/KIPSTC.2009.16C.5.661
The Extended real-time Polling Service (ErtPS) is proposed tosupport QoS of VoIP service with silence suppression which generates variable size data packets in IEEE 802.16e systems. If the silence is suppressed, VoIP should support Comfort Noise Generation (CNG) which generates comfort noise for receiver`s auditory sense to notify the status of connection to the user. CNG mode in silent-period generates a data with lower bit rate at long packet transmission intervals in comparison with talk-spurt. Therefore, if the ErtPS, which is designed to support service flows that generate data packets on a periodic basis, is applied to silent-period, resources of the uplink are used inefficiently. In this paper, we proposed the Improved ErtPS algorithm for efficient resource utilization of the silent-period in VoIP traffic supporting CNG. In the proposed algorithm, the base station allocates bandwidth depending on the status of voice at the appropriate interval by havingthe user inform the changes of voice status. The Improved ErtPS utilizes the Cannel Quality Information Channel (CQICH) which is an uplink subchannel for delivering quality information of channel to the base station on a periodic basis in 802.16e systems. We evaluated the performance of proposed algorithm using OPNET simulator. We validated that proposed algorithm improves the bandwidth utilization of the uplink and packet transmission latency