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 14C, Issue 7 - Dec 2007
Volume 14C, Issue 6 - Oct 2007
Volume 14C, Issue 5 - Aug 2007
Volume 14C, Issue 4 - Aug 2007
Volume 14C, Issue 3 - Jun 2007
Volume 14C, Issue 2 - Apr 2007
Volume 14C, Issue 1 - Feb 2007
Selecting the target year
Study on the way of Institutionalized Budget for Information Security
Kim, So-Jeong ; Choi, Seok-Jin ; Lee, Cheol-Won ;
The KIPS Transactions:PartC, volume 14C, issue 2, 2007, Pages 115~122
DOI : 10.3745/KIPSTC.2007.14-C.2.115
US is strengthening the information security by managing federal agency`s information and information system systematically. For this purpose. US government put the Federal Information Security Management Act into the E Government Act of 2002. According to the FISMA, it is required to have information securitv management plan for all federal agencies. In addition that, OMB Circular A II requires all federal agencies to identity the ratio of information security investment. That is the basis of strengthening the information security of federal agency, This paper will compare the budget status and information security mechanism of Korea and US.
A Study On Forward Secure Mediated RSA Digital Signature
Kim, Dae-Youb ; Ju, Hak-Soo ;
The KIPS Transactions:PartC, volume 14C, issue 2, 2007, Pages 123~128
DOI : 10.3745/KIPSTC.2007.14-C.2.123
Many service systems use Public Key Infrastructure (PKI) to protect the service. But there arc problems with the use of PKI. One of the problems is that some services would require a function instantaneously to check public kel certificate, but PKI does not satisfy such request. To solve the problem, Bouch et al. first proposed the concept of mediated RSA (mRSA). Then Gene Tsudik proposed `weak` forward secure mRSA. In this paper, we analyze the weakness of these schemes and find the source of the vulnerabilitv. And we propose a new mRSA that is strong forward secure.
A Study on Ticket-Based AAA Mechanism Including Time Synchronization OTP in Global Roaming Environment
Moon, Jong-Sik ; Lee, Im-Yeong ;
The KIPS Transactions:PartC, volume 14C, issue 2, 2007, Pages 129~138
DOI : 10.3745/KIPSTC.2007.14-C.2.129
AAA(Aluthentieation, Authorization, Accounting) protocol is an information securitv technology that offer secure and reliable user Authentication, Authorization, Accounting function systematically in various services. protocol and wireless network work as well as win network. Currently IETF(Internet Engineering Task Force) AAA Working Group deal with about AAA protocol and studying with activity, But, recently it exposing much problems side to user`s anonymity and privacv violation. Therefore, in this paper, AAAH(Home Authentication Server) authenticaters Mobile device, after that, use ticket that is issued from AAAH even if move to outside network and can be serviced offering authentication in outside network without approaching by AAAH, Also, we study mechanism that can offer user`s privacy and anonymousness to when use service. Our mechanism is using Time Synchronization OTP and focusing authentication and authorization. Therefore, our mechanism is secure from third party attack and offer secure and effective authentication scheme. Also only right user can offer services by using ticket. can reduce signal and reduce delay of message exchanged, can offer persistent service and beighten security and efficiency.
Communication Protocol for Mobile Sensor Networks with Continuous Mobility
Kim, Hyoung-Jin ; Kim, Lae-Young ; Song, Joo-Seok ;
The KIPS Transactions:PartC, volume 14C, issue 2, 2007, Pages 139~146
DOI : 10.3745/KIPSTC.2007.14-C.2.139
Mobile Sensor Network(MSN) is actively studied due to the advent of mobile sensors such as Robomote and Robotic Sensor Agents(RSAs), However, existing studies on MSN have mainly focused on coverage hole problem which occurs in Stationary Sensor Network(SSN). To address coverage hole problem, these studies make mobile sensors move temporarily so that they do not make the best use of the mobility of mobile sensors, Thus, a mechanism utilizing the continuous movement of mobile sensors is proposed to improve the network coverage performance. However, this mechanism is presently immature and does not explain how to make routing path and send data from mobile sensors to a sink node, Therefore, to efficiently make routing path and send data from mobile sensors to a sink node, we propose a communication protocol for mobile sensor network where mobile sensors continuously move. The proposed protocol deploys not only mobile sensors but also stationary sensors which send sensing data to a sink node instead of mobile sensors. Simulation results show that the proposed protocol improves the performance in terms of network coverage and traffic overhead, compared to conventional SSN protocols.
Analysis on Scalability of Proactive Routing Protocols in Mobile Ad Hoc Networks
Yun, Seok-Yeol ; Oh, Hoon ;
The KIPS Transactions:PartC, volume 14C, issue 2, 2007, Pages 147~154
DOI : 10.3745/KIPSTC.2007.14-C.2.147
Network topology in ad hoc networks keeps changing because of node mobility and no limitation in number of nodes. Therefore, the scalability of routing protocol is of great importance, However, table driven protocols such as DSDV have been known to be suitable for relatively small number of nodes and low node mobility, Various protocols like FSR, OLSR, and PCDV have been proposed to resolve scalability problem but vet remain to be proven for their comparative superiority for scalability, In this paper, we compare and amine them by employing various network deployment scenarios as follows: network dimension increase`s while keeping node density constant node density increases while keeping network dimension fixed, and the number of sessions increase with the network dimension and the number of nodes fixed. the DSDV protocol showed a low scalability despite that it imposes a low overhead because its convergence speed against topology change is slow, The FSR`s performance decreased according to the increase of overhead corresponding to increasing number of nodes, The OLSR with the shortest convergence time among them shows a good scalability, but turned out to be less scalable than the PCDV that uses a clustering because of its relatively high overhead.
Bandwidth Utilization in Latency-Optimized Fair Queuing Algorithm
Kim, Tae-Joon ;
The KIPS Transactions:PartC, volume 14C, issue 2, 2007, Pages 155~162
DOI : 10.3745/KIPSTC.2007.14-C.2.155
WFQ (Weighted Fair Queuing) is the most popular fair queuing algorithm, but it had the inherent drawback of a poor bandwidth utilization, particularly under the traffic requiring a low rate but tight delay bound such as internet phone, It was recently identified that the poor utilization is mainly due to non optimized latency of a flow and then LOFQ(Latency-Optimized Fair Queuing) to overcome the drawback was introduced, LOFQ was also improved through introducing an occupied resource optimization function and the implementation complexity of recursive resource transformation was reduced with revising the transformation scheme. However, the performance of LOFQ has been evaluated by means of simulation, so that there are some difficulties in evaluating the performance in the terms of the accuracy and evaluation time, In this paper, we develop how to analytically compute the bandwidth utilization in LOFQ.
An Transport Layer Vertical Handover Approach for Video Services in Overlay Network Environments
Chang, Moon-Jeong ; Lee, Mee-Jeong ;
The KIPS Transactions:PartC, volume 14C, issue 2, 2007, Pages 163~170
DOI : 10.3745/KIPSTC.2007.14-C.2.163
The next generation communication environment consists of various wireless access networks with distinct features that are configured as an overlay topology. In the network environments, the frequency of hand overs should be minimized and the error propagation should be solved in order to provide high-quality multimedia services to mobile users. Therefore, we propose an performance enhancement approach, based on mSCTP, that provides high quality multimedia services to mobile users by ameliorating the error propagation problem. We utilizes the following four functions: 1) the separation of transmission paths according to the types of frames. 2) retransmission strategy to minimize the loss rate of frames, 3) Foced vertical handover execution by utilizing bicasting, 4) using the stability period in order to reduce the effect of the ping pong phenomenon. The simulation results show that the proposed approach provides seamless multimedia service to mobile users by achieving error resilience.
A Study on Logical Cooperative Entity-Based Multicast Architecture Supporting Heterogeneous Group Mobility in Mobile Ad Hoc Networks
Kim, Kap-Dong ; Kim, Sang-Ha ;
The KIPS Transactions:PartC, volume 14C, issue 2, 2007, Pages 171~178
DOI : 10.3745/KIPSTC.2007.14-C.2.171
In mobile ad hoc networks, an application scenario requires mostly group mobility behavior in the mix of group moving nodes and individually moving nodes. The nodes of those applications tend to belong to the movement group with similar movement behavior. Group mobility is one of the good methods to improve scalability, and reduces the protocol overhead. In this paper, we propose the multicast architecture which regards nodes that have equal group mobility in the heterogeneous group mobility network as the single entity with the multiple interfaces and composes multicast tree, The logical cooperative entity-based multicast architecture accommodates the scalability, the multicast tree simplification, and the protocol overhead reduction which arc obtained from the hierarchical multicast architecture, while it maintains the nat multicast architecture for the data transmission. It also prevents the concentration of the energy consumption dispersing data forwarding load into the several ingress/egress nodes. Results obtained through simulations show that logical cooperative entity based multicast protocol with multiple interfaces offers the protocol scalability and the efficient data transmission.
Optimal and Approximate Solutions of Object Functions for Base Station Location Problem
Sohn, Surg-Won ;
The KIPS Transactions:PartC, volume 14C, issue 2, 2007, Pages 179~184
DOI : 10.3745/KIPSTC.2007.14-C.2.179
The problem of selecting base station location in the design of mobile communication system has been basically regarded as a problem of assigning maximum users in the cell to the minimum base stations while maintaining minimum SIR. and it is NP hard. The objective function of warehouse location problem, which has been used by many researchers, is not proper function in the base station location problem in CDMA mobile communication, The optimal and approximate solutions have been presented by using proposed object function and algorithms of exact solution, and the simulation results have been assessed and analyzed. The optimal and approximate solutions are found by using mixed integer programming instead of meta-heuristic search methods.
An Energy Efficient Cluster Formation Algorithm for Wireless Sensor Networks
Han, Uk-Pyo ; Lee, Hee-Choon ; Chung, Young-Jun ;
The KIPS Transactions:PartC, volume 14C, issue 2, 2007, Pages 185~190
DOI : 10.3745/KIPSTC.2007.14-C.2.185
The efficient node energy utilization is one of important performance factors in wireless sensor networks because sensor nodes operate with limited battery power. To extend the lifetime of the wireless sensor networks, maintaining balanced power consumption between sensor nodes is more important than reducing each energy consumption of the sensor node in the network. In this paper, we proposed a cluster formation algorithm to extend the lifetime of the networks and to maintain a balanced energy consumption of nodes. To obtain it, we add a tiny slot in a round frame, which enables to exchange the residual energy messages between the base station (BS). cluster heads, and nodes. The performance of the proposed protocol has been examined and evaluated with the NS 2 simulator. As a result of simulation, we have confirmed that our proposed algorithm show the better performance in terms of lifetime than LEACH. Consequently, our proposed protocol can effectively extend the network lifetime without other critical overhead and performance degradation.
An AODV-Based Two Hops Dynamic Route Maintenance in MANET
Moon, Dae-Keun ; Kim, Hag-Bae ;
The KIPS Transactions:PartC, volume 14C, issue 2, 2007, Pages 191~198
DOI : 10.3745/KIPSTC.2007.14-C.2.191
A mobile ad-hoc network (MANET) is an autonomous, infrastructure-less system that consists of mobile nodes. In MANET, on demand routing protocols are usually used because network topology changes frequently. AODV, which is a representative on demand routing protocol, operates using the routing table of each node that includes next hop of a route for forwarding packets. It maintains the established route if there is not an expiration of route or any link break. In the paper, we propose a partially adaptive route maintenance scheme (AODV-PA) based on AODV, which provides dynamic route modification of initial route for selecting the effective route using not only next hop but also next-hop of next-hop (i.e. 2-hop next node) acquired through route discovery process. In addition, the proposed scheme additionally manages the routing table for preventing exceptional link breaks by route modification using HELLO messages. We use NS 2 for the computer simulation and validate that the proposed scheme is better than general AODV in terms of packet delivery ratio, latency, routing overhead.