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 14C, Issue 7 - Dec 2007
Volume 14C, Issue 6 - Oct 2007
Volume 14C, Issue 5 - Aug 2007
Volume 14C, Issue 4 - Aug 2007
Volume 14C, Issue 3 - Jun 2007
Volume 14C, Issue 2 - Apr 2007
Volume 14C, Issue 1 - Feb 2007
Selecting the target year
Detection of Personal Information Leakage using the Network Traffic Characteristics
Park, Jung-Min ; Kim, Eun-Kyung ; Jung, Yu-Kyung ; Chae, Ki-Joon ; Na, Jung-Chan ;
The KIPS Transactions:PartC, volume 14C, issue 3, 2007, Pages 199~208
DOI : 10.3745/KIPSTC.2007.14-C.3.199
In a ubiquitous network environment, detecting the leakage of personal information is very important. The leakage of personal information might cause severe problem such as impersonation, cyber criminal and personal privacy violation. In this paper, we have proposed a detection method of personal information leakage based on network traffic characteristics. The experimental results indicate that the traffic character of a real campus network shows the self-similarity and Proposed method can detect the anomaly of leakage of personal information by malicious code.
The Design and Implementation of High Performance Intrusion Prevention Algorithm based on Signature Hashing
Wang, Jeong-Seok ; Jung, Yun-Jae ; Kwon, H-Uing ; Chung, Kyu-Sik ; Kwak, Hu-Keun ;
The KIPS Transactions:PartC, volume 14C, issue 3, 2007, Pages 209~220
DOI : 10.3745/KIPSTC.2007.14-C.3.209
IPS(Intrusion Prevention Systems), which is installed in inline mode in a network, protects network from outside attacks by inspecting the incoming/outgoing packets and sessions, and dropping the packet or closing the sessions if an attack is detected in the packet. In the signature based filtering, the payload of a packet passing through IPS is matched with some attack patterns called signatures and dropped if matched. As the number of signatures increases, the time required for the pattern matching for a packet increases accordingly so that it becomes difficult to develop a high performance US working without packet delay. In this paper, we propose a high performance IPS based on signature hashing to make the pattern matching time independent of the number of signatures. We implemented the proposed scheme in a Linux kernel module in a PC and tested it using worm generator, packet generator and network performance measure instrument called smart bit. Experimental results show that the performance of existing method is degraded as the number of signatures increases whereas the performance of the proposed scheme is not degraded.
Design of DRM System for Secure Contents Transfer in Home Domain
Lee, Chang-Bo ; Kim, Jung-Jae ; Moon, Ju-Young ; Lee, Kyung-Seok ; Jun, Moon-Seog ;
The KIPS Transactions:PartC, volume 14C, issue 3, 2007, Pages 221~228
DOI : 10.3745/KIPSTC.2007.14-C.3.221
For the usage of the different standard technology among DRM vendors, the DRM technologies in today could not guarantee the interoperability between the digital contents and digital devices. While users have been guaranteed the protection of contents, they have to put up with the limitation and inconvenience. The Superdistribution methods that InterTrust has proposed is the content distribution technology which is possible to use the content only by the user authentication with the license regardless of the acquisition of the DRM contents. However, it need a additional license with re-authentication from DRM server when the original contents need to be moved to other devices from the own device. In this paper, to reduce the inconveniences of re-authentication and re-issue procedures of the license and continually to protect the rights of contents on the offline, we propose the DRM system that creates domain between home devices and enable users to freely transfer contents with the domain.
Analysis of the Bogus Routing Information Attacks in Sensor Networks
Lee, Myung-Jin ; Kim, Mi-Hui ; Chae, Ki-Joon ; Kim, Ho-Won ;
The KIPS Transactions:PartC, volume 14C, issue 3, 2007, Pages 229~238
DOI : 10.3745/KIPSTC.2007.14-C.3.229
Sensor networks consist of many tiny sensor nodes that collaborate among themselves to collect, process, analyze, and disseminate data. In sensor networks, sensor nodes are typically powered by batteries, and have limited computing resources. Moreover, the redeployment of nodes by energy exhaustion or their movement makes network topology change dynamically. These features incur problems that do not appear in traditional, wired networks. Security in sensor networks is challenging problem due to the nature of wireless communication and the lack of resources. Several efforts are underway to provide security services in sensor networks, but most of them are preventive approaches based on cryptography. However, sensor nodes are extremely vulnerable to capture or key compromise. To ensure the security of the network, it is critical to develop suity mechanisms that can survive malicious attacks from "insiders" who have access to the keying materials or the full control of some nodes. In order to protect against insider attacks, it is necessary to understand how an insider can attack a sensor network. Several attacks have been discussed in the literature. However, insider attacks in general have not been thoroughly studied and verified. In this paper, we study the insider attacks against routing protocols in sensor networks using the Ad-hoc On-Demand Distance Vector (AODV) protocol. We identify the goals of attack, and then study how to achieve these goals by modifying of the routing messages. Finally, with the simulation we study how an attacker affects the sensor networks. After we understand the features of inside attacker, we propose a detect mechanism using hop count information.
Design and Implementation of Double-Key based Light Weight Security Protocol in Ubiquitous Sensor Network
Zhung, Yon-Il ; Lee, Sung-Young ;
The KIPS Transactions:PartC, volume 14C, issue 3, 2007, Pages 239~254
DOI : 10.3745/KIPSTC.2007.14-C.3.239
Ubiquitous computing supports environment to freely connect to network without restrictions of place and time. This environment enables easy access and sharing of information, but because of easy unauthorized accesses, specified security policy is needed. Especially, ubiquitous sensor network devices use limited power and are small in size, so, many restrictions on policies are bound to happen. This paper proposes double-key based light weight security protocol, independent to specific sensor OS, platform and routing protocol in ubiquitous sensor network. The proposed protocol supports safe symmetric key distribution, and allows security manager to change and manage security levels and keys. This had a strong merit by which small process can make large security measures. In the performance evaluation, the proposed light weight security protocol using double-key in ubiquitous sensor network allows relatively efficient low power security policy. It will be efficient to ubiquitous sensor network, such as smart of ace and smart home.
An Efficient Resource Reservation Scheme using a Dynamic Branch Router for Mobile IPv6 Networks
Cha, Woo-Suk ; Kim, Eun-Mi ; Bae, Ho-Young ; Lee, Bae-Ho ; Cho, Gi-Hwan ;
The KIPS Transactions:PartC, volume 14C, issue 3, 2007, Pages 255~266
DOI : 10.3745/KIPSTC.2007.14-C.3.255
RSVP (Resource reSerVation Protocol) is the Internet standard protocol for supporting QoS (Quality of Service) requirements by reserving network resources between the sender and the receiver. Several problems, such as common path identification and resource pre-reservation, should be solved to apply RSVP in wireless mobile environments. To resolve these problems, this paper proposes DBRA (Dynamic Branch Router Approach) based on two designated entities, candidate access routers and a branch router. While several RSVP sessions between a branch router and candidate routers are managed, DBRA makes use of only one RSVP session between the sender and a branch router. Based on a network simulation, the proposed scheme has been compared with MRSVP (Mobile RSVP) and HMRSVP (Hierarchical MRSVP) in terms of the average packet transmission rate, bandwidth utilization and RSVP session failure rate.
A Study on the Design of OSPF Area and Data Flow in the Tactical Data Networks
Kwon, Soo-Gab ; Jeong, Kyu-Young ; Kim, Jeong-Ho ;
The KIPS Transactions:PartC, volume 14C, issue 3, 2007, Pages 267~276
DOI : 10.3745/KIPSTC.2007.14-C.3.267
In OSPF, the larger and more unstable the area, the greater the likelihood for performance problems associated with routing protocol recalculation. Generally, an area should have no more than 50 routers. Areas with unstable links should be smaller. Military tactical data network is used for military operations during war-time. It consists of wireless network for mobility of node. Thus, it has low-bandwidth and unstable property. In addition, it is expected that many kinds of router-failure, Link-failure and recovery at emergency period. However, Military tactical data network is designed with about one and half times the number of recommendation. This paper proves that the traffic is limited by the increase of re-calculation of area.
An Energy-Efficient Clustering Using Load-Balancing of Cluster Head in Wireless Sensor Network
Nam, Do-Hyun ; Min, Hong-Ki ;
The KIPS Transactions:PartC, volume 14C, issue 3, 2007, Pages 277~284
DOI : 10.3745/KIPSTC.2007.14-C.3.277
The routing algorithm many used in the wireless sensor network features the clustering method to reduce the amount of data transmission from the energy efficiency perspective. However, the clustering method results in high energy consumption at the cluster head node. Dynamic clustering is a method used to resolve such a problem by distributing energy consumption through the re-selection of the cluster head node. Still, dynamic clustering modifies the cluster structure every time the cluster head node is re-selected, which causes energy consumption. In other words, the dynamic clustering approaches examined in previous studies involve the repetitive processes of cluster head node selection. This consumes a high amount of energy during the set-up process of cluster generation. In order to resolve the energy consumption problem associated with the repetitive set-up, this paper proposes the Round-Robin Cluster Header (RRCH) method that fixes the cluster and selects the head node in a round-robin method The RRCH approach is an energy-efficient method that realizes consistent and balanced energy consumption in each node of a generated cluster to prevent repetitious set-up processes as in the LEACH method. The propriety of the proposed method is substantiated with a simulation experiment.
An Efficient Transmission Plan for Adaptable Bandwidth Allocation Technique
Lee, Myoun-Jae ; Park, Do-Soon ;
The KIPS Transactions:PartC, volume 14C, issue 3, 2007, Pages 285~292
DOI : 10.3745/KIPSTC.2007.14-C.3.285
In the adaptable bandwidth allocation technique, a transmission plan for variable rate video data is made by the CBA algorithm and the data is transmitted by considering network traffic. But the CBA algorithm produces a transmission plan where the size of the increasing interval of transmission rate is generally larger than the size of the decreasing interval. And the transmission rate in CBA algorithm is changed in overflow curve during the increasing interval of transmission rate. This ぉy cause many frames to be discarded when available transmission rate is small. In this paper, a smoothing algorithm is proposed, where transmission rate is changed in the middle of underflow curve and overflow curve, but the transmission rate increases at the minimum. In order to show the performance, the proposed algorithm and a CBA algorithm were applied to a transmission plan in the adaptable bandwidth allocation technique, and the minimum frame rates, the average frame rates, the variation of frame rates, and the numbers of discarded frames were compared in both algorithms.
Client Profile Framework for Providing Adapted Content to Context
Kim, Kyung-Sik ; Lee, Jae-Dong ;
The KIPS Transactions:PartC, volume 14C, issue 3, 2007, Pages 293~304
DOI : 10.3745/KIPSTC.2007.14-C.3.293
In this paper, a client-side framework for processing of the profile that is necessary for providing adapted content to user`s context in the client is designed and implemented. The profile must be constituted context information and various user`s information for providing the adapted content to user`s context. The client device also provides functionalities such as the creation, the management, and the transmission of the profile. The profile which is used in the proposed profile framework consists of various related information of a user for content adaptation. The technology such as creation, transmission and manage of the profile for effective processing is proposed and apply this technologies to client profile framework during the design are applied. As the result of evaluation, techniques of the proposed framework for processing profiles is more effective than previous techniques.
An Adaptive Received Signal Strength Prediction Model for a Layer 2 Trigger Generator in a WLAM System
Park, Jae-Sung ; Lim, Yu-Jin ; Kim, Beom-Joon ;
The KIPS Transactions:PartC, volume 14C, issue 3, 2007, Pages 305~312
DOI : 10.3745/KIPSTC.2007.14-C.3.305
In this paper, we present a received signal strength (RSS) prediction model to timely Initiate link layer triggers for fast handoff in a wireless LAN system. Noting that the distance between a mobile terminal and an access point is not changed abruptly in a short time interval, an adaptive RSS predictor based on a stationary time series model is proposed. RSS data obtained from ns-2 simulations are used to identity the time series model and verify the predictability of the RSS data. The results suggest that an autoregressive process of order 1 (AR(1)) can be used to represent the measured RSSs in a short time interval and predict at least 1-step ahead RSS with a high confidence level.