• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2B
• /
• pp.143-150
• /
• 2009

In this paper, we propose a novel shadow clustering mechanism including a mobility estimation algorithm based on Gauss-Markov mobility model which analyses patterns of moving direction and speed of a mobile terminal respectively and a selection algorithm of the most suitable network for the requirements of mobile terminals. The proposed mechanism makes much less shadow cluster area than that of the legacy methods, and reduces unnecessary resource reservation. It is compared the proposed algorithm with traditional methods under various scenarios.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.13 no.2
• /
• pp.81-87
• /
• 2004

This paper deals with a new approach to tolerance optimization problems. Optimal tolerance allotment problems can be formulated as stochastic optimization problems. Most schemes to solve the stochastic optimization problems have been found to exhibit difficulties in multivariate integration of the probability density function. As a typical example of stochastic optimization the optimal tolerance allotment problem has the same difficulties. In this stochastic model, manufacturing system is represented by Gauss-Markov stochastic process and the manufacturing unit availability is characterized for realistic optimization modeling. The new algorithm performed robustly for a large deviation approximation. A significant reduction in computation time was observed compared to the results obtained in previous studies.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.4
• /
• pp.319-325
• /
• 2007

In case of more than 50km baseline length, the correlation between receivers is reduced. Therefore, there are still some rooms for improvement of its positional accuracy. In this paper, the stochastic modeling of the ionospheric delay is applied and its effects are analyzed. The data processing has been performed by constructing a Kalman filter with states of positions, ambiguities, and the ionospheric delays in the double differenced mode. Considering the medium or long baseline length, both double differenced GPS phase and code observations are used as observables and LAMBDA has been applied to fix the ambiguities. The ionospheric delay is stochastically modeled by well-known 1st order Gauss-Markov process. And the correlation time and variation of 1st order Gauss-Markov process are calculated. This paper gives analyzed results of developed algorithm compared with commercial software and Bernese.

• Journal of Korea Multimedia Society
• /
• v.19 no.11
• /
• pp.1829-1836
• /
• 2016

Today, the application area and scope of FANET(Flying Ad Hoc Network) has been extended. As a result, FANET related research are actively conducted, but there is no decision yet as the routing protocol for FANET. In this paper, we propose the OLSR-Pds (Prediction with direction and speed) which is added a method to predict status of link for OLSR protocol. The mobility of nodes are modeled using Gauss-Markov algorithm, and relative speed between nodes were calculated by derive equation of movement, and thereby we can predict link status. An experiment for comparing AODV, OLSR and, OLSR-Pds was conducted by three factors such as packet delivery ratio, end to end delay, and routing overhead. In experiment result, we were confirm that OLSR-Pds performance are superior in these three factors. OLSR-Pds has the disadvantage that requires time-consuming calculations for link state and required for computing resources, but we were confirm that OLSR-Pds is suitable for routing to the FANET environment because it has all the characteristics of proactive protocol and reactive protocol.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.5
• /
• pp.27-36
• /
• 2001

This paper proposes new design algorithms based on stochastic relaxation (SR) for an on-line vector quantizer (VQ) design. These proposed SR methods solve the local entrapment problems of the conventional Kohonen learning algorithm (KLA). These SR methods cover two different types depending upon the use of simulated annealing (SA) : the one that uses SA is called the OLVQ SA and the other the OLVQ SR. These methods arc combined with the KLA and therefore preserve the its convergence properties. Experimental results for Gauss Markov sources, real speech and image demonstrate that the proposed algorithms can consistently provide better codebooks than the KLA.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.4
• /
• pp.293-298
• /
• 2003

In this paper. we propose a fast search algorithm for nearest neighbor vector quantization (NNVQ). The proposed algorithm rejects those codewords which can not be the nearest codeword and reduces the search range of codebook. Hence it reduces computational time and complexity in encoding process, while it provides the same SD performance as the conventional full search algorithm. We apply the proposed algorithm to the adaptive multi-rate (AMR) speech coder and a general vector quantizer designed by LBG. algorithm. Simulation results show effectiveness of the proposed algorithm.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.6_1
• /
• pp.575-581
• /
• 2012

In general, various modeling and estimation techniques have been proposed to extract the tropospheric and ionospheric delays from the GPS CORS. In this study, Kalman filter approach is adopted to estimate the tropospheric and ionospheric delays and the proper modeling for the state vector and the variance-covariance matrix for the process noises are performed. The coordinates of reference stations and the zenith wet delays are estimated with the assumption of random walk stochastic process. Also, the first-order Gauss-Markov stochastic process is applied to compute the ionospheric effects. For the evaluation of the proposed modeling technique, Kalman filter algorithm is implemented and the numerical test is performed with the CORS data. The results show that the atmospheric effects can be estimated successfully and, as a consequence, can be used for the generation of VRS data.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.265-268
• /
• 2001

This paper proposes the strategy of noise injection into inputs in the Kohonen learning algorithm (KKA) to improve the local convergence problem of the KLA. Noise strengths are high in the begin of the learning and gradually lowered as the teaming proceeds. This strategy is a kind of stochastic relaxation (SR) method which is broadly used in the general optimization problems. It is convenient to implement and improves the convergence properties of the KLA with moderately increased computing time compared to the KLA. Experimental results for Gauss-Markov sources and real speech demonstrate that the proposed method can consistently provide better codebooks than the KLA.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.17-28
• /
• 2011

Despite the fact that the deployment of sensor networks and target tracking could both be managed by taking full advantage of Voronoi diagrams, very little few have been made in this regard. In this paper, we designed an optimized barrier coverage and an energy-efficient clustering algorithm for forming Vonoroi-based Wireless Sensor Networks(WSN) in which we proposed a mobile target tracking scheme (CTT&MAV) that takes full advantage of Voronoi-diagram boundary to improve detectability. Simulations verified that CTT&MAV outperforms random walk, random waypoint, random direction and Gauss-Markov in terms of both the average hop distance that the mobile target moved before being detected and lower sensor death rate. Moreover, we demonstrate that our results are robust as realistic sensing models and also validate our observations through extensive simulations.

• Journal of Information Processing Systems
• /
• v.2 no.2
• /
• pp.88-94
• /
• 2006

In wireless cellular networks, previous researches on admission control policies and resource allocation algorithm considered the QoS (Quality of Service) in terms of CDP (Call Dropping Probability) and CBP (Call Blocking Probability). However, since the QoS was considered only within a predetermined cell capacity, the results indicated a serious overload problem of systems not guaranteeing both CDP and CBP constraints, especially in the hotspot cell. That is why a close interrelationship between CDP, CBP and cell capacity exists. Thus, it is indispensable to consider optimal cell capacity guaranteeing multiple QoS (CDP and CBP) at the time of initial cell planning for networks deployment. In this paper, we will suggest a distributed determination scheme of optimal cell capacity guaranteeing both CDP and CBP from a long-term perspective for initial cell planning. The cell-provisioning scheme is performed by using both the two-dimensional continuous-time Markov chain and an iterative method called the Gauss-Seidel method. Finally, numerical and simulation results will demonstrate that our scheme successfully determines an optimal cell capacity guaranteeing both CDP and CBP constraints for initial cell planning.