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 12C, Issue 7 - Dec 2005
Volume 12C, Issue 6 - Oct 2005
Volume 12C, Issue 5 - Oct 2005
Volume 12C, Issue 4 - Aug 2005
Volume 12C, Issue 3 - Jun 2005
Volume 12C, Issue 2 - Apr 2005
Volume 12C, Issue 1 - Feb 2005
Selecting the target year
Per Packet Authentication Scheme Using One-bit in 802.11 Wireless LAN
Lee Sungryoul ; Kang Jimyung ; Moon hogun ; Lee myungsoo ; Kim Chong-Kwon ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 465~472
DOI : 10.3745/KIPSTC.2005.12C.4.465
IEEE 802.11 wireless LAN technology is essential for wireless internet, next generation converged network and home network. But, it is certain that user`s privacy must be provided to expand the applicable area in IEEE 802.11 WLAN. Recently, WEP and 802.11i security scheme can be used in MAC Layer. But with VPN technology which is applied to WLAN user, it means that suity mechanism is used redundantly. One bit authentication mechanism was already proposed to solve this redundancy. In this paper, we analyze problems of 1-bit Authentication mechanism which are failure of synchronization and waste of packet. And we propose new algorithm which synchronizes sender with receiver, at once, using duplicated-packet-count information. We show that our algorithm improves success probability of packet authentication up to
and efficiency of authentication bit stream up to
Cluster-based Pairwise Key Establishment in Wireless Sensor Networks
Chun Eunmi ; Doh Inshil ; Oh Hayoung ; Park Soyoung ; Lee Jooyoung ; Chae Kijoon ; Lee Sang-Ho ; Nah Jaehoon ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 473~480
DOI : 10.3745/KIPSTC.2005.12C.4.473
We can obtain useful information by deploying large scale sensor networks in various situations. Security is also a major concern in sensor networks, and we need to establish pairwise keys between sensor nodes for secure communication. In this paper, we propose new pairwise key establishment mechanism based on clustering and polynomial sharing. In the mechanism, we divide the network field into clusters, and based on the polynomial-based key distribution mechanism we create bivariate Polynomials and assign unique polynomial to each cluster. Each pair of sensor nodes located in the same cluster can compute their own pairwise keys through assigned polynomial shares from the same polynomial. Also, in our proposed scheme, sensors, which are in each other`s transmission range and located in different clusters, can establish path key through their clusterheads. However, path key establishment can increase the network overhead. The number of the path keys and tine for path key establishment of our scheme depend on the number of sensors, cluster size, sensor density and sensor transmission range. The simulation result indicates that these schemes can achieve better performance if suitable conditions are met.
Boundary Zone Overlapping Scheme for Fast Handoff Based on Session Key Reuse
Choi, Yu-Mi ; Chung, Min-Young ; Choo, Hyun-Seung ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 481~488
DOI : 10.3745/KIPSTC.2005.12C.4.481
The Mobile W provides an efficient and scalable mechanism for host mobility within the Internet. However, the mobility implies higher security risks than static operations in fixed networks. In this paper, the Mobile IP has been adapted to allow AAA protocol that supports authentication, authorization, and accounting(AAA) for security and collection for accounting information of network usage by mobile nodes(MNs). For this goal, we Propose the boundary tone overlapped network structure while solidifying the security for the authentication of an MN. That is, the Proposed scheme delivers the session keys at the wired link for MN`s security instead of the wireless one, so that it provides a fast and seamless handoff mechanism. According to the analysis of modeling result, the proposed mechanism compared to the existing session key reuse method is up to about
better in terms of normalized surcharge for the handoff failure rate that considers handoff total time.
A Study On ID-Based Group Signature
Kim, Dae-Youb ; Ju, Hak-Soo ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 489~494
DOI : 10.3745/KIPSTC.2005.12C.4.489
In 2002, Shundong Xia proposed a new ID-based group signature scheme with strong separability. The nature of a strong separability is to divide group manager`s role into a membership manager and a revocation manager Jianhong et al showed that the scheme was not coalition-resistant. In this letter, we first propose two new attacks, forgery and link attacks, for Xia-You`s scheme. We also propose a new ID-based group signature scheme that Is resistant to coalition, forgery and link attacks
Validation Testing Tool for Light-Weight Stream Ciphers
Kang Ju-Sung ; Shin Hyun Koo ; Yi Okyeon ; Hong Dowon ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 495~502
DOI : 10.3745/KIPSTC.2005.12C.4.495
Cryptographic algorithm testing is performed to ensure that a specific algorithm implementation is implemented correctly and functions correctly. CMVP(Cryptographic Module Validation Program) of NIST in US is the well-known testing system that validates cryptographic modules to Federal Information Processing Standards (FIPS). There is no FIPS-approved stream cipher, and CMVP doesn`t involve its validation testing procedure. In this paper we provide validation systems for three currently used light-weight stream ciphers: Bluetooth encryption algorithm E0, 3GPP encryption algorithm A5/3, and RC4 used for WEP and SSL/TLS Protocols. Moreover we describe our validation tools implemented by JAVA programing.
High-Speed Pattern Matching Algorithm using TCAM
Sung Jungsik ; Kang Seok-Min ; Lee Youngseok ; Kwon Taeck-Geun ; Kim Bongtae ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 503~510
DOI : 10.3745/KIPSTC.2005.12C.4.503
With the increasing importance of network protection from cyber threats, it is requested to develop a multi-gigabit rate pattern matching method for protecting against malicious attacks in high-speed network. This paper devises a high-speed pattern matching algorithm with TCAM by using an m-byte jumping window pattern matching scheme. The proposed algorithm significantly reduces the number of TCAM lookups per payload by m times with the marginally enlarged TCAM size which can be implemented by cascading multiple TCAMs. Due to the reduced number of TCAM lookups, we can easily achieve multi-gigabit rate for scanning the packet payload. It is shown by simulation that for the Snort nile with 2,247 patterns, our proposed algorithm supports more than 10 Gbps rate with a 9Mbit TCAM.
PAPR Reduction Improvement for WHT-based OFDM System using Data Grouping Technique
Kong Hyung-Yun ; Khuong Ho Van ; Nam Doo-Hee ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 511~518
DOI : 10.3745/KIPSTC.2005.12C.4.511
The conventional OFDM (Orthogonal Frequency Division Multiplexing) modulation can be combined with WHT (Walsh-Hadamard Transform) to reduce PAPR (Peak-to-Average Power Ratio) and improve BER (Bit Error Rate) performance. However, this WHT-based OFDM system still suffers a relatively high PAPR. Therefore, we suggest a new technique, called DGT (Data Grouping Technique) and design an OFDM system employing it and WHT to further decrease PAPR without the BER performance degradation. h salient property of DGT is the independence of the side information which is inherently a principal drawback of the well-known PAPR reduction techniques for OFDM system as well as WHT-based OFDM. The simulation programs have been also performed to verify the validity of the proposed system.
Photo Sensor Based Measurement and Noise Reduction of Dynamic Weights
Shin, Dae-Jung ; Na, Seung-You ; Kim, Jin-Young ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 519~524
DOI : 10.3745/KIPSTC.2005.12C.4.519
Due to various types of errors added to dynamic weight measurement data, proper methods to reduce measurement errors are required to produce reliable weights. It is very difficult to reduce the measurement error due to excessive oscillation of the system. To cope with parasitic types of errors in real systems, information provided by the photo sensors are utilized and combined in such a way to reduce the measurement errors of load cells. In addition to four channels of load cells from a model trailer, photo sensors are used to obtain the information to compensate the error induced from vertical movement of the vehicle due to the variation of ground level. A model trailer system is run to verify the effectiveness of the proposed method to reduce noise of dynamic weight measurements.
Connectivity-Based Distributed Localization in Wireless Sensor Network
Kwon Oh-Heum ; Song Ha-Joo ; Kim Sook-Yeon ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 525~534
DOI : 10.3745/KIPSTC.2005.12C.4.525
We present several distributed algorithms for localizing nodes of a wireless sensor network. Our algorithms determine locations of nodes based on the connectivity between nodes. The basic idea behind our algorithms is to estimate distances between nearby nodes by counting their common neighbors. We analyze the performance of our algorithms experimentally. The results of experiments show that our algorithms achieve performance improvements upon the existing algorithms
Node Density Based Routing in Ad Hoc Networks
Kim Sang-Kyung ; Choi Seung-Sik ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 535~542
DOI : 10.3745/KIPSTC.2005.12C.4.535
This paper proposes an on-demand ad hoc routing protocol, Node Density Based Routing (NDBR), which enhances the routing performance applying a new method to establish alternate patlis. It is important to reserve alternate paths for the route from source to destination in mobile ad hoc networks that are susceptible to failure due to the movement or the power exhaustion of mobile nodes. NDBR aims to establish a route that contains more alternate paths toward the destination by involving intermediate nodes with relatively more adjacent nodes in a possible route, and introduces a new routing criterion called `node density.` This approach can localize the effects of route failures, and reduce control traffic overhead and route reconfiguration time by enhancing the reachability to the destination node without source-initiated route re-discoveries at route failures. This paper describes the route setup procedure using node density and the route re-configuration procedures employing alternate path information at the intermediate nodes. We show the performance of our routing schemes through a series of simulations using the Network Simulator 2 (ns-2).
A Study of SSA Routing Protocol using Utilization Metric in Ad Hoc Networks
Ji Jong-Bok ; Park Joo-Ha ; Lee Kaug-Seok ; Song Joo-Seok ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 543~550
DOI : 10.3745/KIPSTC.2005.12C.4.543
Many routing algorithms, proposed for ad-hoc wireless networks, we based on source routing scheme and shortest path route has short lifetime especially in highly dense ad-hoc wireless networks. So some routing protocols such as SSA and ABR are considering the link stability and try finding more stable route. In this paper we propose a new routing algorithm considering utilization metric based on SSA routing algerian in Ad-Hoc networks. To reduce the bottleneck by specific metric of SSA, proposed scheme makes load balancing in networks by distributing the connections to several routes. For the evaluation of the performance we compare our scheme with existent routing protocol AODV and SSA. And the results, obtained using the ns-2 network simulation platform, show good performance that reduced the number of reconstructions remarkably by distributing the whole traffic to several routes when there are several stable routes.
Implementation and Analysis of the FMIPv6 (Fast Handover for Mobile IPv6) Using Layer 2 Triggers
Oh, Seung-Hun ; Lee, Sung-Sik ; Kim, Young-Han ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 551~558
DOI : 10.3745/KIPSTC.2005.12C.4.551
In this paper, we implement the fast handovers for mobile IPv6 (FMIPv6) on Linux system. Due to its dependency on operations in layer-2 (L2), we have added some functions into the network driver to generate triggers as the mobile node moves. We design and implement the FMIPv6 functions divided into two parts as an access router and a mobile node. We compare the packet loss and delay of the FMIPv6 implementation during the handover period with those of the MIPv6 and investigate the performance improvement.
The Optimal Threshold for ECN Marking
Lee, Gye-Young ; Yim, Jae-Geol ; Jang, Ik-Hyeon ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 559~570
DOI : 10.3745/KIPSTC.2005.12C.4.559
ECN is accurate in determining traffic congestion since it explicitly notifies the incipient congestion. Therefore, ECN method has been thoroughly studied in the field of wireless TCP. This paper introduces a formula to find the optimal threshold for ECN marking. We have implemented a Petri net model of `TCP with ECN strategy` and performed simulations on it in order to verify the validity of the formula. We have also introduced ideas of applying the formula in practice. The primary contribution of this paper is proposing a formula to find the optimal threshold for ECN marking. However, introducing the Petri net model of `TCP with ECN strategy` is no less valuable contribution because it can be helpfully used by the researchers in studying network protocols. We have built the Petri net model by modifying the existing Petri net model of TCP. In order to add ECN strategy to the existing model, we have mainly modified the network part. We have also modified sender part and receiver part as well.
Congestion Control Scheme for Wide Area and High-Speed Networks
Yang Eun Ho ; Ham Sung Il ; Cho Seongho ; Kim Chongkwon ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 571~580
DOI : 10.3745/KIPSTC.2005.12C.4.571
In fast long-distance networks, TCP`s congestion control algorithm has the problem of utilizing bandwidth effectively. Several window-based congestion control protocols for high-speed and large delay networks have been proposed to solve this problem. These protocols deliberate mainly three properties : scalability, TCP-friendliness, and RTT-fairness. These protocols, however, cannot satisfy above three properties at the same time because of the trade-off among them This paper presents a new window-based congestion control algorithm, called EM (Exponential Increase/ Multiplicative Decrease), that simultaneously supports all four properties including fast convergence, which is another important constraint for fast long-distance networks; it can support scalability by increasing congestion window exponentially proportional to the time elapsed since a packet loss; it can support RTT-fairness and TCP-friendliness by considering RTT in its response function; it can support last fair-share convergence by increasing congestion window inversely proportional to the congestion window just before packet loss. We evaluate the performance of EIMD and other algorithms by extensive computer simulations.
The Development of Mobile Grid System and Performance Evaluation
Kim Tae-Kyung ; Kim Hee-Seung ; Lee Hyun-Joo ; Chung Tai-Myung ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 581~588
DOI : 10.3745/KIPSTC.2005.12C.4.581
The performance of mobile devices and wireless networks is improved rapidly and Mobility management skills such as Mobile IP and ad-hoc technology were developed. So the requirement of processing the distributed computing is highly increased in any place and any time or in the state of movement. Therefore we studied the mobile grid system to process the distributed applications properly in wireless networks. In addition to typical computational resources, Mobile Grid brings new resources such as sensor, mobile devices or other wireless devices to distributed computing for the purpose of resource-sharing. In this paper, we design and implement the mobile grid system in wireless lan network environment for the providing the grid service. Also, we evaluate the performance of mobile grid system using the processing the distributed applications in implemented mobile grid environments.
A Design and Implementation of a Home Gateway based on the RTC Technology Supporting Live Video Streaming
Kim, Hye-Sun ; Hwang, Ki-Tae ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 589~596
DOI : 10.3745/KIPSTC.2005.12C.4.589
The objective of this paper lies in the design and implementation of a home gateway supporting live video streaming which flows from the Non-SIP video camera in home to the mobile SIP device outside. We developed the home gateway on the OSGi framework and employed the RTC technology which embeds an SIP stack so that the multimedia session can be established from the home device to the mobile user outside. And also we developed an RTC bundle to manage the session and a virtual capture device driver to read the video stream from the Non-SIP video camera in the home network, and installed them on the home gateway. Finally, we constructed the experimental environment that has the windows messenger as the SIP mobile device and an AXIS 2100 UPnP video camera as a video source, and then tested if the session establishment to the mobile user from the camera and live video streaming work well between them.
A Study on Improving the Billing System of the Wireless Internet Service
Min Gyeongju ; Hong Jaehwan ; Nam Sangsig ; Kim Jeongho ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 597~602
DOI : 10.3745/KIPSTC.2005.12C.4.597
In this study, file size for measurement and the service system`s billing data were submitted to a comparative analysis by performing a verification test on the billing system of three major mobile communication services providers, based on the wireless Internet service packet. As shown in the result of the verification test, there were some differences in the billing data due to transmission overhead, according to the network quality that is affected by the wireless environment of mobile operators. Consequently, the packet analysis system was proposed as a means of applying consistent packet billing to all service providers being compared. If the packet analysis system is added to supplement the current billing system various user requirements can be met. Billing by Packet among mobile operators and differentiated billing based on the content value are available, since the packet data can be extracted through protocol analysis by service, and it can be classified by content tape through traffic data analysis. Furthermore, customer`s needs can be satisfied who request more information on the detailed usage, and more flexible and diverse billing policies can be supported like application of charging conditions to the non-charging packet handling. All these services are expected to contribute to the popularization of the wireless Internet service, since user complaints about the service charge could be reduced.
Performance Evaluation of Disk I/O for Web Proxy Servers
Shim Jong-Ik ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 603~608
DOI : 10.3745/KIPSTC.2005.12C.4.603
Disk I/O is a major performance bottleneck of web proxy server. Today`s most web proxy sowers are design to run on top of a general purpose file system. But general purpose file system can not efficiently handle web cache workload, small files, leading to the performance degradation of entire web proxy servers. In this paper we evaluate the performance potential of raw disk to reduce disk I/O overhead of web proxy servers. To show the performance potential of raw disk, we design a storage management system called Block-structured Storage Management System (BSMS). And we also actually implement web proxy server that incorporate BSMS in Squid. Comprehensive experimental evaluations show that raw disk can be a good solution to improve disk I/O performance significantly for web proxy servers.
A Combination of Signature-based IDS and Machine Learning-based IDS using Alpha-cut and Beta pick
Weon, Ill-Young ; Song, Doo-Heon ; Lee, Chang-Hoon ;
The KIPS Transactions:PartC, volume 12C, issue 4, 2005, Pages 609~616
DOI : 10.3745/KIPSTC.2005.12C.4.609
Signature-based Intrusion Detection has many false positive and many difficulties to detect new and changed attacks. Alpha-cut is introduced which reduces false positive with a combination of signature-based IDS and machine learning-based IDS in prior paper . This research is a study of a succession of Alpha-cut, and we introduce Beta-rick in which attacks can be detected but cannot be detected in single signature-based detection. Alpha-cut is a way of increasing detection accuracy for the signature based IDS, Beta-pick is a way which decreases the case of treating attack as normality. For Alpha-cut and Beta-pick we use XIBL as a learning algorithm and also show the difference of result of Sd.5. To describe the value of proposed method we apply Alpha-cut and Beta-pick to signature-based IDS and show the decrease of false alarms.