• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.57-64
• /
• 2002

Since most of the current route selection algorithms use the shortest path algorithm, network resources can not be efficiently used also traffics be concentrated on specific paths resulting in congestgion. In this paper we propose the statistical route selections(SRS) algorithm which adopts a statistical mechanism to utilize the network resource efficiently and to avoid congestion. The SRS algorithm handles requests on demand and chooses a path that meets the requested bandwidth. With the advent of the MPLS it becomes possible to establish an explicit LSP which can be used for traffic load balancing. The SRS algorithm finds a set of link utilizations for route selection, computes link weights using statistical mechanism and finds the shortest path from the weights. Our statistical mechanism computes the mean and the variance of link utilizations and selects a route such that it can reduce the variance and the number of congested links and increase the utilization of network resources. Throughout the simulation, we show that the SRS algorithm performs better than other route selection algorithms on several metrics like the number of connection setup failures and the number of congested links.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.501-504
• /
• 2005

In general, most incomplete communication link setup between satellite and ground station right after separation from launcher come from less accurate orbital vector ground station uses to track the satellite because only predicted orbital state vector is available during first few orbits. This paper describes the developed procedure for successful initial acquisition for KOMPSAT-2 using scanning functions ofK13 antenna system with predicted orbital information. Azimuth scan, raster scan, spiral scan functions were tested with KOMPSA Tl under intentionally degraded orbital information for antenna operation. Through tests, spiral scan function was decided to be best search scan among 3 scans. Developed procedure can assure the successful acquisition only if azimuth offset and time offset value are within +/-2deg and +/-30sec, respectively.

• Journal of Industrial Technology
• /
• v.28 no.B
• /
• pp.245-250
• /
• 2008

Recently, mobile devices have supported wireless LAN as well as bluetooth, where the services such as heterogeneous network access and seamless mobility connection are important. Even though the mobility and physical network might be varied, an efficient communication mechanism for the network access and a robust mobility management of mobile devices are needed. In this paper, we design and implement a Bluetooth system with mobile LAN access capability. The proposed system has the following features; 1) IP connection is enabled by BENP in the link layer, 2) The networks devices of heterogeneous mobile devices are integrated into a single virtual network interface, 3) IP mobility between the bluetooth and wireless LAN is supported by mobile IP. The experimented results show that the packet loss and delay time during the handover duration is reduced by predicting the handover among different networks followed by the setup of any required parameters in advance.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.5
• /
• pp.439-444
• /
• 2012

In this study, we address the formation control problem of coupled unicycle-type mobile robots, each of which can interact with its neighboring robots by communicating their position outputs. Each communication link between two mobile robots is assumed to be established according to the given time-varying interconnection topology that switches within a finite set of connected fixed undirected networks and has a non-vanishing dwell time. Under this setup, we propose a distributed formation control algorithm by using the dynamics extension and feedback linearization methods, and by employing a consensus algorithm for linear multi-agent systems which provides arbitrary fast convergence rate to the agreement of the multi-agent system. Finally, the proposed result is demonstrated through a computer simulation.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.323-326
• /
• 1997

Conventional robots actuated by motors with the speed reducer such as harmonic drive had weakness in delivering loads, pressing, grinding, and cutting jobs. To overcome this, the developer a new type of robot actuated by the ball screw. The robot is an articulated shape, which is composed of four axes. The base axis is actuated similarly with conventional robot, but the others are actuated by four bars mechanism composed of the ball screw. We setup the dynamics model of the robot. The robot has parameter uncertainties and nonlinearlity due to the ball screw actuator. To coordinate the robot, we applied sliding-mode control.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7A
• /
• pp.781-785
• /
• 2004

Mobile IP maintains Internet connectivity while Mobile Hosts moving from one Internet attachment point to another. However, Mobile If is not appropriate for seamless mobility. Some micromobility protocols were proposed to complement Mobile IP by offering fast and seamless handoff control in limited geographical areas. In this paper, a new scheme, based on path prediction and resource reservation, is proposed to reduce the handoff latency by trying to eliminate the link setup time for fast handoff in all-IP wireless networks. Analytical results show that the proposed scheme offers shorter handoff delay and can improve the handoff efficiency.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.250-256
• /
• 2011

A two-way relaying (TWR) system is analyzed, where two source terminals with unequal numbers of antennas exchange data via an amplify-and-forward relay terminal with a single antenna. In the system considered herein, the link quality between the sources and relay can generally be asymmetric due to the nonidentical antenna configuration, power allocation, and relay location. In such a general setup, accurate bounds on the average sum rate (ASR) are derived when beamforming or orthogonal space time block coding is employed at the sources. We show that the proposed bounds are almost indistinguishable from the exact ASR under various system configurations. It is also observed that the ASR performance of the TWR system with unequal numbers of source antennas is more sensitive to the relay location than to the power allocation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.4
• /
• pp.122-128
• /
• 2016

This paper, proposes a new analysis method for the event detection of an OTDR signal. An OTDR signal was passed through the Hamming filter to remove the high frequency noise included in the signal. The signal was then passed consecutively through a differential filter to detect the events of interest. The terminal position was determined using the fact that there is a large gap between the signal and the trailing noise power beyond the terminal. This study examined the local maxima of the signal up to the terminal position and determined the peak regions. The real events were determined from the peak regions using noise information and peak threshold. Finally, the user events were found by inspecting the user peaks beyond the terminal position. The events of the OTDR signal without users are located at less than 17m compared to the optical fiber link setup. The events of the JDSU device are located less than 25m and their users are less than 5m. For the RadianTech device, the events are detected at less than 19m and the users are found in 5m. The results suggest that the proposed method is sufficiently applicable to an optical fiber link monitoring system.

• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.155-162
• /
• 2003

Fast restoration time and service guarantee are the important goals to achieve the network reliability. In the protection switching scheme, one way to guarantee service fro an application session if a network happens to fail is to establish the restoration path that amounts to the same bandwidth of the working path of the session at the same time. When we setup the restoration path, we can reduce the bandwidth consumption by the restoration path if the path can share the bandwidth required by the other paths. This paper explains the methods how to determine the shared bandwidth of the restoration path in the protection switching scheme, given the maximum bandwidth assigned to a link along the working path. We point out that such sharing algorithm can not reduce the bandwidth consumption by the restoration paths in some cases, which contradict the general conception. We explain why this can happen, and show the simulation results in real network topologies to prove our arguments. We explain the reason of the failure of the sharing effect by the simple sharing algorithm. Finally we propose the way of how we can overcome the failure of the sharing effect, using the complete sharing algorithm based on the link database and showing the results.

• Journal of Satellite, Information and Communications
• /
• v.11 no.3
• /
• pp.133-137
• /
• 2016

Millimeter wave wireless communication systems, especially those targeting indoor high rate data transfer, have a strong requirement for high quality wireless link. Unfortunately, in this frequency band, the electromagnetic wave has to sustain the high propagation loss caused by the smaller wavelengths. In this scenario, beamforming technique, which enhances the link quality by focusing the radiation power on a direction, becomes one of the most important techniques in millimeter wave band wireless communication. In recent year, there been conducted many research on beamforming to improve the performance of wireless system. In this paper, we evaluate the performance of a simplified codebook-based beamforming scheme which is based on multiple-procedure and three-state beam selection. The simplified scheme significantly reduces beamforming setup time, comparing to the exhaustive searching, two-level searching adopted in IEEE 802.15.3c standard, and also conventional multi-level scheme.