Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The Journal of Korean Institute of Communications and Information Sciences
Journal Basic Information
Journal DOI :
The Korean Institute of Communications and Information Sciences
Editor in Chief :
Volume & Issues
Volume 34, Issue 12C - Dec 2009
Volume 34, Issue 12B - Dec 2009
Volume 34, Issue 12A - Dec 2009
Volume 34, Issue 11C - Nov 2009
Volume 34, Issue 11B - Nov 2009
Volume 34, Issue 11A - Nov 2009
Volume 34, Issue 10C - Oct 2009
Volume 34, Issue 10B - Oct 2009
Volume 34, Issue 10A - Oct 2009
Volume 34, Issue 9C - Sep 2009
Volume 34, Issue 9B - Sep 2009
Volume 34, Issue 9A - Sep 2009
Volume 34, Issue 8C - Aug 2009
Volume 34, Issue 8B - Aug 2009
Volume 34, Issue 8A - Aug 2009
Volume 34, Issue 7C - Jul 2009
Volume 34, Issue 7B - Jul 2009
Volume 34, Issue 7A - Jul 2009
Volume 34, Issue 6C - Jun 2009
Volume 34, Issue 6B - Jun 2009
Volume 34, Issue 6A - Jun 2009
Volume 34, Issue 5C - May 2009
Volume 34, Issue 5B - May 2009
Volume 34, Issue 5A - May 2009
Volume 34, Issue 4C - Apr 2009
Volume 34, Issue 4B - Apr 2009
Volume 34, Issue 4A - Apr 2009
Volume 34, Issue 3C - Mar 2009
Volume 34, Issue 3B - Mar 2009
Volume 34, Issue 3A - Mar 2009
Volume 34, Issue 2C - Feb 2009
Volume 34, Issue 2B - Feb 2009
Volume 34, Issue 2A - Feb 2009
Volume 34, Issue 1C - Jan 2009
Volume 34, Issue 1B - Jan 2009
Volume 34, Issue 1A - Jan 2009
Selecting the target year
Sink Location Dissemination Scheme in Geographic Routing for Wireless Sensor Networks
Lee, Eul-Sin ; Park, Soo-Chang ; Lee, Jeong-Cheol ; Kim, Sang-Ha ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 9B, 2009, Pages 847~856
In geographic routing for wireless sensor networks, sources need the location of sinks destined for delivering their data packets. Most of the existing geographic routing protocols merely assume that the sources can get the locations of sinks by some location service. How source nodes find out the location of sinks is not easy. In this paper, we propose a sink location dissemination scheme in geographic routing for wireless sensor networks. In this scheme, a source node and a sink node send sink location announcement and query messages along two paths respectively by geographic routing. The node located on the crossing point of the two paths informs the source about the sink location. Then the source can send data packet to the sink by geographic routing. How to guarantee that these two paths have at least one crossing point in any irregular profile of sensor network is the challenge of this paper Simulation results show that our protocol is significantly superior to other protocols in terms of energy consumption and control overhead.
A Control Platform Scheme for Seamless Service Provisioning During Handover on FMC Networks
Maeng, Doo-Lyel ; Park, Jong-Kae ; Kim, Sung-Joo ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 9B, 2009, Pages 857~866
Recently, IP mobility study of infra's common elements is undergoing processes to achieve FMC based on All-IP. Existing typical mobility technology based on IP is IETF's Mobile IP. However, it faced to limitations due to packet loss, delays when MN is moving on Mobile IP, also existing network infra - routers (FA)-needed to add/change the functions to support Mobile IP. In this paper, existing mobility problems based on IP and the suggested improvements for platforms which support mobility, quality, security are proposed. It discusses the performance on the current existing IP infrastructure derived from simulation analysis on mobility packet loss and delay. From the resulting data, improvements will also be outlined for optimal performance.
Modeling and Analysis of Multi-type Failures in Wireless Body Area Networks with Semi-Markov Model
Wang, Song ; Chun, Seung-Man ; Park, Jong-Tae ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 9B, 2009, Pages 867~875
The reliability of wireless body area networks is an important research issue since it may jeopardize the vital human life, unless managed properly. In this article, a new modeling and analysis of node misbehaviors in wireless body area networks is presented, in the presence of multi-type failures. First, the nodes are classified into types in accordance with routing capability. Then, the node behavior in the presence of failures such as energy exhaustion and/or malicious attacks has been modeled using a novel Semi-Markov process. The proposed model is very useful in analyzing reliability of WBANs in the presence of multi-type failures.
An Adaptive Coverage Control Algorithm for Throughput Improvement in OFDMA-based Relay Systems
Hyun, Myung-Reun ; Hong, Dae-Hyoung ; Lim, Jae-Chan ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 9B, 2009, Pages 876~882
In this paper, we propose a sub-cell coverage control algorithm for enhancement of the cell throughput in OFDMA based relay systems. Relay station (RS) is exploited for improved quality of the received signal in cellular communication systems, especially in shadow areas. However, since a RS requires additional radio resource consumption for the link between the base station (BS) and the RS, we have to carefully control the coverage areas if a mobile station (MS) is serviced via the BS or the RS considering the cell throughput. We consider radio resource reuse as well for the sub-cell coverage configuration by applying various reuse patterns between RSs. We also consider a time varying system by adaptively changing the threshold for coverage depending on the MSs' traffic in the cell. We initially determine the sub-cell coverage of the system depending on the ratio of received signal-interference-noise-ratio (SINR) of the MS from the BS and RSs, respectively. Then, the "sub-cell coverage threshold" varies based on the "effective transmitted bits per sub-channel" with time. Simulation result shows that the proposed "time varying coverage control algorithm" leads to throughput improvement compared to the fixed sub-cell coverage configuration.
Design and Implementation of Linear Protection Switching for Fast Restoration in Carrier-class Ethernet Networks
Ahn, Kye-Hyun ; Kim, Kwang-Joon ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 9B, 2009, Pages 883~891
This paper proposes Ethernet linear protection switching technology in order to provide the SONET/SDH-like resiliency over Metro Ethernet Networks. The proposed design is made of an architecture with a control processor board and several data processing boards, where the control processor board is independent of data processing board, providing a flexible solution for carrier Ethernet system. However, it leads an increasing message delay between inter-processors. In this paper, we implement and confirm a restoration of failed transport connections withing 50 millisecond in spite of increasing message delay between the control processing board and data processing board providing carrier-class network survivability.
Performance Analysis of Reuse-Partitioning-Based Cellular System in Multicell Environment
Kim, Seung-Yeon ; Myung, Kwang-Sik ; Ryu, Seung-Wan ; Cho, Choong-Ho ; Lee, Hyong-Woo ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 9B, 2009, Pages 892~899
Reuse-partitioning is a simple technique that can be used to improve the capacity of a cellular system. In the previous researches, authors do not explain how a channel is selected and what happens when there is no channel available when a call arrives. Therefore, in this paper, we describe a simple channel selection procedure and analyze the performance of a system. The performance is presented in terms of the channel utilization and call blocking probability by varying offered load per cell. Our analytical results may be added in a realistic performance analysis of reuse-partitioning-based system.
Evaluation of MOS for the Access Delay of Internet Service
Lee, Hoon ; Lee, Young-Ok ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 9B, 2009, Pages 900~907
With the introduction of the concept such as QoS, QoE, and MOS for the multimedia services over the high-speed network the user's concern about the degradation in the perceived quality of service for the conventional data service has become a new problem to the Internet service providers. In this work we propose a method to evaluate the subjective QoE such as MOS for the high-speed Internet service, where the round trip time for the data transfer is taken into account as a performance parameter for the experienced delay. We develop a tool to evaluate an MOS that enables us to investigate the behavior of users for diverse delay times for the web access service, via which we analyze the sensitivity of users with regard to MOS as a function of delay.
A SVM-based Spam Filtering System for Short Message Service (SMS)
Joe, In-Whee ; Shim, Hye-Taek ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 9B, 2009, Pages 908~913
Mobile phones became important household appliance that cannot be without in our daily lives. And the short messaging service (SMS) in these mobile phones is 1.5 to 2 times more than the voice service. However, the spam filtering functions installed in mobile phones take a method to receive specific number patterns or words and recognize spam messages when those numbers or words are present. However, this method cannot properly filters various types of spam messages currently dispatched. This paper proposes a more powerful and more adaptive spam filtering system using SVM and thesaurus. The system went through a process of isolating words from sample data through pro-processing device and integrating meanings of isolated words using a thesaurus. Then it generated characteristics of integrated words through the chi-square statistics and studied the characteristics. The proposed system is realized in a Window environment and the performance is confirmed through experiments.
The Study on matrix based high performance pattern matching by independence partial match
Jung, Woo-Sug ; Kwon, Taeck-Geun ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 9B, 2009, Pages 914~922
In this paper, we propose a matrix based real-time pattern matching method, called MDPI, for real-time intrusion detection on several Gbps network traffic. Particularly, in order to minimize a kind of overhead caused by buffering, reordering, and reassembling under the circumstance where the incoming packet sequence is disrupted, MDPI adopts independent partial matching in the case dealing with pattern matching matrix. Consequently, we achieved the performance improvement of the amount of 61% and 50% with respect to TCAM method efficiency through several experiments where the average length of the Snort rule set was maintained as 9 bytes, and w=4 bytes and w=8bytes were assigned, respectively, Moreover, we observed the pattern scan speed of MDPI was 10.941Gbps and the consumption of hardware resource was 5.79LC/Char in the pattern classification of MDPI. This means that MDPI provides the optimal performance compared to hardware complexity. Therefore, by decreasing the hardware cost came from the increased TCAM memory efficiency, MDPI is proven the cost effective high performance intrusion detection technique.
Design of A Generic and Scalable DRM Scheme using HC-256 Stream Cipher
Park, Jun-Cheol ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 9B, 2009, Pages 923~930
Digital Rights Management(DRM) is a term that refers technologies for imposing limitations on the use of digital content for protecting media copyright holders. This paper proposes a generic scheme for digital media copy protection that can be applied to any digital media such as audio, video, etc. The scheme will make it very hard to play a copied content on a foreign platform and to guess secret content encryption keys. Unlike other DRM techniques, the scheme uses the stream cipher HC-256 only for encrypting media content and it allows a client to start content playback immediately following its streamed decryption. As to the encryption, it requires to generate several secret keys for each new client(player copy), rather than for each media content, which makes it scalable in terms of managed keys. Also, for simplicity, the scheme supports the popular unlimited-play-after-download policy only, which would eliminate the necessity for deploying separate server or process for licensing.
Improved Secure Remote User Authentication Protocol
Lee, Ji-Seon ; Park, Ji-Hye ; Chang, Jik-Hyun ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 9B, 2009, Pages 931~938
Recently, Holbl et al. proposed an improvement to Peyravian-Jeffries's password-based authentication protocol to overcome some security flaws. However, Munilla et al. showed that Holbl et al.'s improvement is still vulnerable to off-line password guessing attack. In this paper, we provide a secure password-based authentication protocol which gets rid of the security flaws of Holbl et al.'s protocol.
A Novel Instruction Set for Packet Processing of Network ASIP
Chung, Won-Young ; Lee, Jung-Hee ; Lee, Yong-Surk ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 9B, 2009, Pages 939~946
In this paper, we propose a new network ASIP(Application Specific Instruction-set Processor) which was designed for simulation models by a machine descriptions language LISA(Language for Instruction Set Architecture). This network ASIP is aimed for an exclusive engine undertaking packet processing in a router. To achieve the purpose, we added a new necessary instruction set for processing a general ASIP based on MIPS(Microprocessor without Interlock Pipeline Stages) architecture in high speed. The new instructions can be divided into two groups: a classification instruction group and a modification instruction group, and each group is to be processed by its own functional unit in an execution stage. The functional unit was optimized for area and speed through Verilog HDL, and the result after synthesis was compared with the area and operation delay time. Moreownr, it was allocated to the Macro function ana low-level standardized programming language C using CKF(Compiler Known Function). Consequently, we verified performance improvement achieved by analysis and comparison of execution cycles of application programs.
An Efficient Service Discovery for Mobile Ad Hoc Networks
Kang, Eun-Young ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 9B, 2009, Pages 947~954
In mobile ad hoc networks, service discovery to search for an available service is an important issue. In this paper, we propose an efficient service discovery protocol that is combined a dht-based service discovery scheme and a P2P caching-based information spreading scheme. Proposed scheme store key information in hashed zone and search services using it's information. To search quickly a service, it use its physical neighbors information which collected by 1-hop hello message between a node and its physical neighbors. We do not use a central look up server and do not rely on flooding. Hence, it uniquely balanced all node's load in mobile ad hoc networks and reduced the number of messages exchanged, network load and response time. The simulation results show that our protocol outperforms DHT-based and flooding protocols.