• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.301-304
• /
• 2013

In this paper, to improve the fast boot and soft real-time for the responsiveness in Qplus with relative evaluation rather than an absolute evaluation using validated to perform the services actually used. Qplus is included soft real-time, fast booting, and file system technology. There is a development board that mounted on an embedded Linux and Qplus. AV (Audio / Video) group communications is ported on the development board for soft real-time multimedia streaming services and to evaluate the performance of communication. We performed three major evaluation such as booting time measurement experiment, own performance measurement experiments for soft real-time measurement experiment, and performance measurement experiments for via the network communication performance evaluation. They are a practical Qplus performance evaluation and analysis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5B
• /
• pp.421-429
• /
• 2006

In this paper, we suggest a new capability aware spanning tree(CAST) algorithm for Ethernet bridged network which consists of both legacy Ethernet bridges and synchronous Ethernet ones. The legacy spanning tree algorithm specified in IEEE 802.1D standard select root bridge and construct tree based on each bridge's identifier without consideration of each bridge's capability. Thus we note that if the legacy STP may assign a synchronous bridge as a root bridge, the bridge may become a bottleneck for asynchronous trafficbecause of bandwidth limitation for asynchronous traffic. In this paper, the CAST algorithm constructsmultiple spanning tree by using of bridge capability and makes different transmission path for each traffics, can removes this kind of defect. From the simulation results, we can see that the proposed CAST algorithm has better end-to-end delay performance than legacy spanning tree algorithm in high traffic load and multiple hops environment.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.1-11
• /
• 2005

Internet has become an essential part of our daily lives. Many of the day to day activities can already be carried out over Internet, and its convenience has greatly increased the number of Internet users. Hut as Internet gains its popularity, the illicit incidents over Internet has also proliferated. The intruder trace-back technology is the one that enables real time tracking the position of the hacker who attempts to invade the system through the various bypass routes. In this paper, the RTS algorithm which is the TCP connection trace-back system using the watermarking technology on Internet is proposed. Furthermore, the trace-bark elements are modeled by analyzing the Proposed trace-back algorithm, and the results of the simulation under the virtual topology network using ns-2, the network simulation tool are presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9C
• /
• pp.778-785
• /
• 2010

This paper proposes a high-precision ranging scheme based on channel estimation technique and multipath delay analysis in IR-UWB systems. When the IR-UWB signal is transmitted and received, the high-precision ranging is estimated with the time-of-arrival information of the signal. In the proposed scheme, the channel estimation process with the minimum mean square error technique or zero forcing technique is performed and the overlapped multipath within the pulse is analyzed with matrix pencil (MP) algorithm to achieve the ranging accuracy of centimeters. The performance of proposed scheme is evaluated with various IEEE 802.15.4a channel models and the relationship between the ranging performance and the computational complexity is analyzed in terms of the MP parameter values.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.677-683
• /
• 2006

If a node stops functioning in an ad-hoc wireless network, routing paths involving the node will also fail, when construction of replacement routes is required. A major cause of node failure is energy exhaustion, and route replacements may in turn lead to successive node failures by making more nodes consume their energy. The result could be performance degradation of networks. Therefore it is important to ensure that nodes with limited remaining energy are not included in route construction from the beginning. In this paper we propose a new routing protocol, which takes residue energy of nodes into account in order to prevent node failures resulting from energy shortage. Our routing protocol examines the smallest value of node residue energy ($E_{m}$) from each of all possible routing paths and selects the path which has the largest value of $E_{m}$. We prove, through simulation, that our routing protocol extends the lifetime of nodes which have limited amount of energy, reducing chances of path replacement. It is also shown that our proposed protocol helps alleviate network performance degradation.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.199-211
• /
• 2009

Recent advancements in wireless networks have enabled support for mobile applications to transfer data over heterogeneous wireless paths in parallel using data striping technique [2]. Traditionally, high performance data transfer requires tuning of multiple TCP sockets, at sender's end, based on bandwidth delay product (BDP). Moreover, traditional techniques like Automatic TCP Buffer Tuning (ATBT), which balance memory and fulfill network demand, is designed for wired infrastructure assuming single flow on a single socket. Hence, in this paper we propose a buffer tuning technique at senders end designed to ensure high performance data transfer by striping data at transport layer across heterogeneous wireless paths. Our mechanism has the capability to become a resource management system for transport layer connections running on multi-homed mobile host supporting features for wireless link i.e. mobility, bandwidth fluctuations, link level losses. We show that our proposed mechanism performs better than ATBT, in efficiently utilizing memory and achieving aggregate throughput.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.181-188
• /
• 2007

Undirected Rural Postman Problem(URPP) is a problem that finds a shortest tour traversing the given arcs at least once in a given network. The URPP is one of the basic network problems used in solving the various real-world problems. And it is known as NP-Complete. URPP is an arc-oriented problem that the direction of a tour in an arc has to be considered. Hence, In URPP, it is difficult to use the algorithm for Traveling Salesman Problem (TSP), which is a node-oriented problem, directly. This paper proposes the decoding algorithm using graph transformation in the genetic algorithm for URPP. That is, you can find the entire tour traversing without considering the direction of arcs by transforming the arc-oriented graph into the node-oriented graph. This paper compares the performances of the proposed algorithm with an existing algorithm. In the simulation results, the proposed algorithm obtained better than the existing algorithm

• Journal of Wetlands Research
• /
• v.12 no.3
• /
• pp.15-20
• /
• 2010

The contamination loadings generated in Changwon City are coming into Masan Bay through the Bongam tidal flat except the loadings collected and transferred by sewer lines to the wastewater treatment plant. The recovery of waterbirds, shellfishes, and fishes has been quite well recognized in recent years after the first implementation of Masan Bay TPLM (Total Pollution Loads Management) in Korea. This tidal flat has been conserved by the cooperation of several stakeholders and utilized as an ecosystem field site for in situ education. A large industrial complex has been operated since 1970's, therefore increasing the level of pollutants in estuary and costal sediments, especially by heavy metals. Zinc, copper, and lesd contamination of sediment was revealed at higher level by Clean-up guideline (MOMAF) or heavily polluted level by SQC (USEPA). There was a significant difference between two sites at the 95% confidence level, which implies no homogeneity in the processes of transport and deposition even at 500 m of distance. The heavy metal concentrations in the Bongam sediments have been gradually decreased with comparing the data of 2006, and 2009.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.1-12
• /
• 2009

A routing policy based on BGP community routing permits to select a specific route for particular network by making use of user-defined routing policies. Especially, community based routing policy is recently getting a great concern to enhance overall performance in the global research networks which are generally inter-connected large number of different characterized networks. In this paper, we analyze the community routing which has been applied in existing global research networks in the network performance point of view, and catch hold of problems caused by the routing performance in a new global research network. Then, we suggest an effective community routing policy model along with an interconnection architecture of research networks, in order to make correct some wrong routings and resolve an asymmetric routing problem, for a new global research network. Our work is expected to be utilized as an enabling base technology to improve the network performance of future global research networks as well as commercial networks.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.20 no.10
• /
• pp.126-134
• /
• 2006

This paper describes the development of an embedded wireless LAN controller which can be in parallel operated with an existing utility controller. The embedded controller mainly consists of Prism(R) 2.5 chip set and Atmega 128 microcontroller. In order to communicate over the network, the controller including TCP/IP stack (IP, TCP, UDP, and ICMP), telnet, and X/Z modem has been developed. For a specific application, we have proposed an special method to convert data structure between TCP/IP and X/Z modem and a data buffer algorithm to minimize the RAM memory usage. Finally, the correctness and performance of the protocols are tested and verified using $CommView^{(R)}\;and\;DU^{(R)}$. The development is satisfactorily operated only for 3,381 bytes of RAM usage without sacrificing interoperability between hosts.