• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.687-695
• /
• 2005

With increasing demand of using mobile Internet, HMIPv6 is proposed by IETF to reduce location management traffics due to micro mobility and to provide IP-based movement. A paging mechanism combined with HMIPv6 can reduce the signaling traffics of a mobile node. We propose a dynamic paging mechanism in HMIPv6 which decides an optimal paging area for each mobile node by considering its characteristics. Total costs of a static paging mechanism and a dynamic paging mechanism are analyzed by mathematical formulas. As a result, we proved that the dynamic paging mechanism reduced total signal traffic costs more than a static paging mechanism.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.6
• /
• pp.674-682
• /
• 2003

Ship autonomous navigation is designated as what computerizes mental faculties possessed of navigation experts, which are building navigation plans, grasping the situation, forecasting the fluctuation, and coping with the situation. An autonomous navigation system, which consists of several subsystems such as navigation system, a collision avoidance system, several data fusion systems, and a motion control system, is based on an intelligent control architecture for the sake of integrating the systems. The motion control system, which is one of the most essential system in autonomous navigation system, controls its propulsion and steering gears to move the ship satisfying its hydrodynamic characteristics. This paper is the study on the ship movement control system and its implementation which are totally developed and run on virtual-world system. Receiving the high-level control values such as a waypoint presented from the collision avoidance system, the motion control system generates them to low-level control values for propulsion and steering devices. In the paper, we develop a ship motion controller using Oldenburger's theory based on mathematical fundamentals, and simulate it with various scenarios in order to verify its performance.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.17 no.1
• /
• pp.137-145
• /
• 2009

The steady-state kinetics of the selective catalytic reduction (SCR) of $NO_X$ with $NH_3$ has been investigated over a commercial ${V_2}{O_5}/TiO_2$ catalyst. In order to account for the influence of transport effects the kinetics are coupled with a fully transient two-phase 1D+1D monolith channel model. The Langmuir-Hinshelwood (L-H) mechanism is adopted to describe the steady-state kinetic behavior of the ${V_2}{O_5}/TiO_2$ catalyst. The reaction rate expressions are based on previously reported papers and are modified to fit the experimental data. The steady-state chemical reaction scheme used in the present mathematical model has been validated extensively with experimental data of selective $NO_X$ reduction efficiency for a wide range of inlet conditions such as space velocity, oxygen concentrations, water concentration, and $NO_2/NO$ ratio. The parametric investigations are performed to examine how the $NH_3$ slip from a SCR $DeNO_X$ catalyst and the conversion of $NO_X$ are affected by the reaction temperature, $NH_3/NO_X$ feed ratio, and space velocity for feed gas compositions with $NO_2/NO_X$ ratios of 0 and 0.5.

• Journal of Internet Computing and Services
• /
• v.9 no.2
• /
• pp.35-42
• /
• 2008

Mobile IP is a solution to support mobile nodes, however, it does not handle NEtwork MObility (NEMO). The NEMO Basic Support (NBS) protocol ensures session continuity for all the nodes in the mobile network. Since the protocol is based on Mobile IP, it inherits the same fundamental problem such as tunnel convergence, when supporting the multicast for NEMO. In this paper, we propose the multicast route optimization scheme for NEMO environment. We assume that the Mobile Router (MR) has a multicast function and the Nested Mobile Router Information (NeMRI) table. The NeMRI is used to record o list of the CoAs of all the MRs located below it. And it covers whether MRs desire multicast services. Any Route Optimization (RO) scheme can be employed here for pinball routing. Therefore, we achieve optimal routes for multicasting based on the given architecture. We also propose cost analytic models to evaluate the performance of our scheme. We observe significantly better multicast cost in NEMO compared with other techniques such as Bi-directional Tunneling, Remote Subscription, and Mobile Multicast based on the NBS protocol.

• Journal of KIISE:Software and Applications
• /
• v.33 no.2
• /
• pp.252-266
• /
• 2006

Many problems in computer vision are mainly based on mathematical models. Their optimal solutions can be found by estimating the parameters of each model. However, provided an input data set is involved outliers which are relative]V larger than normal noises, they lead to incorrect results. RANSAC is a representative robust algorithm which is used to resolve the problem. One major problem with RANSAC is that it needs priori knowledge(i.e. a percentage of outliers) of the distribution of data. To solve this problem, we propose a FRANSAC algorithm which improves the rejection rate of outliers and the accuracy of solutions. This is peformed by categorizing all data into good sample set, bad sample set and vague sample set using a fuzzy classification at each iteration and sampling in only good sample set. In the experimental results, we show that the performance of the proposed algorithm when it is applied to the linear regression and the calculation of a homography.

• Journal of Korea Society of Industrial Information Systems
• /
• v.20 no.5
• /
• pp.1-11
• /
• 2015

This paper is focused on how the trajectory of launch vehicle could be optimally estimated by the quadratic regression of trajectory data mining for the operation of telemetry ground system in NARO space center during real-time. To receive the telemetry data, the telemetry ground system has to track the space launch vehicle without tracking loss, and it is possible by the well-designed algorithm to estimate a flight position in real-time. For this reason, the quadratic regression model instead of interpolation was considered to estimate the exact position data of launch vehicle and the improvement of antenna performance. For analysis, the real trajectory data which had been logged during NARO 1st launch mission were used, the estimation result of launcher current position was analyzed by the mathematical modeling. In conclusion, the algorithm using quadratic regression based on trajectory data mining showed the better performance than previous interpolation algorithm to estimate the next flight position and the antenna driving performance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.9
• /
• pp.19-28
• /
• 2010

The GTS(Guaranteed Time Slot) of the IEEE 802.15.4 standard, which is the contention free access mechanism, is used for low-latency applications or applications requiring specific data bandwidth. But it has some problems such as delay of service due to FIFS(First In First Service) scheduling. In this paper, we proposes a weight based GTS allocation scheme for fair queuing in IEEE 802.15.4 LR-WPAN. The proposed scheme uses a weight that formed by how much more weight we give to the recent history than to the older history for a new GTS allocation. This scheme reduces service delay time and also guarantees transmission simultaneously within a limited time. The results of the performance analysis shows that our approach improves the performance as compared to the native explicit allocation mechanism defined in the IEEE 802.15.4 standard.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5A
• /
• pp.325-338
• /
• 2012

In this paper, a radio resource allocation scheme for a multi-hop relay transmission in cognitive radio (CR) system is proposed to support the employment of relay nodes in IEEE 802.22 standard for wireless regional area network (WRAN). An optimization problem is formulated to maximize the number of serving secondary users (SUs) under system constraints such as time-divided frame structure for multiplexing and a single resource-unit to every relay-hop. However, due to mathematical complexity, the optimization problem is solved with a sub-optimal manner instead, which takes three steps in the order of user selection, relay/path selection, and frequency selection. In the numerical analysis, this proposed solution is evaluated in terms of service rate denoting as the ratio of the number of serving SUs to the number of service-requesting SUs. Simulation results show the condition of adopting multi-hop relay and the optimum number of relaying hops by comparing with the performance of 1-hop system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.10
• /
• pp.2403-2408
• /
• 2014

We designate multiple target areas for the advertisement disseminations in order to resolve the problem of advertisement transmission efficiency degradation due to overlapped device-to-device (D2D) transmissions and unnecessary advertisement transmissions. We here propose an efficient advertisement dissemination algorithm based on pre-selected target areas considering user density. In our proposed algorithm, relay nodes are gradually selected according to the locations of the target areas. We mathematically analyze D2D advertisement coverages of our proposed algorithm, and compare the various simulation results of the proposed algorithm with those of the conventional algorithm according to the several simulation scenarios via intensive simulations.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.3
• /
• pp.21-28
• /
• 2016

We propose an adaptive scheme of a differential codebook for temporally correlated channels. And the codeword entries of the propose codebook are selected among the set of M-PSK constellations - the values of M proposed in this paper are 8, 16, or 32. Firstly, we analyze mathematically how the optimal spherical cap radius of the proposed codebook is tracked. Then, we explain the practical implementation of the proposed adaptive method. Practically, some candidate differential codebooks we propose in this paper can be switched according to the temporal correlation coefficients of wireless channels in the proposed scheme. Monte-Carlo simulations demonstrate that the achievable throughput performance employing the proposed codebook is always superior to those of the differential codebooks employing M-PSK constellations and non-adaptive differential codebooks with the same amount of feedback information.