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 15C, Issue 6 - Dec 2008
Volume 15C, Issue 5 - Oct 2008
Volume 15C, Issue 4 - Aug 2008
Volume 15C, Issue 3 - Jun 2008
Volume 15C, Issue 2 - Apr 2008
Volume 15C, Issue 1 - Feb 2008
Selecting the target year
CAS-based Security System for IPTV
Kim, Dae-Youb ; Ju, Hak-Soo ;
The KIPS Transactions:PartC, volume 15C, issue 4, 2008, Pages 221~226
DOI : 10.3745/KIPSTC.2008.15-C.4.221
IPTV is well known services of TPS (Triple play service). Since TPS supplies the bundle service, service providers can supply low-priced services for their subscribers. To supply high quality contents stably, it is an essential requirement to make payment for the services. According to the type of services, either CAS or DRM is used to protect the pay-contents service. Also IPTV uses or will use these security systems to protect the service. In this paper, we will describe security problems when a IPTV service provider chooses either CAS or DRM, and then propose a new security system to solve the problems.
Cache Reliability Enhancing Method for Recursive DNS
Ju, Yong-Wan ; Lee, Eung-Jae ; Nam, Kwang-Woo ;
The KIPS Transactions:PartC, volume 15C, issue 4, 2008, Pages 227~238
DOI : 10.3745/KIPSTC.2008.15-C.4.227
As the internet users rise up rapidly, DNS information forgery can cause severe socio-economic damages. However, most studies on DNS information security reached the breaking point in applying to actual circumstances because of the limit of existing DNS system version, the increasement of management burden and etc. The paper proposes the real-time method for detecting cache poisoning of DNS system independent of analysing the DNS forgery types in the current DNS service environment. It also proposes the method of enhancing the reliability for the cache information of Recursive DNS system by post-verifying the cache information of the DNS system.
An Intrusion Detection Method by Tracing Root Privileged Processes
Park, Jang-Su ; Ahn, Byoung-Chul ;
The KIPS Transactions:PartC, volume 15C, issue 4, 2008, Pages 239~244
DOI : 10.3745/KIPSTC.2008.15-C.4.239
It is not enough to reduce damages of computer systems by just patching vulnerability codes after incidents occur. It is necessary to detect and block intrusions by boosting the durability of systems even if there are vulnerable codes in systems. This paper proposes a robust real-time intrusion detection method by monitoring root privileged processes instead of system administrators in Linux systems. This method saves IP addresses of users in the process table and monitors IP addresses of every root privileged process. The proposed method is verified to protect vulnerable programs against the buffer overflow by using KON program. A configuration protocol is proposed to manage systems remotely and host IP addresses are protected from intrusions safely through this protocol.
Design and Implementation of an IP-based Fixed VoIP Emergency System
Ko, Sang-Ki ; Chon, Ji-Hun ; Choi, Sun-Wan ; Kang, Shin-Gak ; Huh, Mi-Young ;
The KIPS Transactions:PartC, volume 15C, issue 4, 2008, Pages 245~252
DOI : 10.3745/KIPSTC.2008.15-C.4.245
An emergency service over Voice over IP (VoIP) network is an essential condition, like the existing telecommunication services. To support for the emergency services, standardization works have been performed. The National Emergency Number Association (NENA) has been developing the framework and procedures for an emergency service for Non-IP based network, rather than protocols. In contrast, the Internet Engineering Task Force (IETF) has been only focused on end-to-end IP-based emergency calls. The NENA architecture is incompatible with the IETF protocols. To solve the problem, we design and implement a SIP-based VoIP emergency system by adopting the NENA architecture and by applying IETF protocols, for both IP-based Pubic Safety Answering Point (PSAP) and PSTN-based PSAP. It is implemented and tested under UNIX environment.
A Resource Reservation Method with Available Resource Migration between RSVP-Capable Routers to Improve the Resource Utilization
Kim, Tae-Joon ;
The KIPS Transactions:PartC, volume 15C, issue 4, 2008, Pages 253~262
DOI : 10.3745/KIPSTC.2008.15-C.4.253
Providing Quality-of-Service (QoS) guarantee requires the reservation of resource needed to accommodate the traffic flow of service for which resource reservation protocol (RSVP) was introduced. However, if any RSVP-capable router on the path fails to accommodate the traffic flow due to lack of resource, the flow is not allowed no matter how much surplus resources other routers on the path have. In order to solve this problem, this paper proposes a resource reservation method with available resource migration between RSVP-capable routers in which the routers use the recently developed latency optimized fair queuing scheduler. The results of the simulation applying the proposed method to an evaluation network show that it may yield the gain of up to 165% compared to that in the original one in terms of the number of admitted flows.
A New Counting Scheme for MBS in WiBro
Sung, Nag-Bum ; Kim, Kyung-Tae ; Youn, Hee-Yong ;
The KIPS Transactions:PartC, volume 15C, issue 4, 2008, Pages 263~272
DOI : 10.3745/KIPSTC.2008.15-C.4.263
Recently, WiBro has been developed to efficiently support real-time broadcasting with wireless system. MBS (Multicast Broadcast Service) based on WiBro has numerous applications such as DMB. Since the current MBS uses only common channel managed by scheduling, it cannot effectively support many users at the same time. This paper proposes a new counting scheme with which the channel mode can be properly switched between common channel and dedicated channel. It thus allows efficient use of limited radio resource in WiBro for the MBS.
LECSEN : Link Exchanged Chain in SEnsor Networks
Shin, Ji-Soo ; Suh, Chang-Jin ;
The KIPS Transactions:PartC, volume 15C, issue 4, 2008, Pages 273~280
DOI : 10.3745/KIPSTC.2008.15-C.4.273
In WSN(Wireless Sensor Network) many routing algorithms such as LEACH, PEGASIS and PEDEP consisting of sensor nodes with limited energy have been proposed to extend WSN lifetime. Under the assumption of perfect fusion, these algorithms used convergecast that periodically collects sensed data from all sensor nodes to a base station. But because these schemes studied less energy consumption for a convergecast as well as fairly energy consumption altogether, the minimum energy consumption for a convergecast was not focused enough nor how topology influences to energy consumption. This paper deals with routing topology and energy consumption for a single convergecast in the following ways. We chose major WSN topology as MSC(Minimum Spanning Chain)s, MSTs, PEGASIS chains and proposed LECSEN chains. We solved the MSC length by Linear Programming(LP) and propose the LECSEN chain to compete with MST and MSC. As a result of simulation by Monte Carlo method for calculation of the topology length and standard deviation of link length, we learned that LECSEN is competitive with MST in terms of total energy consumption and shows the best with the view of even energy consumption at the sensor nodes. Thus, we concluded LECSEN is a very useful routing topology in WSN.
Reliable Asynchronous Image Transfer Protocol In Wireless Multimedia Sensor Network
Lee, Joa-Hyoung ; Seon, Ju-Ho ; Jung, In-Bum ;
The KIPS Transactions:PartC, volume 15C, issue 4, 2008, Pages 281~288
DOI : 10.3745/KIPSTC.2008.15-C.4.281
Recently, the advance of multimedia hardware has fostered the development of wireless multimedia sensor network which is able to ubiquitously obtain multimedia content such as image or audio from the environment. The multimedia data which has several characteristics such as large size and correlation between the data requires reliability in transmission. However, the existing solution which take the focus on the efficiency of network mainly, is not appropriate to transmit the multimedia data. In the paper, we proposes a reliable asynchronous image transfer protocol, RAIT. RAIT applies double sliding window method in node-to-node image tansfer to prevent the packet loss caused by network congestion. The double sliding window consists of one sliding window for the receiving queue, which is used for prevention of packet loss caused by communication failure between nodes and the other sliding window for the sending queue which prevents the packet loss caused by network congestion. the routing node prevents the packet loss and guarantees the fairness between the nodes by scheduling the packets based on the image non-preemptively. The RAIT implements the double sliding window method by cross layer design between RAIT layer, routing layer, and queue layer. The experiment shows that RAIT guarantees the reliability of image transmission compared with the existing protocol.
A Cost-Aware Multi-path DSDV Routing Protocol in Wireless Mesh Networks
Lee, Seong-Woong ; Chung, Yun-Won ;
The KIPS Transactions:PartC, volume 15C, issue 4, 2008, Pages 289~296
DOI : 10.3745/KIPSTC.2008.15-C.4.289
In wireless mesh network, studies on routing protocols have been actively carried out recently, and hop count is used as a major routing metric in destination-sequenced distance-vector (DSDV) routing protocol, which is a representative proactive routing protocol. Although hop-by-hop multi-path (HMP) DSDV and enhanced HMP (EHMP) DSDV routing protocols perform routing by considering both hop count and residual bandwidth within one hop distance nodes, it has a shortcoming that routing is carried out via non-optimal path from the aspect of end-to-end routing. In order to overcome the shortcoming, a cost-aware multi-path (CAMP) DSDV routing protocol is proposed in this paper, which considers hop count and end-to-end minimum residual bandwidth. Simulation results based on NS-2 show that the proposed routing protocol performs better than DSDV, HMP DSDV, and EHMP DSDV protocols from the aspect of throughput and packet delivery ratio, by appropriately using hop count and end-to-end minimum residual bandwidth information and has the same number of management messages with HMP DSDV and EHMP DSDV protocols.
Real-Time Remote Display Technique based on Wireless Mobile Environments
Seo, Jung-Hee ; Park, Hung-Bog ;
The KIPS Transactions:PartC, volume 15C, issue 4, 2008, Pages 297~302
DOI : 10.3745/KIPSTC.2008.15-C.4.297
In case of display a lot of information from mobile devices, those systems are being developed that display the information from mobile devices on remote devices such as TV using the mobile devices as remote controllers because it is difficult to display a lot of information on mobile devices due to their limited bandwidth and small screen sizes. A lot of cost is required to design and develop interfaces for these systems corresponding to each of remote display devices. In this paper, a mobile environment based remote display system for displays at real times is proposed for continuous monitoring of status data for unique `Mote IDs`. Also, remote data are collected and monitored through sensor network devices such as ZigbeX by applying status perception based remote displays at real times through processing ubiquitous computing environment data, and remote display applications at real times are implemented through PDA wireless mobiles. The system proposed in this paper consists of a PDA for remote display and control, mote embedded applications programming for data collections and radio frequency, server modules to analyze and process collected data and virtual prototyping for monitoring and controls by virtual machines. The result of the implementations indicates that this system not only provides a good mobility from a human oriented viewpoint and a good usability of accesses to information but also transmits data efficiently.
An Adaptive Routing Protocol with a Balanced Energy Consumption For Wireless Ad-hoc Networks
Kim, Yong-Hyun ; Hong, Youn-Sik ;
The KIPS Transactions:PartC, volume 15C, issue 4, 2008, Pages 303~310
DOI : 10.3745/KIPSTC.2008.15-C.4.303
To increase the lifetime of ad-hoc networks, a ratio of energy consumption for each node should be kept constant by equally distributing network traffic loads into all of the nodes. In this paper, we propose a modified AODV routing protocol to determine a possible route by considering a remaining battery capacity of a node and the degree of its usage. In addition, to reduce the amount of energy consumption during the path rediscovery process due to the huge amount of the AODV control messages the limited number of possible routes are stored into a routing table of a source node. When some links of a route fail, another possible path can be looked up in the table before the route discovery process should be initiated. We have tested our proposed method with a conventional AODV and a MMBCR method which is one of the power-efficient energy routing protocols based on the three performance metrics, i.e., the total remaining battery capacity, network lifetime and the ratio of data packets received by the destination node to compare their performance.
Modified LEACH Protocol improving the Time of Topology Reconfiguration in Container Environment
Lee, Yang-Min ; Yi, Ki-One ; Kwark, Gwang-Hoon ; Lee, Jae-Kee ;
The KIPS Transactions:PartC, volume 15C, issue 4, 2008, Pages 311~320
DOI : 10.3745/KIPSTC.2008.15-C.4.311
In general, routing algorithms that were applied to ad-hoc networks are not suitable for the environment with many nodes over several thousands. To solve this problem, hierarchical management to these nodes and clustering-based protocols for the stable maintenance of topology are used. In this paper, we propose the clustering-based modified LEACH protocol that can applied to an environment which moves around metal containers within communication nodes. In proposed protocol, we implemented a module for detecting the movement of nodes on the clustering-based LEACH protocol and improved the defect of LEACH in an environment with movable nodes. And we showed the possibility of the effective communication by adjusting the configuration method of multi-hop. We also compared the proposed protocol with LEACH in four points of view, which are a gradual network composition time, a reconfiguration time of a topology, a success ratio of communication on an containers environment, and routing overheads. And to conclude, we verified that the proposed protocol is better than original LEACH protocol in the metal containers environment within communication of nodes.
Analysis of Web Response Time on Queue Managements and Transmission Latency in Congested Network
Seok, Woo-Jin ;
The KIPS Transactions:PartC, volume 15C, issue 4, 2008, Pages 321~328
DOI : 10.3745/KIPSTC.2008.15-C.4.321
In this paper, we analyze web response time depending on queue managements and transmission latencies in highly congested network situation. Under FIFO scheme, the response times are for three different sizes of queue are almost the same, but the response time increases as traffic intensity increases. The performance between different queue sizes shows more different in 90% and 98% traffic intensity than in 80% traffic intensity. Especially the difference becomes bigger in short latency case than long latency case. Under RED scheme, three differently tunned RED schemes do not impact on the response time when the size of queue is relatively large. When the queue size becomes smaller, the response time of the differently tunned RED schemes becomes different for short latency case while the response times are almost same for long latency case. When comparing FIFO and RED schemes under same size of queue, RED scheme shows less response time than that of FIFO for the long latency case in high traffic intensity.