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 33, Issue 12C - Dec 2008
Volume 33, Issue 12B - Dec 2008
Volume 33, Issue 12A - Dec 2008
Volume 33, Issue 11C - Nov 2008
Volume 33, Issue 11B - Nov 2008
Volume 33, Issue 11A - Nov 2008
Volume 33, Issue 10C - Oct 2008
Volume 33, Issue 10B - Oct 2008
Volume 33, Issue 10A - Oct 2008
Volume 33, Issue 9C - Sep 2008
Volume 33, Issue 9B - Sep 2008
Volume 33, Issue 9A - Sep 2008
Volume 33, Issue 8C - Aug 2008
Volume 33, Issue 8B - Aug 2008
Volume 33, Issue 8A - Aug 2008
Volume 33, Issue 7C - Jul 2008
Volume 33, Issue 7B - Jul 2008
Volume 33, Issue 7A - Jul 2008
Volume 33, Issue 6C - Jun 2008
Volume 33, Issue 6B - Jun 2008
Volume 33, Issue 6A - Jun 2008
Volume 33, Issue 5C - May 2008
Volume 33, Issue 5B - May 2008
Volume 33, Issue 5A - May 2008
Volume 33, Issue 4C - Apr 2008
Volume 33, Issue 4B - Apr 2008
Volume 33, Issue 4A - Apr 2008
Volume 33, Issue 3C - Mar 2008
Volume 33, Issue 3B - Mar 2008
Volume 33, Issue 3A - Mar 2008
Volume 33, Issue 2A - Feb 2008
Volume 33, Issue 2C - Feb 2008
Volume 33, Issue 2B - Feb 2008
Volume 33, Issue 1C - Jan 2008
Volume 33, Issue 1B - Jan 2008
Volume 33, Issue 1A - Jan 2008
Selecting the target year
Improvement of Upstream Bandwidth Utilization Using Two-Upstream-Wavelengths TDM-PON System
Chung, Jun-Hoi ; Park, Jae-Uk ; Choi, Byung-Chul ; Yoo, Jea-Hoon ; Kim, Byoung-Whi ; Park, Young-Il ;
The Journal of Korean Institute of Communications and Information Sciences, volume 33, issue 8B, 2008, Pages 609~614
Upstream data frame of TDM-PON includes various types of overheads, and there exist guard bands between consecutive frames from different ONUs. Although they are indispensible in synchronization and performance, they cause bandwidth waste at the same time. To solve this problem, a new TDM-PON that uses two types of wavelengths in upstream transmission is suggested. By even distribution of two wavelengths among ONUs and overhead overlap between frames that use different wavelengths, almost 100% bandwidth efficiency could be achieved. A serializer that multiplexes signals from two wavelengths is implemented for this purpose.
Performance Analysis and Evaluation of EDCF Supporting Fairness in Wireless LANs
Choi, Kee-Hyun ; Lee, Jae-Kyung ; Shin, Dong-Ryeol ;
The Journal of Korean Institute of Communications and Information Sciences, volume 33, issue 8B, 2008, Pages 615~623
Wireless LAN (WLAN) has greatly benefited from the introduction of various technologies, such as MAC protocol and scheduling algorithm. The majority of these technologies focus on fairness or service differentiation. However, it is difficult to use these technologies to provide many benefits to WLAN simultaneously because the current WLAN system only focuses on the provision of a single aspect of QoS. Unfortunately, multimedia applications require both service differentiation and fairness. Therefore, this paper combines Distributed Fair Scheduling (DFS) and Enhanced Distributed Coordinate Function (EDCF), to provide both fairness and service differentiation simultaneously. Furthermore, we show numerical analysis using Markov process. The simulation results demonstrate that F-EDCF outperforms the EDCF, in terms of throughput, fairness, and delay viewpoints.
Energy-aware Tree Routing Protocol for Wireless Sensor Networks
Hwang, So-Young ; Jin, Gwang-Ja ; Shin, Chang-Sub ; Kim, Bong-Soo ;
The Journal of Korean Institute of Communications and Information Sciences, volume 33, issue 8B, 2008, Pages 624~629
Many routing protocols have been proposed for sensor networks where energy awareness and reliability are essential design issues. This paper proposes an Energy-aware Tree Routing Protocol (ETRP) for Wireless Sensor Networks. The proposed scheme relates to reliable and energy efficient data routing by selecting a data transmission path in consideration of residual energy at each node to disperse energy consumption across the networks and reliably transmit the data through a detour path when there is link or node failure. Simulation results show that the proposed method outperformed traditional Tree Routing (TR) by 23.5% in network lifetime.
A Multi-Level Routing Protocol Based on Fixed Radio Wave Radius in Wireless Sensor Network
Jin, Shi-Mei ; Li, Yong-Zhen ; Rhee, Chung-Sei ;
The Journal of Korean Institute of Communications and Information Sciences, volume 33, issue 8B, 2008, Pages 630~635
Recently, in order to improve the energy efficiency of WSN(Wireless Sensor Network), widely research have teen carried on. But, up to the present, Majority of methods are based on direct communication between CH(cluster head) and sink node, and based on the assumption that node can regulate signal energy actively according to the distance between nodes. So it's hard to implement those methods. Based on the theory that node has fixed radio wave radius, this paper present a multi leveling routing protocol. According to the simulation of the presented protocol, we have proved the energy saving efficiency and the implementation in real WSN.
Routing for Enhancing Source-Location Privacy with Low Delivery Latency in Sensor Networks
Tscha, Yeong-Hwan ;
The Journal of Korean Institute of Communications and Information Sciences, volume 33, issue 8B, 2008, Pages 636~645
Most of routing schemes that protect the source's location from a malicious attacker usually make use of a path of a long length per message for the sake of lengthening the safety period. The biggest problem to such approaches is taking a very long latency in transferring messages to the destination. In this paper we show the problem to find the least-cost single path that is enough to keep the source-location always secure from the attacker, provided that it is used for the delivery of a set of messages given in priori, is NP-complete. Consequently we propose a routing protocol GSLP-w(GPSR-based Source-Location Privacy with crew size co) that is a trade-off between two extreme approaches. The advantage of GSLP-co lies in its enhanced safety period for the source and its lowered delivery latency in messaging. We consider NSP(Normalized Sefety Period) and NDL(Normalized Delivery Latency), measured in terms of the least number of hops to the destination, to achieve tangible interpretation of the results. We ran a simulation to confirm our claim by generating 100 topologies of 50,000 nodes with the average number of neighbors being 8. The results show that GSLP-
provides more enhanced NSP compared to other protocols GSLP, an earlier version of GSLP-
, and PR-SP(Phantom Routing - Single Path), the most notable existing protocol for the source-location privacy, and less NDL than that of GSLP but more than that of PR-SP.
Design of MAC Chip for AWG-based WDM-PON-II: MAC Protocol
Han, Kyeong-Eun ; Yang, Won-Hyuk ; Kim, Young-Chon ;
The Journal of Korean Institute of Communications and Information Sciences, volume 33, issue 8B, 2008, Pages 646~656
In this paper, we design and verify the MAC chip of the two-stage AWG-based WDM-PON which considers 128 ONUs and 32 wavelengths. Each wavelength with the capacity of 1Gbps is allocated to ONU for downstream transmission but each wavelength for upstream transmission can be shared by four ONUs. Therefore, MAC protocol is required to avoid the collision and use the network resource efficiently among ONUs which are sharing the same wavelength. To design a request/permit-based MAC protocol, we define a unit-chip module called sub-MAC. The WDM-PON with 128 ONUs can be implemented by using 32 sub-MAC modules. The sub-MAC consists of one control unit, one receipt unit and four transmission units. The state transition diagram of the module is described by the internal/external control signals among the functional units. The function of the sub-MAC module is verified through logic simulation using ModelSIM.
A Study on Efficient Infrastructure Architecture for Intersection Collision Avoidance Associated with Sensor Networks
Hwang, Kwang-Il ;
The Journal of Korean Institute of Communications and Information Sciences, volume 33, issue 8B, 2008, Pages 657~666
The intersection collision avoidance service among various telematics application services is regarded as one of the most critical services with regard to safety. In such safety applications, real-time, correct transmission of service is required. In this paper, we study on efficient infrastructure architecture for intersection collision avoidance using a cooperative mechanism between vehicles and wireless infrastructure. In particular, we propose an infrastructure, called CISN (Cooperative Infrastructure associated with Sensor Networks), in which proper numbers of sensor nodes are deployed on each road, surrounding the intersection. In the proposed architecture, overall service performance is influenced by various parameters consisting of the infrastructure, such as the number of deployed sensor nodes, radio range and broadcast interval of base station, and so on. In order to test the feasibility of the CISN model in advance, and to evaluate the correctness and real-time transmission ability, an intersection sensor deployment simulator is developed. Through various simulations on several environments, we identify optimal points of some critical parameters to build the most desirable CISN.
Modeling and Analysis of Wireless Lan Traffic
Yamkhin, Dashdorj ; Lee, Seong-Jin ; Won, You-Jip ;
The Journal of Korean Institute of Communications and Information Sciences, volume 33, issue 8B, 2008, Pages 667~680
In this work, we present the results of our empirical study on 802.11 wireless LAN network traffic. We collect the packet trace from existing campus wireless LAN infra-structure. We analyzed four different data sets: aggregate traffic, upstream traffic, downstream traffic, tcp only packet trace from aggregate traffic. We analyze the time series aspect of underlying traffic (byte count process and packet count process), marginal distribution of time series, and packet size distribution. We found that in all four data sets there exist long-range dependent property in byte count and packet count process. Inter-arrival distribution is well fitted with Pareto distribution. Upstream traffic, i.e. from the user to Internet, exhibits significant difference in its packet size distribution from the rests. Average packet size of upstream traffic is 151.7 byte while average packet size of the rest of the data sets are all greater than 260 bytes. Packets with full data payloads constitutes 3% and 10% in upstream traffic and the downstream traffic, respectively. Despite the significant difference in packet size distribution, all four data sets have similar Hurst values. The Hurst alone does not properly explain the stochastic characteristics of the underlying traffic. We model the underlying traffic using fractional-ARIMA (FARIMA) and fractional Gaussian Noise (FGN). While the fractional Gaussian Noise based method is computationally more efficient, FARIMA exhibits superior performance in accurately modeling the underlying traffic.
Dynamic Price-Based Call, Admission Control Algorithm for Multi-Class Communication Networks
Gong, Seong-Lyong ; Lee, Jang-Won ;
The Journal of Korean Institute of Communications and Information Sciences, volume 33, issue 8B, 2008, Pages 681~688
In this paper, we propose a new price-based call admission control algorithm for multi-class communication networks. When a call arrives at the network, it informs the network of the number of requested circuits and the minimum amount of time that it will require. The network provides the optimal price for the arrived call with which it tries to maximize its expected revenue. The optimal price is dynamically adjusted based on the information of the arrived call, and the present and the estimated future congestion level of the network during the reservation time of the call. If the call accepts the price, it is admitted. Otherwise, it is rejected. We compare the performance of our dynamic pricing algorithm with that of the static pricing algorithm by Courcoubetis and Reiman , and Paschalidis and Tsitsiklis . By the comparison, we show that our dynamic pricing algorithm has better performance aspects such as higher call admission ratio and lower price than the static pricing algorithm, although these two algorithms result in almost the same revenue as shown in . This implies that, in the competitive situation, the dynamic pricing algorithm can attract more users than the static pricing algorithm, generating more revenue. Moreover, we show that if a certain fixed connection fee is introduced to the price for a call, our dynamic pricing algorithm yields more revenue.
Improving TCP Performance Over Mobile ad hoc Networks by Exploiting Cluster-Label-based Routing for Backbone Networks
Li, Vitaly ; Ha, Jae-Yeol ; Oh, Hoon ; Park, Hong-Seong ;
The Journal of Korean Institute of Communications and Information Sciences, volume 33, issue 8B, 2008, Pages 689~698
The performance of a TCP protocol on MANETs has been studied in a numerous researches. One of the significant reasons of TCP performance degradation on MANETs is inability to distinguish between packet losses due to congestion from those caused by nodes mobility and as consequence broken routes. This paper presents the Cluster-Label-based Routing (CLR) protocol that is an attempt to compensate source of TCP problems on MANETs - multi-hop mobile environment. By utilizing Cluster-Label-based mechanism for Backbone, the CLR is able to concentrate on detection and compensation of movement of a destination node. The proposed protocol provides better goodput and delay performance than standardized protocols especially in cases of large network size and/or high mobility rate.
Performance Comparison of SCTP and TCP over Linux Platform
Park, Jae-Sung ; Koh, Seok-Joo ;
The Journal of Korean Institute of Communications and Information Sciences, volume 33, issue 8B, 2008, Pages 699~706
This paper compares throughput performance of TCP and SCTP in a variety of network environments. For experiments, we construct a Linux-based testbed and consider a set of performance metrics such as MSS(Maximum Segment Size), transmission delay, and packet loss rate. In addition, we analyze the effect of SCTP multi-streaming on throughput. From the experimental results, we can see that SCTP provides throughput gain of approximately
over TCP. This performance gain comes from the distinctive features of SCTP such as chunk bundling, initial congestion window of 2 MTU and SACK(Selective ACK) based error control. In the lossy networks, we can see that SCTP multi-streaming transmissions can effectively overcome the so-called HoLB(Head-of-Line Blocking) phenomenon of TCP.
Traffic Classification Using Machine Learning Algorithms in Practical Network Monitoring Environments
Jung, Kwang-Bon ; Choi, Mi-Jung ; Kim, Myung-Sup ; Won, Young-J. ; Hong, James W. ;
The Journal of Korean Institute of Communications and Information Sciences, volume 33, issue 8B, 2008, Pages 707~718
The methodology of classifying traffics is changing from payload based or port based to machine learning based in order to overcome the dynamic changes of application's characteristics. However, current state of traffic classification using machine learning (ML) algorithms is ongoing under the offline environment. Specifically, most of the current works provide results of traffic classification using cross validation as a test method. Also, they show classification results based on traffic flows. However, these traffic classification results are not useful for practical environments of the network traffic monitoring. This paper compares the classification results using cross validation with those of using split validation as the test method. Also, this paper compares the classification results based on flow to those based on bytes. We classify network traffics by using various feature sets and machine learning algorithms such as J48, REPTree, RBFNetwork, Multilayer perceptron, BayesNet, and NaiveBayes. In this paper, we find the best feature sets and the best ML algorithm for classifying traffics using the split validation.
A Study on the Design of the Security Gateway for Role-based Dynamic Security Rule-Set
Lee, Chun-Jae ; Cho, Ki-Ryang ;
The Journal of Korean Institute of Communications and Information Sciences, volume 33, issue 8B, 2008, Pages 719~726
In this thesis investigate the security gateway that manage authorization for user access dynamically by recognizing automatically and comparison & distinction between database and User-information while a terminal unit(PC) trying to access to the network of subnet. Also, it present User-interfaced authorization allowance role model, so administrator can assign united access control between network level(L2) and application level(L7) in relation to system construction.
Study of the Enhancement Performance and Security of Inbound Network
Jeon, Jeong-Hoon ;
The Journal of Korean Institute of Communications and Information Sciences, volume 33, issue 8B, 2008, Pages 727~734
Recently, Network technology evolve out of expansion a scale of Network and development various Service. also Hacking skill. We have applied to various Security Systems to make a counterattack on this hacking skill. and A Firewall among these security systems is very effective a defense against in the Outbound Network attack. so we need certainly a Firewall to protect a network. But this Conventional Firewall has an directly effect on reduction to the Performance and Security of Inbound Network. and have no effect on a Inner Network Attacking. In this paper, I propose to a "Functional Firewall" as a Secure Objects for the enhancement Performance and Security of Inbound Network.
Operation Policy for Enhancing Availability of a Web Server against DoS Attacks
Baik, Nam-Kyun ; Jung, Sou-Hwan ;
The Journal of Korean Institute of Communications and Information Sciences, volume 33, issue 8B, 2008, Pages 735~744
This paper proposes a 'secure node' to be robust against network-based DoS attacks. The secure node selectively accepts new sessions based on the Zipf's law while a link is in the overload state. Our scheme calculates a threshold value for overload state, and provides a dynamic service mechanism for enhancing availability of a web server. The simulation results show performance improvement of the proposed scheme in terms of completion/connection ratios.