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 13C, Issue 7 - Dec 2006
Volume 13C, Issue 6 - Oct 2006
Volume 13C, Issue 5 - Oct 2006
Volume 13C, Issue 4 - Aug 2006
Volume 13C, Issue 3 - Jun 2006
Volume 13C, Issue 2 - Apr 2006
Volume 13C, Issue 1 - Feb 2006
Selecting the target year
Improving SUCV Protocol for the Secure Binding Update in MIPv6
Won You-Seuk ; Cho Kyung-San ;
The KIPS Transactions:PartC, volume 13C, issue 3, 2006, Pages 267~274
DOI : 10.3745/KIPSTC.2006.13C.3.267
The process of binding update for the routing optimization in MIPv6 can make the involved MN (Mobile Node) and CN(Correspondent Node) vulnerable to various attacks. Therefore, securing binding update process becomes an important research issue in the MIPv6, and several secure binding update protocols have been proposed. In this paper, we compare several existing binding update protocols, and analyze the vulnerability of MNs and CNs to the possible attacks and the management overhead of the SUCV(Statistic Uniqueness and Cryptographic Verifiability) which is considered to be superior to other protocols. Then, we propose an advanced protocol to resolve above drawbacks. Through the detailed analysis, we show that our protocol can reduce the computational overhead of MN, enable better management, and achieve a higher level of security against the redirect attacks, DoS(Denial of Service) attacks and brute force attacks, compared to SUCV.
Design and Implementation of the Java Card API for Efficient File Management
Song Young-Sang ; Shin In-Chul ;
The KIPS Transactions:PartC, volume 13C, issue 3, 2006, Pages 275~282
DOI : 10.3745/KIPSTC.2006.13C.3.275
There are several independent applets to support various applications in a Java Card. Each applet in a Java Card processes and manages its own data without concern to other applets and their data. In this paper we proposed file system API to support efficient file management based on Java Card. Also we designed and implemented Java Card based file system API using basic API and referring to the file system standard defined in ISO 7816-4 Smart Card standard. By using proposed file system API, we can replace duplications of same code in each applet with short method call. So the used memory space and processing time is reduced and also the reduction of development time and cost will be expected.
Anomaly Detection Method Using Entropy of Network Traffic Distributions
Kang Koo-Hong ; Oh Jin-Tae ; Jang Jong-Soo ;
The KIPS Transactions:PartC, volume 13C, issue 3, 2006, Pages 283~294
DOI : 10.3745/KIPSTC.2006.13C.3.283
Hostile network traffic is often different from normal traffic in ways that can be distinguished without knowing the exact nature of the attack. In this paper, we propose a new anomaly detection method using inbound network traffic distributions. For this purpose, we first characterize the traffic of a real campus network by the distributions of IP protocols, packet length, destination IP/port addresses, TTL value, TCP SYN packet, and fragment packet. And then we introduce the concept of entropy to transform the obtained baseline traffic distributions into manageable values. Finally, we can detect the anomalies by the difference of entropies between the current and baseline distributions. In particular, we apply the well-known denial-of-service attacks to a real campus network and show the experimental results.
A Design of false alarm analysis framework of intrusion detection system by using incremental mining method
Kim Eun-Hee ; Ryu Keun-Ho ;
The KIPS Transactions:PartC, volume 13C, issue 3, 2006, Pages 295~302
DOI : 10.3745/KIPSTC.2006.13C.3.295
An intrusion detection system writes a lot of alarms against attack behaviors in real time. These alarms contain not only actual attack alarms, but also false alarms that are mistakes made by the intrusion detection system. False alarms are the main reason that reduces the efficiency of the intrusion detection system, and we propose framework for false alarms analysis in the paper. Also, we apply an incremental data mining method for pattern analysis of false alarms increasing continuously. The framework consists of GUI, DB Manager, Alert Preprocessor, and False Alarm Analyzer. We analyze the false alarms increasingly through the experiment of the proposed framework and show that false alarms are reduced by applying the analyzed false alarm rules in the intrusion detection system.
A study on performance analysis of synchronization clock with various clock states in NG-SDH networks
Lee Chang-Ki ;
The KIPS Transactions:PartC, volume 13C, issue 3, 2006, Pages 303~310
DOI : 10.3745/KIPSTC.2006.13C.3.303
This paper is to execute a study for characteristic analysis of synchronization clock and maximum network node number with various clock states, normal, SPT, LPT, in NG-SDH networks. Through the simulations, maximum network node numbers showed from 42 to 38 nodes in normal state. In SPT state, maximum network node numbers, when the last NE network applied to only SPT state, presented from 19 to 4 nodes, much less than normal state. Node numbers to meet specification in case of occurrence of SPT state in all NE networks decreased greatly. In LPT state, all maximum node numbers, when the last NE network applied to only LPT state, presented more than 50 nodes, and the results in case of occurrence of LPT state in all NE networks were also identified. However, node numbers to meet specification in case of LPT state in all DOTS networks were few large with difference between LPT and normal or SPT state.
Multiple Access Interference Suppressed Sensor Network Using Optical CDMA with Bipolar Receiver and Modified PN Code
Park Sang-Jo ; Kim Bong-Kyu ;
The KIPS Transactions:PartC, volume 13C, issue 3, 2006, Pages 311~316
DOI : 10.3745/KIPSTC.2006.13C.3.311
We propose the optical sensor network using optical CDMA with bipolar receiver and modified Pseudorandom Noise codes which are widely used in the wireless communication network. We numerically analyze the performances in the optical sensor network. In the proposed network, multiple access interferences between two sensors are suppressed by performing synchronization between the optical encoder and the optical decoder and adjusting the delay times of optical delay lines. Numerical simulations confirm that the performance can be acquired by suppressing the beat noise among optical signals as the number of sensors increases.
User-Cooperation and Cyclic Coding in Wireless Sensor Networks
Khuong Ho Van ; Kong Hyung-Yun ; Lee Dong-Un ;
The KIPS Transactions:PartC, volume 13C, issue 3, 2006, Pages 317~322
DOI : 10.3745/KIPSTC.2006.13C.3.317
This paper presents an efficient user-cooperation protocol associated with cyclic coding for WSNs (Wireless Sensor Networks) using LEACH(Low-Energy Adaptive Clustering Hierarchy). Since the proposed user-cooperation requires no CSI(Channel State Information) at both transmitter and receiver, and encoding and decoding of cyclic codes are simple, the processing complexity of sensor nodes is significantly reduced. Simulation results reveal such a combination can save the network energy up to 10dB over single-hop transmission at BER of
Efficient Handoff Time Decision Algorithm using Differential RSSI
Kwon Young-Hwan ; Choi Seong-Gon ; Choi Jun-Kyun ;
The KIPS Transactions:PartC, volume 13C, issue 3, 2006, Pages 323~330
DOI : 10.3745/KIPSTC.2006.13C.3.323
This paper proposes a handoff time decision mechanism to utilize resource efficiently by using Differential Received Signal Strength Indicator (DRSSI). DRSSI can be used to predict the movement direction of Mobile Station (MS). In other words, DRSSI changes its sign (+ or -) when a MS changes movement direction. This mechanism maximizes resource availability of Base Station (BS) by predicting resource reservation of MS and by giving priority of resource to MS. It is possible when a BS predicts the behavior of MSs by monitoring the DRSSI of MSs in overlapped region among cells. Additionally, we show that our proposed mechanism has better handoff blocking probability than existing mechanism with numerical modeling and analysis.
A study on improving the bandwidth utilization of fair packet schedulers
Kim Tae-Joon ; Kim Hwang-Rae ;
The KIPS Transactions:PartC, volume 13C, issue 3, 2006, Pages 331~338
DOI : 10.3745/KIPSTC.2006.13C.3.331
Most fair packet schedulers supporting quality-of-services of real-time multimedia applications are based on the finish time design scheme in which the expected transmission finish time of each packet is used as its timestamp. This scheme can adjust the latency of a flow with raising the flow`s scheduling rate but it may suffer from severe bandwidth loss due to the coupled rate and delay allocation. This paper first introduces the concept of delay resource, and then proposes a scheduling method to improve the bandwidth utilization in which delay resource being lost due to the coupled allocation is transformed into bandwidth one. The performance evaluation shows that the proposed method gives higher bandwidth utilization by up to 50%.
An Efficient Group Key Distribution Mechanism for the Secure Multicast Communication in Mobile Ad Hoc Networks
Lim Yu-Jin ; Ahn Sang-Hyun ;
The KIPS Transactions:PartC, volume 13C, issue 3, 2006, Pages 339~344
DOI : 10.3745/KIPSTC.2006.13C.3.339
Secure delivery of multicast data can be achieved with the use of a group key for data encryption in mobile ad hoc network (MANET) applications based on the group communication. However, for the support of dynamic group membership, the group key has to be updated for each member joining/leaving and, consequently, a mechanism distributing an updated group key to members is required. The two major categories of the group key distribution mechanisms proposed for wired networks are the naive and the tree-based approaches. The naive approach is based on unicast, so it is not appropriate for large group communication environment. On the other hand, the tree-based approach is scalable in terms of the group size, but requires the reliable multicast mechanism for the group key distribution. In the sense that the reliable multicast mechanism requires a large amount of computing resources from mobile nodes, the tree-based approach is not desirable for the small-sized MANET environment. Therefore, in this paper, we propose a new key distribution protocol, called the proxy-based key management protocol (PROMPT), which is based on the naive approach in the small-sized MANET environment. PROMPT reduces the message overhead of the naive through the first-hop grouping from a source node and the last-hop grouping from proxy nodes using the characteristics of a wireless channel.
TCP Performance Improvement Scheme in Network Mobility Environment
Kim Myung-Sup ; Choi Myung-Whan ;
The KIPS Transactions:PartC, volume 13C, issue 3, 2006, Pages 345~352
DOI : 10.3745/KIPSTC.2006.13C.3.345
In the integrated wired/wireless network which consists of the Internet and moving networks, multiple wireless links are used to connect a fixed host(FH) in the Internet to a mobile host(MH) in the moving network. For use in such an environment, we propose a scheme to overcome the TCP performance degradation due to the packet losses over the wireless links without losing the end-to-end TCP semantics. The proposed scheme in each mobile router(MR) allows to obtain the information regarding packet losses over the upstream wireless links based on the received packet sequence number and the ACK number. This information is delivered to the upstream router, which enables the upstream access router(AR) or MR to quickly retransmit the lost packets. The proposed scheme has the feature to quickly recover the packet losses incurred over the upstream wireless links and the performance of the proposed scheme is evaluated through simulation. It is shown that the significant performance gain can be obtained using the proposed scheme compared with the snoop mechanism which maintains end-to-end TCP semantics and does not require any additional features at the source and/or destination nodes.
Performance Improvement of TCP Vegas Using Estimation of End-to-End Forward/Backward Delay Variation
Shin Young-Suk ; Kim Eun-Gi ;
The KIPS Transactions:PartC, volume 13C, issue 3, 2006, Pages 353~358
DOI : 10.3745/KIPSTC.2006.13C.3.353
Unlike TCP Reno, TCP Vegas recognizes network congestion through the measuring of RTT (Round Trip Time) and decides the main congestion control parameters, such as Windows size. But, congestion avoidance scheme of Vegas poorly reflects asymmetric characteristics of packet path because TCP Vegas uses the measuring of RTT that reflects forward/backward packet transmission delay as a forward delay. The RTT can`t infer the forward/backward transmission delay variation because it only measures the packet`s turn around time. In this paper, We have designed and implemented a new Vegas congestion control algorithm that can distinguish forward/backward network congestion. We have modified the source codes of TCP Vegas in Linux 2.6 kernel and verified their performance.
A Study on PIN-based Authentication and ID Registration by Transfer in AAA System
Kang Seo-Il ; Lee Im-Yeong ;
The KIPS Transactions:PartC, volume 13C, issue 3, 2006, Pages 359~368
DOI : 10.3745/KIPSTC.2006.13C.3.359
AAA(Authentication, Authorization, Accounting) is the service that offers authentication, authorization, and accounting method, and every terminal that accesses the network requires this AAA service. The authentication process of a mobile terminal is as follows: a mobile phone accesses an authentication server in a home network via the authentication service in an external network, which receives the authentication result. And, for the home authentication server to offer secure service, a unique key is distributed for the secure communication between the external agent and the user, the external agent and the home authentication server, and the user and the home authentication server. This paper discusses and proposes the key distribution for secure communication among external authentication servers when a mobile terminal travels to an external network. As the proposed method does not require the home authentication server to reissue another authentication when a user travels to other external networks, it reduces the overload in the home authentication server. It can also distribute a PIN-driven key.
A Study on the Performance improvement of TEA adaptive equalizer using Precoding
Lim Seung-Gag ;
The KIPS Transactions:PartC, volume 13C, issue 3, 2006, Pages 369~374
DOI : 10.3745/KIPSTC.2006.13C.3.369
This paper related with the performance improvement of adaptive equalizer that is a based on the tricepstrum eqalization algorithm by using the received signal. Adaptive equalizer used for the improvement of communication performance, like as high speed, maintain of synchronization, BER, at the receive side in the environment of communication channel of the presence of the aditive noise, phase distortion and frequency selective fading, mainly. It`s characteristics are nearly same as the inverse characterstics of the communication channel. In this paper, the TEA algorithm using the HOS and the 16-QAM which is 2-dimensional signaling method for being considered signal was used. For the precoding of 16-QAM singnal in the assignment of the signal costellation, Gray code was used, and the improvement of performance was gained by computer simulation in the residual intersymbol interence and mean squared error which is representive measurement of adaptive equalizer.
Lightweight Home Network Middleware Security Mechanism supporting Mobility Management
Koh Kwang-Man ; Hyun Ho-Jae ; Hong Ju-Hee ; Han Sun-Young ;
The KIPS Transactions:PartC, volume 13C, issue 3, 2006, Pages 375~382
DOI : 10.3745/KIPSTC.2006.13C.3.375
As various kinds of embedded systems (or devices) become widely available, research on home network middleware which can access and control embedded home appliances are actively being progressed. However, there is a significant problem in applying the home network technology to embedded systems because of their limited storage space and low computing power. In this paper, we present a lightweight middleware for home network on embedded systems. Also, we propose a mechanism for mobility management which adopts the anycast technology.
A Development of Synthetic Map Preprocessor for Mobile GIS Visualization based on GML
Song Eun-Ha ; Park Yong-Jin ; Han Sung-Kook ; Jeong Young-Sik ;
The KIPS Transactions:PartC, volume 13C, issue 3, 2006, Pages 383~388
DOI : 10.3745/KIPSTC.2006.13C.3.383
Most of GIS services have been operated in single applications, and as data processing and computer and mobile technologies have developed rapidly, users request for efficient sharing between each GIS`s own data and various different GIS`s. However, since many GIS applications maintain their own data formats, they are incapable of processing data formats different with each other, and do not have a filtering function for mobile GIS. This paper designs an integrated preprocessor, SMP to accept features of various current formats of geographic information such as DXF(Drawing eXchange Format), DWG(DraWinG), SHP(SHaPefile), etc., and to extract core information for describing maps. The geographic information extracted by SMP(Synthetic Map Preprocessor) shows consistency in various formats by visualizing through the integrated view. By generating the extracted core data in GML, it supports rapid access to mobile devices and extensibility of file formats overcoming heterogeneity.