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
An Improved Protocol for Establishing A Session Key in Sensor Networks
Kim Jong-Eun ; Cho Kyung-San ;
The KIPS Transactions:PartC, volume 13C, issue 2, 2006, Pages 137~146
DOI : 10.3745/KIPSTC.2006.13C.2.137
Because the traditional public key-based cryptosystems are unsuitable for the sensor node with limited computational and communication capability, a secure communication between two neighbor sensor nodes becomes an important challenging research in sensor network security. Therefore several session key establishment protocols have been proposed for that purpose. In this paper, we analyzed and compared the existing session key establishment protocols based on the criterions of generation strategy and uniqueness of the session key, connectivity, overhead of communication and computation, and vulnerability to attacks. Based on the analysis results, we specify the requirements for the secure and efficient protocols for establishing session keys. Then, we propose an advanced protocol to satisfy the specified requirements and verify the superiority of our protocol over the existing protocols through the detailed analysis.
Design of a Real-Time Certificate Status Validation Mechanism Using Identity Information Hash Value of Signer
Kim Hyun-Chul ; Kim Jung-Jae ; Lee Jong-Hee ; Oh Hae-Seok ; Jun Moon-Seog ;
The KIPS Transactions:PartC, volume 13C, issue 2, 2006, Pages 147~154
DOI : 10.3745/KIPSTC.2006.13C.2.147
The certificate status validation mechanism is a critical component of a public key infrastructure based on certificate system. The most generally mechanisms used these days are the use of the certificate revocation list and the real-time certificate status protocol. But the certificate revocation list can not give the real-time certificate status because the certificate is being delivered periodically, and the real-time certificate status protocol method will generate a concentrated load to the server because the protocol in the central server will be accessed whenever a certification is necessary. It will also take a long time to validate the certificate because each trade has to send mass information through the network. This paper will present that real-time validation is guaranteed as the real-time certificate status protocol method and the traffic congestion in the network Is reduced in a way that the certification would be requested using the user information hash value and would be validated using the user information kept in the certification authorities and the service providers. Based on the this study, we suggest a real-time certificate status validation mechanism which can reduce the certificate status validation time using the signed user information hash value. And we confirm speed of certificate status verification faster than existing CRL(Certificate Revocation List) and OCSP(Online Certificate Status Protocol) method by test.
DRM interoperable scheme by connection between heterogeneous DRM systems
Jeong Yeon-Jeong ; Yoon Ki-Song ; Kang Ho-Gab ;
The KIPS Transactions:PartC, volume 13C, issue 2, 2006, Pages 155~160
DOI : 10.3745/KIPSTC.2006.13C.2.155
Currently we have many DRM(Digital Rights Management) products but they do not provide interoperability between them. It causes user`s inconvenience to use a DRM content and places restrictions to digital content distribution. DRM standardization to solve these sorts of problem has been discussed but dominant standardization which can provide DRM interoperability has not been made. In this paper, we propose DRM interoperable scheme by connection between heterogeneous DRM systems (EU) which uses export and import functions. Proposed EXIM can make a DRM content exchangeable between heterogeneous DRM systems with an open type of technology specification although they don`t have to open their DRM structure.
Proposal of optical subscriber access network to eliminate multiple access interference using 2 dimensional optical frequency and time domain CDMA method
Park Sang-Jo ; Kim Bong-Kyu ;
The KIPS Transactions:PartC, volume 13C, issue 2, 2006, Pages 161~166
DOI : 10.3745/KIPSTC.2006.13C.2.161
In this paper, we propose optical subscriber access network to eliminate multiple access interference using 2 dimensional(D) optical frequency and time domain CDMA method. We have numerically analyzed the characteristics of proposed system. It is seen that the excess intensity noise is the major limiting factor to the system. Also it is seen that the number of simultaneous subscribers is four times as large as the conventional ID optical system under the same bit error ratio.
Wavelength assignment algorithm to reduce discontinuity of virtual links in dynamic WDM network
You Seung-Yeon ; Kim Sung-Chun ;
The KIPS Transactions:PartC, volume 13C, issue 2, 2006, Pages 167~170
DOI : 10.3745/KIPSTC.2006.13C.2.167
Most wavelength assignment algorithms assume that every node has infinite ADMs and I/O blocking is excluded. Furthermore wavelengths continue to occur intermittently in the network using existing algorithms. This can result in increased link blocking under dynamic traffic circumstances. In audition, it can create time-complexity problems such as O(W
) in the worst case scenario. In this paper, we propose a new wavelength assignment algorithm which has time-complexity of O(W
) and considers both I/O and link blocking. The basic idea is to maximize the number of links where wavelengths will be assigned continuously after present assignment. As a result, the number of intermittent wavelengths is minimized, and blocking probabilities are decreased.
Adaptive Online Bandwidth Management Algorithms for Multimedia Cellular Networks
Kim Sung-Wook ;
The KIPS Transactions:PartC, volume 13C, issue 2, 2006, Pages 171~176
DOI : 10.3745/KIPSTC.2006.13C.2.171
Bandwidth is an extremely valuable and scarce resource in a wireless network. Therefore, efficient bandwidth management is necessary in order to provide high qualify service to users with different requirements in a multimedia wireless/mobile network. In this paper, we propose an on-line bandwidth reservation algorithm that adjusts bandwidth reservations adaptively based on existing network conditions. The most important contribution of our work is an adaptive algorithm that is able to resolve conflicting performance criteria - bandwidth utilization, call dropping and call blocking probabilities. Our algorithm is quite flexible, is responsive to current traffic conditions in cellular networks, and tries to strike the appropriate performance balance between contradictory requirements for QoS sensitive multimedia services.
A Handover Technique in a Dual-mode Base Station
Jeong Tae-Eui ; Shin Yeon-Seung ; Ju Sang-Don ; Song Byung-Kwon ;
The KIPS Transactions:PartC, volume 13C, issue 2, 2006, Pages 177~184
DOI : 10.3745/KIPSTC.2006.13C.2.177
A handover is a technology that enables data transmission and receipt seamlessly while a mobile station moves from the current base station to another base station. The handover is basically classified into two types; a horizontal handover which changes a radio link only without changing a network link, and a vertical handover which changes both in heterogeneous networks. In this paper, we propose a vertical handover protocol in a dual base station which supports both of W-CDMA and WiBro networks based on SDR (Software Defined Radio), verify the rightness using a state transition diagram and a Petri-net, and evaluate the performance of the proposed protocol using NS-2 simulator.
Power-and-Bandwidth Efficient Cooperative Transmission Protocol in Wireless Sensor Networks
Khuong Ho Van ; Kong Hyung-Yun ; Choi Jeong-Ho ; Jeong Hwi-Jae ;
The KIPS Transactions:PartC, volume 13C, issue 2, 2006, Pages 185~194
DOI : 10.3745/KIPSTC.2006.13C.2.185
In this paper, we first propose a power-and-bandwidth efficient cooperative transmission protocol where a sensor node assists two others for their data transmission to a clusterhead in WSNs (Wireless Sensor Networks) using LEACH (Low-Energy Adaptive Clustering Hierarchy). Then we derive its closed-form BER expression which Is also a general BER one for the decode-and-forward protocol (DF) and Prove that the proposed protocol performs as same as the conventional DF but obtains higher spectral efficiency. A variety of numerical results reveal the cooperation can save the network power up to 11dB over direct transmission at BER of
Sensor network key establishment mechanism depending on depending information
Doh In-Shil ; Chae Ki-Joon ; Kim Ho-Won ;
The KIPS Transactions:PartC, volume 13C, issue 2, 2006, Pages 195~202
DOI : 10.3745/KIPSTC.2006.13C.2.195
For applying sensor networking technology for our daily life, security service is essential, and pairwise key establishment is the key point for security. In this paper, we propose fairwise key establishment mechanism for secure coumunication in sensor networks. In the mechanism, we cluster the network field before deployment and predistribute key materials to normal sensor nodes and clusterheads. For clusterheads, more key materials are predistributed, and after deployment, sensor nodes which need to establish pairwise keys with other sensor nodes in different clusters make request for related key materials to their own clusterheads. Our proposal reduces the memory requirements for normal sensor nodes by distributing more information to clusterheads, and it raises the security level and resilience against node captures. In addition, it guarantees perfect pairwise key establishments for every pair of neighboring nodes and provides efficient and secure sensor communications.
Performance Comparison of Timestamp based Fair Packet Schedulers inServer Resource Utilization
Kim Tae-Joon ; Ahn Hyo-Beom ;
The KIPS Transactions:PartC, volume 13C, issue 2, 2006, Pages 203~210
DOI : 10.3745/KIPSTC.2006.13C.2.203
Fair packet scheduling algorithms supporting quality-of-services of real-time multimedia applications can be classified into the following two design schemes in terms of the reference time used in calculating the timestamp of arriving packet: Finish-time Design (FD) and Start-time Design (SD) schemes. Since the former can adjust the latency of a flow with raising the flow`s reserved rate, it has been applied to a router for the guaranteed service of the IETF (Internet Engineering Task Force) IntServ model. However, the FD scheme may incur severe bandwidth loss for traffic flows requiring low-rate but strong delay bound such as internet phone. In order to verify the usefulness of the SD scheme based router for the IETF guaranteed service, this paper analyzes and compares two design schemes in terms of bandwidth and payload utilizations. It is analytically proved that the SD scheme is better bandwidth utilization than the FD one, and the simulation result shows that the SD scheme gives better payload utilization by up to 20%.
An Efficient Movement Management Method of Mobile Node in Mobile IPv6
Shin Chung-Soo ; Mun Young-Song ;
The KIPS Transactions:PartC, volume 13C, issue 2, 2006, Pages 211~218
DOI : 10.3745/KIPSTC.2006.13C.2.211
The Mobile IPv6 provides the enhanced internet services to user by supporting a node`s mobility. In Mobile IPv6(MIPv6), the mobile node sends the binding message which binds home address(HoA) with care-of address(CoA) to the home agent whenever it changes its point of attachment to the internet. To reduce the mobility management signal message the Paging Hierarchical Mobile IPv6(PHMIPv6) is proposed. The mobile node does not send the binding message within the domain if the mobile node`s state is idle. Therefore the mobility signal message cost can be reduced. However, when the mobile node`s session arrival rate is high the many mobility management signal cost are needed because the paging cost is very high. In this paper, we analysis the drawback of PHMIPv6 and propose the scheme which can reduce the mobility management signal cost. The proposed scheme works independent of the number of subnet in the domain. Therefore the proposed scheme can improve the mobile node`s mobility management scheme.
Residual Battery Capacity and Signal Strength Based Power-aware Routing Protocol in MANET
Park Gun-Woo ; Choi Jong-Oh ; Kim Hyoung-Jin ; Song Joo-Seok ;
The KIPS Transactions:PartC, volume 13C, issue 2, 2006, Pages 219~226
DOI : 10.3745/KIPSTC.2006.13C.2.219
The shortest path is only maintained during short time because network topology changes very frequently and each mobile nodes communicate each other by depending on battery in MANET(Mobile Ad-hoc Network). So many researches that are to overcome a limitation or consider a power have executed actively by many researcher. But these protocols are considered only one side of link stability or power consumption so we can make high of stability but power consumption isn`t efficient. And also we can reduce power consumption of network but the protocol can`t make power consumption of balancing. For that reason we suggest RBSSPR(Residual Battery Capacity and Signal Strength Based Power-aware Routing Protocol in MANET). The RBSSPR considers residual capacity of battery and signal strength so it keeps not only a load balancing but also minimizing of power consumption. The RBSSPR is based on AODV(Ad-hoc On-demand Distance Vector Routing). We use ns-2 for simulation. This simulation result shows that RBSSPR can extense lifetime of network through distribution of traffic that is centralized into special node and reducing of power consumption.
A Window based Resource Reservation Scheme to Improve Bandwidth Utilization in Mobile Networks
Park Si-Yong ; Park Sung-Ho ; Chung Ki-Dong ;
The KIPS Transactions:PartC, volume 13C, issue 2, 2006, Pages 227~234
DOI : 10.3745/KIPSTC.2006.13C.2.227
In this paper, we propose a window based resource reservation scheme to minimize an waste bandwidth due to resource reservation in mobile networks. Specially, this scheme decides a proper timing to reserve resource by using the number of movement, which is provided by the differentiated handoff estimation model, among inner regions. In the previous resource reservation scheme, it requests a resource reservation to neighboring cells as soon as a mobile host enters or creates into a cell. But, after a proper time based on the number of movements in the differentiated handoff estimation model passes, the proposed scheme requests a resource reservation to neighboring cells. Because of this reason, it can improve resource utilization on mobile networks. And, this scheme differentiates resource reservation according to a request ratio for resource reservation to each neighboring cell. Also, this scheme improves resource reservation acceptance rate and bandwidth utilization.
Experimentation and Analysis of SCTP Throughput by MuIti-homing
Koh Seok-Joo ; Ha Jong-Shik ;
The KIPS Transactions:PartC, volume 13C, issue 2, 2006, Pages 235~240
DOI : 10.3745/KIPSTC.2006.13C.2.235
Stream Control Transmission Protocol (SCTP) provides the multi-homing feature, which allows each SCTP endpoint to use two or more IP addresses for data transmission. In this paper, the SCTP multi-homing feature is experimented and analyzed in terms of throughput over Linux platforms based on the NISTNET network emulator. We perform the experimental analysis of SCTP throughputs by SCTP multi-homing for the various network conditions: different packet loss rates, network bandwidths, and transmission delays. From the experimental results, it is shown that the SCTP multi-homing gives much better throughout gun over the SCTP single-homing case in the networks with a high packet loss rate. In the meantime, the other factors including network bandwidth and transmission delay do not seem to give a significant impact on the performance of the SCTP multi-homing.
Adaptive Error Control Scheme for Supporting Multimedia Services on Mobile Computing Environment
Jeon Yong-Hun ; Kim Sung-Jo ;
The KIPS Transactions:PartC, volume 13C, issue 2, 2006, Pages 241~248
DOI : 10.3745/KIPSTC.2006.13C.2.241
Mobile computing has such characteristics as portability, wireless network, mobility, etc. These characteristics cause various problems to mobile terminals like frequent disconnection, high error rate, and varying network status. These problems motivate us to develop an adaptive error control mechanism for supporting multimedia service in mobile computing environment. In this paper, we propose the Adaptive Error Control(AEC) scheme using client`s buffer size and current error rate. After categorizing the status into four groups according to client`s buffer size and current error rate, this scheme applies an appropriate error control scheme to each status. In this scheme, thresholds of buffer size and error rate are determined by the data transmission time, play rate and average VOP size, and by the probability of error for a sequence of packets. The performance of proposed scheme is evaluated by flaying MPEG-4 files on an experimental client/server environment, respectively. The results show that error correcting rate is similar to other schemes while the time for correcting error reduce a little. In addition, the size of data for correcting error is decreased by 23% compared with FEC and Hybrid FEC, respectively. Theses results demonstrate that the proposed scheme is more suitable in mobile computing environment with small bandwidth and varying environment than existing schemes.
Supporting Effective Open Workspaces Based on WebDAV
Park Hee-Jong ; Kim Dong-Ho ; Ahn Geon-Tae ; Lee Myung-Joon ;
The KIPS Transactions:PartC, volume 13C, issue 2, 2006, Pages 249~258
DOI : 10.3745/KIPSTC.2006.13C.2.249
WebDAV is an IETF standard protocol, which is an extended version of HTTP 1.1, supporting asynchronous collaborative authoring of various contents on the web. Recently, to precisely control access to the resources on a WebDAY server, the WebDAV Access Control Protocol was published. This protocol helps developers to implement advanced server functionalities in a convenient way by providing various control methods to the resources on the WebDAV server. Based on the WebDAV access control protocol, we developed Open Workspaces, which systematically support exchanging and sharing data for general visitors. An Open Workspace can be supplied as a Download-Only Open Workspace, an Upload-Only Open Workspace, or an Upload-Download Open Workspace. Any registered user can create these workspaces without bothering the system administrator. To support the Open Workspaces, we extended the Slide WebDAV server and the DAVExplorer WebDAV client, which are being used popularly.
Implementation and Experimental Results of Neural Network and Genetic Algorithm based Spam Filtering Technique
Kim Bum-Bae ; Choi Hyoung-Kee ;
The KIPS Transactions:PartC, volume 13C, issue 2, 2006, Pages 259~266
DOI : 10.3745/KIPSTC.2006.13C.2.259
As the volume of spam has increased to extreme levels, many anti-spam filtering techniques have been proposed. Among these techniques, the machine-Loaming filtering technique is one of the most popular filtering techniques. In this paper, we propose a machine-learning spam filtering technique based on the neural network, the genetic algorithm and the
-statistic. This proposed filtering technique is designed to overcome the problems in existing filtering techniques, and to achieve high spam filtering accuracy. It is able to classify spam and legitimate emil with 95.25 percent and 95.31 percent accuracy. This accuracy of the sum filtering is 7.75 percent and the 12.44 percent higher than rule-based filtering and the Bayesian filtering technique, respectively.