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 17C, Issue 6 - Dec 2010
Volume 17C, Issue 5 - Oct 2010
Volume 17C, Issue 4 - Aug 2010
Volume 17C, Issue 3 - Jun 2010
Volume 17C, Issue 2 - Apr 2010
Volume 17C, Issue 1 - Feb 2010
Selecting the target year
A Study of Protection Profile and Analysis of Related Standard for Internet Banking Systems
Jo, Hea-Suk ; Kim, Seung-Joo ; Won, Dong-Ho ;
The KIPS Transactions:PartC, volume 17C, issue 3, 2010, Pages 223~232
DOI : 10.3745/KIPSTC.2010.17C.3.223
Due to the advance of Internet, offline services are expanded into online services and a financial transaction company provides online services using internet baning systems. However, security problems of the internet banking systems are caused by a lack of security for developing the internet banking systems. Although the financial transaction company has applied existing internal and external standards, ISO 20022, ISO/IEC 27001, ISO/IEC 9789, ISO/IEC 9796, Common Criteria, etc., there are still vulnerabilities. Because the standards lack in a consideration of security requirements of the internet banking system. This paper is intended to explain existing standards and discusses a reason that the standards have not full assurance of security when the internet baning system is applied by single standard. Moreover we make an analysis of a security functions for the internet baning systems and then selects the security requirements. In this paper, we suggest a new protection profile of the internet baning systems using Common Criteria V.3.1 from the analysis mentioned above.
Efficient Masking Method to Protect SEED Against Power Analysis Attack
Cho, Young-In ; Kim, Hee-Seok ; Choi, Doo-Ho ; Han, Dong-Guk ; Hong, Seok-Hie ; Yi, Ok-Yeon ;
The KIPS Transactions:PartC, volume 17C, issue 3, 2010, Pages 233~242
DOI : 10.3745/KIPSTC.2010.17C.3.233
In the recent years, power attacks were widely investigated, and so various countermeasures have been proposed. In the case of block ciphers, masking methods that blind the intermediate results in the algorithm computations(encryption, decryption) are well-known. In case of SEED block cipher, it uses 32 bit arithmetic addition and S-box operations as non-linear operations. Therefore the masking type conversion operations, which require some operating time and memory, are required to satisfy the masking method of all non-linear operations. In this paper, we propose a new masked S-boxes that can minimize the number of the masking type conversion operation. Moreover we construct just one masked S-box table and propose a new formula that can compute the other masked S-box`s output by using this S-box table. Therefore the memory requirements for masked S-boxes are reduced to half of the existing masking method`s one.
A Handover Mechanism Between Local Mobility Anchors in Proxy Mobile IPv6-based Vehicular Communication Networks
Lim, Yu-Jin ; Ahn, Sang-Hyun ; Cho, Kwon-Hee ;
The KIPS Transactions:PartC, volume 17C, issue 3, 2010, Pages 243~250
DOI : 10.3745/KIPSTC.2010.17C.3.243
Vehicular communication networking is one of the most important building blocks of Intelligent Transportation System (ITS). The vehicular communication network is a wireless communication system enabling vehicles to communicate with each other as well as with roadside base stations. Mobility management of vehicles which move at high speeds and occasionally make a long journey is an interesting research area of vehicular communication networks. Recently, The Proxy Mobile IPv6 (PMIPv6) protocol is proposed for network-based mobility management to reduce the overhead of mobile nodes. PMIPv6 shifts the burden of the mobility management from mobile nodes to network agents to decrease the overhead and latency for the mobility management. In this paper, we derive the scenario of deploying PMIPv6 in vehicular communication networks and propose a new LMA handover mechanism for realizing the scenario. By carrying out the ns-2 based simulations, we verify the operability of the proposed mechanism.
Accurate Localization Scheme using Lateration in Indoor Environments
Lim, Yu-Jin ; Park, Jae-Sung ;
The KIPS Transactions:PartC, volume 17C, issue 3, 2010, Pages 251~258
DOI : 10.3745/KIPSTC.2010.17C.3.251
In an indoor localization method taking the lateration-based approach, the location of a target is estimated with the location of anchor points (APs) and the approximated distances between the target and APs using received signal strength (RSS) measurements. The accuracy of distance estimation affects the localization accuracy of a lateration-based method. Since a radio propagation environment varies randomly in time and space, the highest RSSs do not necessarily give the best estimation of the distances between a target and APs. Thus, all APs hearing a target have been used for localization. However, the accuracy of a lateration-based method degrades if more APs beyond a certain threshold are used because the area of polygon with the APs increases. In this paper, we focus on reducing the size of the polygon to further increase the localization accuracy. We use the centroid of the polygon as a reference point to estimate the relative location of a target in the polygon. Once the relative location is estimated, only the APs which are closest to the target are used for localization to reduce the area of the polygon with the APs. We validate the proposed method by implementing an indoor localization system and evaluating the accuracy of the proposed method in the various experimental environments.
A Location Information-based Gradient Routing Algorithm for Wireless Ad Hoc Networks
Bang, Min-Young ; Lee, Bong-Hwan ;
The KIPS Transactions:PartC, volume 17C, issue 3, 2010, Pages 259~270
DOI : 10.3745/KIPSTC.2010.17C.3.259
In this paper, a Location Information-based Gradient Routing (LIGR) algorithm is proposed for setting up routing path based on physical location information of sensor nodes in wireless ad-hoc networks. LIGR algorithm reduces the unnecessary data transmission time, route search time, and propagation delay time of packet by determining the transmission direction and search range through the gradient from the source node to sink node using the physical location information. In addition, the low battery nodes are supposed to have the second or third priority in case of forwarding node selection, which reduces the possibility of selecting the low battery nodes. As a result, the low battery node functions as host node rather than router in the wireless sensor networks. The LIGR protocol performed better than the Logical Grid Routing (LGR) protocol in the average receiving rate, delay time, the average residual energy, and the network processing ratio.
A study of Vertical Handover between LTE and Wireless LAN Systems using Adaptive Fuzzy Logic Control and Policy based Multiple Criteria Decision Making Method
Lee, In-Hwan ; Kim, Tae-Sub ; Cho, Sung-Ho ;
The KIPS Transactions:PartC, volume 17C, issue 3, 2010, Pages 271~280
DOI : 10.3745/KIPSTC.2010.17C.3.271
For the next generation mobile communication system, diverse wireless network techniques such as beyond 3G LTE, WiMAX/WiBro, and next generation WLAN etc. are proceeding to the form integrated into the All-IP core network. According to this development, Beyond 3G integrated into heterogeneous wireless access technologies must support the vertical handover and network to be used of several radio networks. However, unified management of each network is demanded since it is individually serviced. Therefore, in order to solve this problem this study is introducing the theory of Common Radio Resource Management (CRRM) based on Generic Link Layer (GLL). This study designs the structure and functions to support the vertical handover and propose the vertical handover algorithm of which policy-based and MCDM are composed between LTE and WLAN systems using GLL. Finally, simulation results are presented to show the improved performance over the data throughput, handover success rate, the system service cost and handover attempt number.
Self-Adaptive Location Checking Mechanism in Mobile Ad-hoc Networks
Youn, Joo-Sang ; Kim, Young-Hyun ; Pack, Sang-Heon ;
The KIPS Transactions:PartC, volume 17C, issue 3, 2010, Pages 281~290
DOI : 10.3745/KIPSTC.2010.17C.3.281
In geographic forwarding algorithms, traditional route maintenance requires mobile nodes periodically exchange beacon messages with their neighbors. In beacon message based forwarding scheme, a longer interval reduces the number of beacons needed, but may result in significant location errors. Conversely, a shorter interval guarantees more accurate location information, but induces control overheads.Therefore, the fixed or dynamic interval scheme based forwarding schemes cannot adapt well to different mobility environments. Also, existing schemes result in the uncertainty of neighbor node`s position in the forwarding table of mobile node. Therefore, this paper presents a self-adaptive location checking mechanism based proactive geo-routing algorithm for beacon-based geographic routing. Simulation results show that the proposed routing algorithm not only significantly increases the relay transmission rate but also guarantees the high end-to-end packet delivery in low and high mobility environments.
A Token Based Clustering Algorithm Considering Uniform Density Cluster in Wireless Sensor Networks
Lee, Hyun-Seok ; Heo, Jeong-Seok ;
The KIPS Transactions:PartC, volume 17C, issue 3, 2010, Pages 291~298
DOI : 10.3745/KIPSTC.2010.17C.3.291
In wireless sensor networks, energy is the most important consideration because the lifetime of the sensor node is limited by battery. The clustering is the one of methods used to manage network energy consumption efficiently and LEACH(Low-Energy Adaptive Clustering Hierarchy) is one of the most famous clustering algorithms. LEACH utilizes randomized rotation of cluster-head to evenly distribute the energy load among the sensor nodes in the network. The random selection method of cluster-head does not guarantee the number of cluster-heads produced in each round to be equal to expected optimal value. And, the cluster head in a high-density cluster has an overload condition. In this paper, we proposed both a token based cluster-head selection algorithm for guarantee the number of cluster-heads and a cluster selection algorithm for uniform-density cluster. Through simulation, it is shown that the proposed algorithm improve the network lifetime about 9.3% better than LEACH.
Analysis of Correlation between Sleep Interval Length and Jitter Buffer Size for QoS of IPTV and VoIP Audio Service over Mobile WiMax
Kim, Hyung-Suk ; Kim, Tae-Hyoun ; Hwang, Ho-Young ;
The KIPS Transactions:PartC, volume 17C, issue 3, 2010, Pages 299~306
DOI : 10.3745/KIPSTC.2010.17C.3.299
IPTV and VoIP services are considered as killer applications over Mobile WiMAX network, which provideshigh mobility and data rate. Among those which affect the quality of voice in those services, the jitter buffer or playout buffer can compensate the poor voice quality caused by the packet drop due to frequent route change or differences among routes between service endpoints. In this paper, we analyze the correlation between the sleep interval length and jitter buffer size in order to guarantee a predefined level of voice quality. For this purpose, we present an end-to-end delay model considering additional delay incurred by the WiMAX PSC-II sleep mode and a VoIP service quality requirement based on the delay constraints. Through extensive simulation experiments, we also show that the increase of jitter buffer size may degrade the voice quality since it can introduce additional packet drop in the jitter buffer under WiMAX power saving mode.