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
Analysis of Block FEC Symbol Size`s Effect On Transmission Efficiency and Energy Consumption over Wireless Sensor Networks
Ahn, Jong-Suk ; Yoon, Jong-Hyuk ; Lee, Young-Su ;
The KIPS Transactions:PartC, volume 13C, issue 7, 2006, Pages 803~812
DOI : 10.3745/KIPSTC.2006.13C.7.803
This paper analytically evaluates the FEC(Forward Error Correction) symbol size`s effect on the performance and energy consumption of 802.11 protocol with the block FEC algorithm over WSN(Wireless Sensor Network). Since the basic recovery unit of block FEC algorithms is symbols not bits, the FEC symbol size affects the packet correction rate even with the same amount of FEC check bits over a given WSN channel. Precisely, when the same amount of FEC check bits are allocated, the small-size symbols are effective over channels with frequent short bursts of propagation errors while the large ones are good at remedying the long rare bursts. To estimate the effect of the FEC symbol site, the paper at first models the WSN channel with Gilbert model based on real packet traces collected over TIP50CM sensor nodes and measures the energy consumed for encoding and decoding the RS (Reed-Solomon) code with various symbol sizes. Based on the WSN channel model and each RS code`s energy expenditure, it analytically calculates the transmission efficiency and power consumption of 802.11 equipped with RS code. The computational analysis combined with real experimental data shows that the RS symbol size makes a difference of up to 4.2% in the transmission efficiency and 35% in energy consumption even with the same amount of FEC check bits.
A Lightweight Packet Filter for Embedded System
Lee, Byong-Kwon ; Jeon, Joong-Nam ;
The KIPS Transactions:PartC, volume 13C, issue 7, 2006, Pages 813~820
DOI : 10.3745/KIPSTC.2006.13C.7.813
The advance of computer and communication technologies enables the embedded systems to be equipped with the network communication interfaces. Their appearance in network leads to security issues on the embedded systems. An easy way to overcome the security problem is to adopt the packet filter that is implemented in the general computer systems. However, general packet filters designed for host computers are not suitable to embedded systems because of their complexity. In this paper, we propose a lightweight packet filter for embedded systems. The lightweight packet filter is implemented in the kernel code. And we have installed a Web-GUI interface for user to easily set the filtering policies at remote space. The experimental results show that the proposed packet filter decreases the packet delivery time compared to the packet filter designed for host computers and it is comparable to the systems without packet filter
A Fast String Matching Scheme without using Buffer for Linux Netfilter based Internet Worm Detection
Kwak, Hu-Keun ; Chung, Kyu-Sik ;
The KIPS Transactions:PartC, volume 13C, issue 7, 2006, Pages 821~830
DOI : 10.3745/KIPSTC.2006.13C.7.821
As internet worms are spread out worldwide, the detection and filtering of worms becomes one of hot issues in the internet security. As one of implementation methods to detect worms, the Linux Netfilter kernel module can be used. Its basic operation for worm detection is a string matching where coming packet(s) on the network is/are compared with predefined worm signatures(patterns). A worm can appear in a packet or in two (or more) succeeding packets where some part of worm is in the first packet and its remaining part is in its succeeding packet(s). Assuming that the maximum length of a worm pattern is less than 1024 bytes, we need to perform a string matching up to two succeeding packets of 2048 bytes. To do so, Linux Netfilter keeps the previous packet in buffer and performs matching with a combined 2048 byte string of the buffered packet and current packet. As the number of concurrent connections to be handled in the worm detection system increases, the total size of buffer (memory) increases and string matching speed becomes low In this paper, to reduce the memory buffer size and get higher speed of string matching, we propose a string matching scheme without using buffer. The proposed scheme keeps the partial matching result of the previous packet with signatures and has no buffering for previous packet. The partial matching information is used to detect a worm in the two succeeding packets. We implemented the proposed scheme by modifying the Linux Netfilter. Then we compared the modified Linux Netfilter module with the original Linux Netfilter module. Experimental results show that the proposed scheme has 25% lower memory usage and 54% higher speed compared to the original scheme.
Secure and Efficient Secret Sharing Scheme Based on Wide Pipe Hash Function
Kim, Hie-Do ; Won, Dong-Ho ;
The KIPS Transactions:PartC, volume 13C, issue 7, 2006, Pages 831~836
DOI : 10.3745/KIPSTC.2006.13C.7.831
In this paper, we propose a secure and efficient secret sharing scheme Based on wide pipe hash function This scheme provides the property to share multiple secrets and allows participants to be added/deleted dynamically, without haying to redistribute new secret shares. Proposed scheme has advantage to detect cheating and identify of all cheater, regardless of their number. Futhermore, it is more secure and efficient than previous schemes based on hash function.
Protect Digital Contents and Instant Player using PKI
Ryu, Seok ;
The KIPS Transactions:PartC, volume 13C, issue 7, 2006, Pages 837~842
DOI : 10.3745/KIPSTC.2006.13C.7.837
According to the development of the internet technology, many people can access many kind of digital contents. This approach can infringe the copyright and right owner-ship. Currently many people research the DRM(Digital Rights Management) for protect digital content after digital content downloaded. This paper propose the system that client player witch encrypted using PKI have symmetric key and CCI (copy control information), decrypt digital content witch encrypted when digital content created.
A Study on Encryption Method using Hash Chain and Session Key Exchange in DRM System
Park, Chan-Kil ; Kim, Jung-Jae ; Lee, Kyung-Seok ; Jun, Moon-Seog ;
The KIPS Transactions:PartC, volume 13C, issue 7, 2006, Pages 843~850
DOI : 10.3745/KIPSTC.2006.13C.7.843
This is devoted to first, to propose a hash chain algorithm that generates more secure key than conventional encryption method. Secondly, we proposes encryption method that is more secure than conventional system using a encryption method that encrypts each block with each key generated by a hash chain algorithm. Thirdly, After identifying the user via wired and wireless network using a user authentication method. We propose a divided session key method so that Although a client key is disclosed, Attackers cannot catch a complete key and method to safely transfer the key using a divided key method. We make an experiment using various size of digital contents files for performance analysis after performing the design and implementation of system. Proposed system can distribute key securely than conventional system and encrypt data to prevent attacker from decrypting complete data although key may be disclosed. The encryption and decryption time that client system takes to replay video data fie is analogous to the conventional method.
Methodology of Analyze the Risk Using Method of Determinated Quantity
Park, Joong-Gil ;
The KIPS Transactions:PartC, volume 13C, issue 7, 2006, Pages 851~858
DOI : 10.3745/KIPSTC.2006.13C.7.851
The risk analysis`s aim is analyze the risk for the asset of organization with asset assessment, vulnerability assessment, threat assessment. existing TTA risk analysis methodology model propose to overall flow, but can not propose to detail behavior or each level. That is, step of risk analysis is insufficient in classification of threat and detail proposal of considered the risk with classified threat. So this paper propose that analysis and evaluate the vulnerability and threat assessment with determinated quantity. this paper consider current national information system and threat of environment and technology. So can estimate the risk with determinated quantity. Finally, analyze the asset risk of organization.
A Distinction Technology for Harmful Web Documents by Rates
Kim, Yong-Soo ; Nam, Taek-Yong ; Won, Dong-Ho ;
The KIPS Transactions:PartC, volume 13C, issue 7, 2006, Pages 859~864
DOI : 10.3745/KIPSTC.2006.13C.7.859
The openness of the Web allows any user to access almost 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 all users, notably children. Additionally for adults, some contents included in abnormal porn sites can do ordinary people`s mental health harm. In the meantime, since Internet is a worldwide open network it has a limit to regulate users providing harmful contents through each countrie`s national laws or systems. Additionally it is not a desirable way of developing a certain system-specific classification technology for harmful contents, because internet users can contact with them in diverse way, for example, porn sites, harmful spams, or peer-to-peer networks, etc. Therefore, it is being emphasized to research and develop context-based core technologies for classifying harmful contents. In this paper, we propose an efficient text filter for blocking harmful texts of web documents using context-based technologies.
A Cooperative Signaling Structure using the ¾ - rate STBC in Wireless Networks with Rayleigh Fading Channels
Khuong Ho Van ; Kong Hyung-Yun ; Choi Jeong-Ho ;
The KIPS Transactions:PartC, volume 13C, issue 7, 2006, Pages 865~872
DOI : 10.3745/KIPSTC.2006.13C.7.865
Cooperative communications (CC) have received a great deal of attention recently as an efficient way to obtain the spatial diversity without physical arrays. Thus, space-time block codes (STBC) which are well-known for use in co-located multi-antenna systems can be still utilized for single-antenna users in a distributed fashion. In this paper, we propose a cooperative signaling structure using the
-rate STBC and derive closed-form BER expression which takes the effect of network geometry and transmit power constraint into account. A variety of simulated and numerical results demonstrated the cooperation considerably outperforms the direct transmission when partners are located in appropriate positions.
A Low-latency L2 Handoff Scheme between WiBro and cdma2000 Mobile Networks
Lee, Geon-Baik ; Cho, Jin-Sung ;
The KIPS Transactions:PartC, volume 13C, issue 7, 2006, Pages 873~880
DOI : 10.3745/KIPSTC.2006.13C.7.873
Since various networks are deployed and the most of users request higher mobility, there are many researches about the interworking between widely deployed 3G network and rapidly boarded WLAN. On the other side, WiBro is focused on as a next generation network, because many people expect that WiBro gives satisfaction about the enough mobility and mass data transmission. So the study of the integration between WiBro and cdma2000 will show better effects than the present study of the integration between WLAN and cdma2000. The L2 handoff proposed in this paper takes advantages over the existing L3 handoff scheme because it does not require the L3 procedure for the mobility unlike the L3 handoff. Through extensive computer simulations, the efficiency of the proposed scheme has been validated.
Issues and Improvement Methods of the Bridge Tab in Customer Premises Telecommunications Facilities for High-Speed Communication Network
Min, Gyeong-Ju ; Hong, Jae-Hwan ; Nam, Sang-Sig ; Kim, Jeong-Ho ;
The KIPS Transactions:PartC, volume 13C, issue 7, 2006, Pages 881~888
DOI : 10.3745/KIPSTC.2006.13C.7.881
The position of the bridged tap is determined by that of the outlet in most modern apartments, since most of the indoor wiring utilizes the bus wiring structure when deploying the indoor communication line. These bridged taps deteriorate transmission performance in the specific frequency at the time of high-speed multimedia communication, which uses a high frequency bandwidth, since the duality of return loss worsens and line attenuation increases rapidly. As a result, analysis on this phenomenon is required. In this study, the test model is created by modeling the intercommunication facility of the apartment that is the most representative residential house type, and by understanding the structure and the environment of the indoor wiring. Also, how the bridge tap affects performance is analyzed when the VDSL service is provided, so that problems of intercommunication lines can be identified and methods for improving the proper intercommunication line can be suggested, which is suitable for accommodating high-speed multimedia service of the future.
Improvement of F-GCRA Algorithm for ATM-GFR Service
Park, In-Yong ;
The KIPS Transactions:PartC, volume 13C, issue 7, 2006, Pages 889~896
DOI : 10.3745/KIPSTC.2006.13C.7.889
ATM Forum has defined a guaranteed frame rate (GFR) service to serve Internet traffic efficiently. The GFR service provides virtual connections (VCs) for minimum cell rate (MCR) guarantees and allows them to fairly share the residual bandwidth. And ATM Forum has recommended a frame-based generic cell rate algorithm (F-GCRA) as a frame classifier, which determines whether an Am cell is eligible to use the guaranteed bandwidth in a frame level. An ATM switch accommodates cells in its buffer or drops them in a frame level according to current buffer occupancy. A FIFO shared buffer has so simple structure as to be feasibly implemented in switches, but has not been able to provide an MCR guarantee for each VC without buffer management based on per-VC accounting. In this paper, we enhance the F-GCRA frame classifier to guarantee an MCR of each VC without buffer management based on per-VC accounting. The enhanced frame classifier considers burstness of TCP traffic caused by congestion control algorithm so as to enable each VC to use its reserved bandwidth sufficiently. In addition, it is able to alleviate the unfairness problem in usage of the residual bandwidth. Simulation results show that the enhanced frame classifier satisfies quality of services (QoSs) of the GFR service for the TCP traffic.
A MANET Routing Protocol using Address Autoconfiguration in Zone-based MANETs
Park, Ik-Kyun ; Kang, Nam-Hi ; Kim, Young-Han ;
The KIPS Transactions:PartC, volume 13C, issue 7, 2006, Pages 897~904
DOI : 10.3745/KIPSTC.2006.13C.7.897
In large-scale MANETs, the performance of MANET routing protocols is degraded significantly. To avoid this, zone-based hierarchical architecture is proposed. In this architecture, single large-scale MANET is divided into multiple small-scale MANETs. In this paper, we propose autoconfiguration-coupled MANET routing protocol to reduce routing overhead of mim user nodes. If MANET routing protocol utilizes the autoconfigured information of each user node, its overhead or procedure can be reduced. Proposed method shows the degradation of routing overhead of user nodes via simulation.
A Rendezvous Router Decision Algorithm Considering Routing Table Size
Cho, Kee-Seong ; Jang, Hee-Seon ; Kim, Dong-Whee ;
The KIPS Transactions:PartC, volume 13C, issue 7, 2006, Pages 905~912
DOI : 10.3745/KIPSTC.2006.13C.7.905
Depending on the location of the rendezvous point (RP), the network efficiency is determined in the core based tree (CBT) or protocol independent multicast-sparse mode (PIM-5M) multicasting protocol to provide the multicast services based on the shared tree. In this paper, a new algorithm to allocate the RP using the estimated values of the total cost and the size(number of entries) of the routing tables is proposed for efficiently controlling the cost and the number of routing table entries. The numerical results show that the proposed algorithm reduces the total cost in 5.37%, and the size of routing tables in 13.35% as compared to the previous algorithm.
A Efficient Key Distribution Scheme for Individual/Group Communication on TRS
Lee, Deok-Gyu ; Park, Yong-Suk ; Ahn, Jong-Chul ; Lee, Im-Yeong ;
The KIPS Transactions:PartC, volume 13C, issue 7, 2006, Pages 913~922
DOI : 10.3745/KIPSTC.2006.13C.7.913
It used exclusively the radio communication where is the TRS(Trunked Radio Service) at frequency where the person whom it does is specific with hitherto radio communication method differently frequency of the decimal which is allocated to the relay station it talks the at the room which the multiple user uses with commonness. The TRS system the most big feature is the region multiple group and order communication method. The TRS the composition of system is composed of the multi mind group, the each group is composed of the terminal of the users who have the objective which is similar relates in business contents. With above it follows in same multi objective and the connection of the form which is various or group communication accomplishes and quality case, a possibility a or of having many problem point in key distribution for a large scale communication there is it could be exposed to attack of the form which is various. There is a place where it accomplishes the communication which is safe at the TRS from research which it sees it investigates group key distribution method which is an essential element. The method which it sees when it reduces a communication frequency, it stands but is the user, it proposes the efficient group key distribution method it will be able to accomplish.
Comparison and Performance Analysis of Connection Management Methods in the Centralized Server Based Network
Kwon, Tae-Hyun ; Yim, Young-Eun ; Choi, In-Sang ; Kim, Choon-Hee ; Cha, Young-Wook ;
The KIPS Transactions:PartC, volume 13C, issue 7, 2006, Pages 923~932
DOI : 10.3745/KIPSTC.2006.13C.7.923
For the successful promotion about the NGN (Next Generation Network), centralized network control and management technology is required to guarantee QoS and Traffic Engineering. This paper describes SNMP. Web Services and Network Open Interface based connection management scheme which can be used in centralized server based network in which the control plane is separated from transport plane. We also constructed platforms about each of these connection management schemes and performed comparing and analyzing the performance of connection setup delays.
Adaptive Online Network Management for QoS Sensitive Multimedia Services
Kim, Sung-Wook ; Kim, Sung-Chun ;
The KIPS Transactions:PartC, volume 13C, issue 7, 2006, Pages 933~938
DOI : 10.3745/KIPSTC.2006.13C.7.933
Different multimedia services over networks not only require different amounts of bandwidth but also have different Qualify of Service (QoS) requirements. For example, QoS guarantees for higher priority calls is an important issue in multimedia communication networks. In this paper, we develop an adaptive bandwidth management algorithm, which is able to provide QoS guarantees for higher priority calls while accommodating as many heterogeneous multimedia call connections as possible. Our scheme, based on reservation and bandwidth adaptation, manages bandwidth based on real time estimates of current network conditions. Simulation results indicate the superior performance of our scheme providing excellent trade off between contradictory requirements.