• Journal of Communications and Networks
• /
• v.15 no.5
• /
• pp.514-526
• /
• 2013

With a long sensing period, the inter-frame spectrum sensing in IEEE 802.22 standard is vulnerable to the effect of the traffic of the primary user (PU). In this article, we address the two degrading factors that affect the inter-frame sensing performance with respect to the random arrival/leaving of the PU traffic. They are the noise-only samples under the random arrival traffic, and the PU-signal-contained samples under the random leaving traffic. We propose the model in which the intra-frame sensing cooperates with the inter-frame one, and the inter-frame sensing uses the time-of-arrival (ToA), and time-of-leave (ToL) detectors to reduce the two degrading factors in the inter-frame sensing time. These ToA and ToL detectors are used to search for the sample which contains either the ToA or ToL of the PU traffic, respectively, which allows the partial cancelation of the unnecessary samples. At the final stage, the remaining samples are input into a primary user detector, which is based on the energy detection scheme, to determine the status of PU traffic in the inter-frame sensing time. The analysis and the simulation results show that the proposed scheme enhances the spectrum-sensing performance compared to the conventional counter-part.

• Journal of Korean Institute of Industrial Engineers
• /
• v.42 no.1
• /
• pp.30-37
• /
• 2016

A multi-server queueing system with an infinite buffer and impatient customers is analyzed. The system operates in the finite state Markovian random environment. The number of available servers, the parameters of the batch Markovian arrival process, the rate of customers' service, and the impatience intensity depend on the current state of the random environment and immediately change their values at the moments of jumps of the random environment. Dynamics of the system is described by the multi-dimensional asymptotically quasi-Toeplitz Markov chain. The ergodicity condition is derived. The main performance measures of the system are calculated. Numerical results are presented.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.2
• /
• pp.231-245
• /
• 1996

Semiconductor manufacturing line includes several batch processes which are to be controlled effectively to enhance the productivity of the line. The key problem in batch processes is a dynamic batch sizing problem which determines number of lots processed simultaneously in a single botch. The batch sizing problem in semiconductor manufacturing has to consider delay of lots, setup cost of the process, machine utilization and so on. However, an optimal solution cannot be attainable due to dynamic arrival pattern of lots, and difficulties in forecasting future arrival times of lots of the process. This paper proposes an efficient batch sizing heuristic, which considers delay cost, setup cost, and effect of the forecast errors in determining the botch size dynamically. Extensive numerical experiments through simulation are carried out to investigate the effectiveness of the proposed heuristic in four key performance criteria: average delay, variance of delay, overage lot size and total cost. The results show that the proposed heuristic works effectively and efficiently.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1B
• /
• pp.50-58
• /
• 2012

The objective of this study is to develop the theoretical model of the telecommunication system service availability from the user perspective. We assume non-homogeneous Poisson process for the call arrival process and continuous time Markov chain for the system state. The proposed model effectively describes the user model of the user-perceived service reliability by including the time-varying call arrival rate. We also include the operational failure state where the user cannot receive any service even though the system is functioning.

• Journal of the Korea Society for Simulation
• /
• v.24 no.3
• /
• pp.27-35
• /
• 2015

We analyze an M/G/1/K queueing system with queue-length dependent service and arrival rates. There are a single server and a buffer with finite capacity K including a customer in service. The customers are served by a first-come-first-service basis. We put two thresholds $L_1$ and $L_2$($${\geq_-}L_1$$ ) on the buffer. If the queue length at the service initiation epoch is less than the threshold $L_1$, the service time of customers follows $S_1$ with a mean of ${\mu}_1$ and the arrival of customers follows a Poisson process with a rate of ${\lambda}_1$. When the queue length at the service initiation epoch is equal to or greater than $L_1$ and less than $L_2$, the service time is changed to $S_2$ with a mean of $${\mu}_2{\geq_-}{\mu}_1$$. The arrival rate is still ${\lambda}_1$. Finally, if the queue length at the service initiation epoch is greater than $L_2$, the arrival rate of customers are also changed to a value of $${\lambda}_2({\leq_-}{\lambda}_1)$$ and the mean of the service times is ${\mu}_2$. By using the embedded Markov chain method, we derive queue length distribution at departure epochs. We also obtain the queue length distribution at an arbitrary time by the supplementary variable method. Finally, performance measures such as loss probability and mean waiting time are presented.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.2
• /
• pp.137-144
• /
• 2009

This paper deals with the performance comparison of jammer signal's angle spreading in the beamforming after the estimation of direction of arrival using 3D array antenna basis of the GPS signal. After the estimation of direction of arrival using array antenna, the beamforming is need for the direction of arrival by spatial filtering and the other direction are nulling for reducing intererence signal, it is possible to improving the received signal strength and quality. But we obtains the degraded performance by the angle spreading due to the multi-jammer signal in this process. In this paper, the MUSIC and LCMV algorithms are applied for the estimating the direction of arrival and for beamforming using the 5 types of 3D array antenna. we performs the comparison of performance by calculating the bit error rate applying the BPSK modem and the varying the azimuth and elevation angle of incoming jammer signal. As a result of simulation, the Curved (B) type 3D array antenna has a more better performance compared to the other type antenna.

• The Journal of the Acoustical Society of Korea
• /
• v.36 no.6
• /
• pp.378-386
• /
• 2017

Accurate distance measurement between maneuver target in underwater and measuring devices is required to perform quantitative test evaluation in marine weapons system R&D process. In general, the target distance is measured using a one-way ToA (Time of Arrival) method that calculates the time difference between transmitted and received signals from the two accurately synchronized devices. However, the distance estimation performance is degraded because of the multi-path environments. In this paper, the time-variant transfer function of complex underwater environment is estimated from each received data frame using RBD (Ray-based Blind Deconvolution), and the estimated time-variant transfer function is then used to get rid of the effect about complex underwater environment and to recover the data signal using PTRM (Passive Time Reversal Mirror). The result from the simulation and experimental data show that the suggested method improve the distance estimation performance when comparing with the conventional ToA method.

• Geophysics and Geophysical Exploration
• /
• v.10 no.2
• /
• pp.131-137
• /
• 2007

With consideration of the first arrival picking methodology and inherent errors in picking process, I propose, from the computerization point of view, a practical algorithm for picking and error computation. The proposed picking procedure consists of 2-step; 1) picking the first coherent peak or trough events, 2) derive a line which approximates the record in the interval prior to the pick, and set the intercept time of the line as the first break. The length of fitting interval used in experiment, is few samples less than 1/4 width of the arriving wavelet. A quantitative measure of the error involved in first arrival picking is defined as the time length that needed to determine if an event is the first arrival or not. The time length is expressed as a function of frequency bandwidth of the signal and the S/N ratio. For 3 sets of cross-well seismic data, first breaks are picked twice, by manually, and by the proposed method. And at the same time, the error bound for each trace is computed. Experiment results show that good performance of the proposed picking method, and the usefulness of the quantitative error measure in pick-quality evaluation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.3
• /
• pp.47-61
• /
• 1996

An ATM switch must deal with various kinds of input sources having different traffic characteristics and it must guarantee very small value of cel loss probability, about 10$^{8}$ -10$^{12}$ , to deal with loss-sensitive traffics. In order to estimate such a rate event probability with simulation procedure, a variance reduction technique is essential for obtaining an appropriate level of precision with reduced cost. In this paper, we propose a hybrid simulation technique to achieve reduction of variance of cell loss probability estimator, where hybrid means the combination of analytical method and simulation procedure. A discrete time queueing model with multiple input sources and a finite shared buffer is considered, where the arrival process at an input source and a finite shared buffer is considered, where the arrival process at an input source is governed by an Interrupted Bernoulli Process and the service rate is constant. We deal with heterogeneous input sources as well as homogeneous case. The performance of the proposed hybrid simulation estimator is compared with those of the raw simulation estimator and the importance sampling estimator in terms of variance reduction ratios.

• Journal of the Korea Society for Simulation
• /
• v.16 no.2
• /
• pp.75-81
• /
• 2007

Previous queue inference has been studied with some limits. Larson's inference engine, which is the basis for this paper, also processed with basic assumption that arrival process is poisson process. Our inference method, which relaxes the poisson process assumption, must be a useful tool for looking into unobservable inside of queueing systems, as well as calculating accurate system performance. This paper employs these inference methods and proves the validity. Then we apply this method to system analysis for more complicated models. At first, we suggest methods to system with known number of servers, then expand to unknown number of servers. For validating our inference approach, we run some simulation models and compare true values with our results.