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
A Study on Development to Be Protection Profile for Interoperability of Heterogeneous DRM Systems
Jo, Hea-Suk ; Lee, Kwang-Woo ; Jeon, Woong-Ryul ; Lee, Yun-Ho ; Kim, Seung-Joo ; Won, Dong-Ho ;
The KIPS Transactions:PartC, volume 16C, issue 1, 2009, Pages 1~12
DOI : 10.3745/KIPSTC.2009.16-C.1.1
Today, Digital Right Management (DRM) is used to protect copyrights of digital contents from illegal reproduction and redistribution. Unfortunately, current DRM systems are causing user`s discomfort because of lack of mutual compatibility. In order to overcome this drawback, technologies for interoperability of heterogeneous DRM systems are developing. In this paper, we study the protection profile for conversion technologies of heterogeneous DRM systems, using the Common Criteria. Especially, this paper is written by reuse of the existing protection profile. Therefore, performance analysis reveals that efficiency of time and cost is significantly improved. This protection profile can be used by contents provider and administrator who manage user`s copyrights to reference data for copyright protection.
Design and Implementation of an SNMP-Based Traffic Flooding Attack Detection System
Park, Jun-Sang ; Kim, Sung-Yun ; Park, Dai-Hee ; Choi, Mi-Jung ; Kim, Myung-Sup ;
The KIPS Transactions:PartC, volume 16C, issue 1, 2009, Pages 13~20
DOI : 10.3745/KIPSTC.2009.16-C.1.13
Recently, as traffic flooding attacks such as DoS/DDoS and Internet Worm have posed devastating threats to network services, rapid detection and proper response mechanisms are the major concern for secure and reliable network services. However, most of the current Intrusion Detection Systems (IDSs) focus on detail analysis of packet data, which results in late detection and a high system burden to cope with high-speed network traffic. In this paper we propose an SNMP-based lightweight and fast detection algorithm for traffic flooding attacks, which minimizes the processing and network overhead of the detection system, minimizes the detection time, and provides high detection rate. The attack detection algorithm consists of three consecutive stages. The first stage determines the detection timing using the update interval of SNMP MIB. The second stage analyzes attack symptoms based on correlations of MIB data. The third stage determines whether an attack occurs or not and figure out the attack type in case of attack.
Efficient Source Authentication Protocol for IPTV Based on Hash Tree Scheme
Shin, Ki-Eun ; Choi, Hyoung-Kee ;
The KIPS Transactions:PartC, volume 16C, issue 1, 2009, Pages 21~26
DOI : 10.3745/KIPSTC.2009.16-C.1.21
Presently, the demand for IPTV, to satisfy a variety of goals, is exploding. IPTV is coming into the spotlight as a killer application in upcoming IP convergence networks such as triple play which is the delivery of voice, internet, and video service to a subscriber. IPTV utilizes CAS, which controls the subscriber access to content for a profit. Although the current CAS scheme provides access control via subscriber authentication, there is no authentication scheme for the content transmitted from service providers. Thus, there is a vulnerability of security, through which an adversary can forge content between the service provider and subscribers and distribute malicious content to subscribers. In this paper, based on a hash tree scheme, we proposed efficient and strong source authentication protocols which remove the vulnerability of the current IPTV system. We also evaluate our protocol from a view of IPTV requirements.
Secure Sharing and Recovering Scheme of e-Business Data Based on Weight Table
Song, You-Jin ; Kim, Jin-Seog ;
The KIPS Transactions:PartC, volume 16C, issue 1, 2009, Pages 27~36
DOI : 10.3745/KIPSTC.2009.16-C.1.27
The leaking of personal information is mostly occurred by internal users. The confidential information such as credit card number can be disclosed or modified by system manager easily. The secure storaging and managing scheme for sensitive data of individual and enterprise is required for distributed data management. The manager owning private data is needed to have a weight which is a right to disclose a private data. For deciding a weight, it is required that system is able to designate the level of user`s right. In this paper, we propose the new algorithm named digit-independent algorithm. And we propose a new data management scheme of gathering and processing the data based on digit-independent algorithm. Our sharing and recovering scheme have the efficient computation operation for managing a large quantity of data using weight table. The proposed scheme is able to use for secure e-business data management and storage in ubiquitous computing environment.
Advanced Key Management Architecture Based on Tree Structure for Secure SCADA Communications
Choi, Dong-Hyun ; Lee, Sung-Jin ; Jeong, Han-Jae ; Kang, Dong-Joo ; Kim, Hak-Man ; Kim, Kyung-Sin ; Won, Dong-Ho ; Kim, Seung-Joo ;
The KIPS Transactions:PartC, volume 16C, issue 1, 2009, Pages 37~50
DOI : 10.3745/KIPSTC.2009.16-C.1.37
The SCADA(Supervisory Control And Data Acquisition) system is a control system for infrastructure of nation. In the past, the SCADA system was designed without security function because of its closed operating environment. However, the security of the SCADA system has become an issue with connection to the open network caused by improved technology. In this paper we review the constraints and security requirements for SCADA system and propose advanced key management architecture for secure SCADA communications. The contributions of the present work are that our scheme support both message broadcasting and secure communications, while the existing key management schemes for SCADA system don`t support message broadcasting. Moreover, by evenly spreading much of the total amount of computation across high power nodes (MTU or SUB-MTU), our protocol avoids any potential performance bottleneck of the system while keeping the burden on low power (RTU) nodes at minimal.
Time Synchronization Algorithm using the Clock Drift Rate and Reference Signals Between Two Sensor Nodes
Kim, Hyoun-Soo ; Jeon, Joong-Nam ;
The KIPS Transactions:PartC, volume 16C, issue 1, 2009, Pages 51~56
DOI : 10.3745/KIPSTC.2009.16-C.1.51
Time synchronization algorithm in wireless sensor networks is essential to various applications such as object tracking, data encryption, duplicate detection, and precise TDMA scheduling. This paper describes CDRS that is a time synchronization algorithm using the Clock Drift rate and Reference Signals between two sensor nodes. CDRS is composed of two steps. At first step, the time correction is calculated using offset and the clock drift rate between the two nodes based on the LTS method. Two nodes become a synchronized state and the time variance can be compensated by the clock drift rate. At second step, the synchronization node transmits reference signals periodically. This reference signals are used to calculate the time difference between nodes. When this value exceeds the maximum error tolerance, the first step is performed again for resynchronization. The simulation results on the performance analysis show that the time accuracy of the proposed algorithm is improved, and the energy consumption is reduced 2.5 times compared to the time synchronization algorithm with only LTS, because CDRS reduces the number of message about 50% compared to LTS and reference signals do not use the data space for timestamp.
Improved ROHC Optimistic Mode for Efficient Utilization of the Resources in Mobile WiMAX
Kim, Joo-Young ; Woo, Hyun-Je ; Lee, Mee-Jeong ; Kwon, Jeong-Min ;
The KIPS Transactions:PartC, volume 16C, issue 1, 2009, Pages 57~64
DOI : 10.3745/KIPSTC.2009.16-C.1.57
In order to efficiently provide IP based Wireless Broadband services in Mobile WiMAX, schemes for more efficiently utilizing a limited bandwidth in radio links are needed. Robust Header Compression (ROHC), a standard header compression scheme proposed by IETF, Bi-directional Optimistic (O) mode provides higher compression efficiency and robustness compared with Payload Header Suppression (PHS) which is an optional header compression scheme for mobile WiMAX [1, 2]. However, if consecutive packet losses occur because of a Shadow Region of Mobile WiMAX or bit errors, header decompression failure rate of the ROHC O mode increases due to inconsistency of the compression information between the Compressor and the Decompressor. Therefore, a complementary mechanism is needed. In this paper, we propose an approach for the dynamic adjustment of an optimistic parameter, which has an effect on both the compression efficiency and the robustness, for improving the performance of ROHC O mode. We also analyze the performance of the proposed approach using an OPNET simulator.
Cache Invalidation Schemes based on Time Guarantee for Improving Access Time in Mobile Ad hoc Networks
Choi, Jae-Ho ; Oh, Jae-Oh ; Lee, Myong-Soo ; Lee, Sang-Keun ;
The KIPS Transactions:PartC, volume 16C, issue 1, 2009, Pages 65~72
DOI : 10.3745/KIPSTC.2009.16-C.1.65
Due to the popularity of mobile devices and advances in wireless communication technologies, a mobile ad hoc network has received a lot of attention. In the existing data replication management research, the use of a replica has been shown to be an efficient technique for improving data accessibility. However, to use a replica in ad hoc networks, the data consistency between the original data and the replica should be guaranteed. In the traditional research, a mobile node should check an original data whether the data is updated or not. However, It may be costly or sometimes impossible to check the original data. In the case of the time constraint applications, the checking cost can cause more serious problem. In this paper, we propose the time-guarantee based cache invalidation schemes for time constraint applications and the threshold based compensation method to enhance the time-guarantee based scheme. The proposed schemes can remove the "rollback" problem. Simulation results show that our schemes outperform the previous ones in terms of access time with little loss of data currency.
An Improved Reactive Chord for Minimizing Network Traffic and Request Latency
Yoon, Yong-Hyo ; Kwak, Hu-Keun ; Kim, Cheong-Ghil ; Chung, Kyu-Sik ;
The KIPS Transactions:PartC, volume 16C, issue 1, 2009, Pages 73~82
DOI : 10.3745/KIPSTC.2009.16-C.1.73
The peers in the Chord method send messages periodically to keep the routing table updated. In a mobile P2P network, the peers in the Chord method should send messages more frequently to keep the routing table updated and reduce the failure of a request. However this results in increasing the overall network traffic. In our previous method, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but there were disadvantages to generate more traffic if the number of requests per second increases and to have more delay in the request processing time than the existing Chord. In this paper, we propose an improved method of reactive routing table update to reduce the request processing time. In the proposed method, when a data request comes, the routing table is updated only if its information is not recent while it is always updated in the previous method. We perform experiments using Chord simulator (I3) made by UC Berkely. The experimental results show the performance improvement of the proposed method compared to the existing method.
FST : Fusion Rate Based Spanning Tree for Wireless Sensor Networks
Suh, Chang-Jin ; Shin, Ji-Soo ;
The KIPS Transactions:PartC, volume 16C, issue 1, 2009, Pages 83~90
DOI : 10.3745/KIPSTC.2009.16-C.1.83
Wireless Sensor Network (WSN) is a wireless network that gathers information from remote area with autonomously configured routing path. We propose a fusion based routing for a `convergecast` in which all sensors periodically forward collected data to a base station. Previous researches dealt with only full-fusion or no-fusion case. Our Fusion rate based Spanning Tree (FST) can provide effective routing topology in terms of total cost according to all ranges of fusion rate f (
). FST is optimum for convergecast in case of no-fusion (f
Interference-Avoidance Based Localization for Multiple Mobile Nodes in Mobile Wireless Sensor Networks
Lee, Joa-Hyoung ; Jung, In-Bum ;
The KIPS Transactions:PartC, volume 16C, issue 1, 2009, Pages 91~100
DOI : 10.3745/KIPSTC.2009.16-C.1.91
Given the increased interest in ubiquitous computing, wireless sensor network has been researched widely. The localization service which provides the location information of mobile user, is one of important service provided by sensor network. Many methods to obtain the location information of mobile user have been proposed. However, these methods were developed for only one mobile user so that it is hard to extend for multiple mobile users. If multiple mobile users start the localization process concurrently, there could be interference of beacon or ultrasound that each mobile user transmits. In the paper, we propose IAL, the localization technique with interference avoidance for multiple mobile nodes in mobile wireless sensor networks. In IAL, interference is prevented by forcing the mobile node to get the permission of localization from anchor nodes. For this, we define LIP packet type for localization initiation by mobile node and LGP packet type for localization grant by anchor node. LRP packet type is used to reject localization by anchor node for interference avoidance. The experimental result shows that the number of interference between nodes are increased in proportion to the number of mobile nodes and IAL provides efficient localization.
A General-Purpose Service Information Processing System for Integrated Data Broadcasting Environment
Jeon, Je-Min ; Choi, Hyeon-Seok ; Kim, Jung-Sun ;
The KIPS Transactions:PartC, volume 16C, issue 1, 2009, Pages 101~108
DOI : 10.3745/KIPSTC.2009.16-C.1.101
The data broadcasting service, which is growing remarkably today, provides viewers with useful information as well as high quality video and audio. Service information is a kind of additional data that contains a wide range of information such as channel list and/or program title. Each service information is transmitted in the form of a table. And most standard committees have specified their own table list used for carrying the service information. Consequently, It causes incompatibility among services that each broadcast operators produce because the tables that they use differ from each other. In this paper, we propose a general-purpose service information processing system for an integrated data broadcasting middleware that is compatible with heterogenous broadcasting environments. The system is able to change its target table list dynamically without any code modification. Futhermore, we also adopted a thread pool model for efficient parsing and event dispatching.
Context-Aware Reasoning System for Personalized u-City Services
Lee, Chang-Hun ; Kim, Ji-Ho ; Song, Oh-Young ;
The KIPS Transactions:PartC, volume 16C, issue 1, 2009, Pages 109~116
DOI : 10.3745/KIPSTC.2009.16-C.1.109
Recently, there are many researches to realize context-awareness service that recognizes surrounding environments as context and provide the citizens with pervasive convenience based on ubiquitous computing technology. In the u-City, various sensors collect information as context, and citizens will receive various context-awareness service, making use of their wireless and mobile devices and the infrastructures of the u-City. We designed ontology that is useful to structure information of sensor or device that is linked to networks and use OWL (Web Ontology Language) that can express information of mutual relation and partial situation. And we propose a context-aware reasoning system for personalized u-City services based on collected context information and user`s intention.
Session Control Technique Providing Seamless Service in Next-Generation Communication Environment Based on IMS
Nam, Seung-Min ; Kim, Ji-Ho ; Lee, Hyun-Jeong ; Song, Oh-Young ;
The KIPS Transactions:PartC, volume 16C, issue 1, 2009, Pages 117~124
DOI : 10.3745/KIPSTC.2009.16-C.1.117
Recently, the application of network technology extends to all areas because of development of digital information technology. Thus, networks are being evolved towards a next-generation communication environments where all information devices, home appliances, and object are connected and interoperated. In order to provide adequate convergence services in IMS-based networks that are the core technology of the next-generation communication environments, seamless service should be possible although the underlying network and the device in use may change in the networks. In this paper, we propose an efficient architecture, algorithm, and protocol of service session control for seamless service in such networks.
RSS Service Method Using the User`s Concerned Area and the QoS of Wireless Devices
Lee, Jong-Kap ; Ryu, Dong-Yeop ; Kong, Ran-Sook ; Lim, Young-Hwan ;
The KIPS Transactions:PartC, volume 16C, issue 1, 2009, Pages 125~132
DOI : 10.3745/KIPSTC.2009.16-C.1.125
The pre-generated web contents or various devices have to be used in order to execute UMA(UMA:Universal Multimedia Access). However, an HTLM web page for PC is not very compatible with wireless internet because of its unnecessary advertisements, high resolution, and various multimedia data. This is because the main focus when creating it was on high speed. In this paper indicates with the RSS channel, converted from the main part of the HTML web page, which users show interest in, a wireless compatible internet page can easily be created. Consequently, web administrators could create a wireless page easily and quickly, and wireless users would be able to find information in the same manner.
An Analytical Model for LR-WPAN Performance in the Presence of Hidden Nodes
Lee, Kang-Woo ; Shin, Youn-Soon ; Hyun, Gyu-Wan ; Ahn, Jong-Suk ; Kim, Hie-Cheol ;
The KIPS Transactions:PartC, volume 16C, issue 1, 2009, Pages 133~142
DOI : 10.3745/KIPSTC.2009.16-C.1.133
This paper proposes an analytical performance model of IEEE 802.15.4 in the presence of hidden nodes. Conventional 802.15.4 mathematical models assume ideal situations where every node can detect the transmission signal of every other nodes different from the realistic environments. Since nodes can be randomly located in real environments so that some nodes` presence is hidden from other ones, this assumption leads to wrong performance evaluation of 802.15.4. For solving this problem, we develop an extended performance model which combines the traditional 802.15.4 performance model with one for accounting the presence of hidden nodes. The extended model predicts the rapid performance degradation of 802.15.4 due to the small number of hidden nodes. The performance, for example, degrades by 62% at maximum when 5% of the total nodes are hidden. These predictions are confirmed to be equal to those of ns-2 simulations by less than 6% difference.