• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.1
• /
• pp.83-93
• /
• 1996

In this research, we concentrate on the effects of dependencies in arrival processes on queueing measures. In particular, we use a specific form of arrival process which has the advantage of allowing us to change dependency properties without at the same time changing one dimensional distributional conditions. It is shown that the mean queue length can be made arbitrarily large with the same interarrival distributions and the same service time distributions with fixed smaller than one traffic intensity.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.3
• /
• pp.119-135
• /
• 2005

Design of location erea(LA) in a cellular network is to partition the network into clusters of cells so as to minimize the cost of location updating and paging. Most research works dealing with the LA design problem assume that the call. arrival rate and mobile flow rate are fixed parameters which can be estimated independently. In this aspect, most Problems addressed so far are deterministic LA design problems(DLADP), known to be NP hard. The mobile flow and call arrival rate are, however, varying with time and should be treated simultaneously because the call arrival rate in a cell during a day is influenced by the change of a population size of the cell. This Paper Presents a new model on IA design problems considering the time-dependent call arrival and mobile flow rate. The new model becomes a stochastic LA design problem(SLADP) because It takes into account the possibility of paging waiting and blocking caused by the changing call arrival rate and finite paging capacity. Un order to obtain the optimal solution of the LA design problem, the SIADP is transformed Into the DLADP by introducing the utilization factor of paging channels and the problem is solved iteratively until the required paging quality is satisfied. Finally, an illustrative example reflecting the metropolitan area, Seoul, is provided and the optimal partitions of a cell structure are presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1128-1135
• /
• 2010

A wireless positioning system using ultra-wideband (UWB) for indoor wireless positioning uses ranging data in order to accurately estimate location. Commonly, ranging uses time of arrival (TOA), time difference of arrival (TDOA) based on arrival time. The most fundamental issue in the ranging for wireless positioning is to obtain clock synchronization among the sensor nodes and to correct an error caused by the relative clock offset from each node. In this paper, we propose ranging and positioning technique using common clock in order to solve both clock synchronization and clock offset problems. To verify the performance of proposed, we simulated ranging and positioning in channel model introduced by IEEE 802.15.4a Task Group and then results show that location estimation is unaffected by clock offset.

• Phonetics and Speech Sciences
• /
• v.3 no.3
• /
• pp.109-114
• /
• 2011

To estimate sound direction of arrival with a pair of microphones, a method based on Time Difference of Arrival (TDOA) estimation using the Cross Power Spectrum Phase (CPSP) function is largely used due to its simplicity and good performance. In this paper, we investigate CPSP maximum values for various SNRs and adverse environments, and propose a novel method to improve the estimation performance of sound direction of arrival. The proposed method applies a threshold to the CPSP values and increases the reliability of the estimated sound direction. Through computer simulation for various SNRs, we validate the effectiveness of the proposed method. When the threshold was set to 0.1, more than 90% of success rate of sound direction of arrival estimation has been achieved for directions of $10^{\circ}$, $40^{\circ}$, $70^{\circ}$ from the source location even with reverberation times of 0.1s.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.147-152
• /
• 2012

This paper estimates the direction of arrival of desired a target using propagation wave in spatial. Direction of arrival estimation is to find desired target position among received signal to receiver array antennas. In this paper, we estimated direction of arrival for target, by using cost function and high resolution MUSIC algorithm, in order to direction of arrival estimation, and calculated optimum weight vector. Through simulation, in regard to the estimation of the arrival direction of a target, the performances of the existing ESPRIT algorithm and the proposed algorithm were comparatively analyzed. In the estimation time of the arrival direction of a target object, the proposed algorithm showed an improvement of approximately as compared to the existing ESPRIT algorithm.

• The Korean Journal of Food & Health Convergence
• /
• v.8 no.6
• /
• pp.11-17
• /
• 2022

Emergency transport is directly related to the life of the patient, and rapid transport to the hospital is crucial. However, external environmental factors such as traffic or weather, interfere with hospital transport. In this study, we investigated the external environment affecting hospital transport time. We examined the transfer time and patient treatment time of emergency patients in an area of northern Gyeonggi-do from 2018 to 2020. Diagnosis after arrival at the hospital was used, and on-site treatment time was measured from paramedic arrival time at the scene to departure. Furthermore, we examined whether there was a correlation between the time paramedics left the scene and hospital arrival time through the reason for the delay as recorded in the emergency log. Traffic jams had the greatest impact on patient transport, while transport delays occurred due to heavy rain, but not snow. Among injured patients, electrical accidents were the most problematic in terms of on-site treatment time. This was because a lot of first aid is needed in electrical accidents. It must be necessary to mobilize two ambulances in an emergency through the expansion of infrastructure, prepare a plan for rapid transport in heavy rain, and implement strong laws against transport obstruction.

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.879-890
• /
• 2002

In this paper we consider open queueing system with a Poisson arrival process which have a finite upper bound on the arrival rate for which the system is stable. Interpolation approximations for quantities of interest, such as moments of the sojourn time distribution, have previously been developed for such systems, utilizing exact light and heavy traffic limits. These limits cannot always be easily computed for complex systems. Thus we consider an interpolation approximation where all of the relevant information is estimated via simulation. We show that all the relevant information can in fact be simultaneously estimated in a single regenerative simulation at any arrival rate. In addition to light and heavy traffic limits, both the quantity of interest and its derivative (with respect to the arrival rate) are estimated at the arrival rate of the simulation. All of the estimates are then combined, using a least squares procedure, to provide an interpolation approximation.

• Journal of Advanced Marine Engineering and Technology
• /
• v.41 no.1
• /
• pp.111-117
• /
• 2017

The arrival time of rescue ships is very important in the event of distress. This paper presents the development of experimental data to calculate the arrival time of rescue ships. The ship's traffic probability distribution was used. Mokpo Port was selected as the area of study, and AIS data for a 1 year period were used. For the ship's traffic probability distribution, a gateline was established. The lateral range distribution was calculated and fitted to the normal distribution and two Gaussian mixture distributions (GMD2), and each parameter was extracted. After the locations of ${\mu}$, ${\mu}{\pm}1{\sigma}$ of the normal distribution and ${\mu}_1$ of the two Gaussian mixture distribution(GMD2) were set as waypoints, the location and probability were determined. A scenario was established in relation to each type of parameter. Thus, the arrival time can be calculated.

• ETRI Journal
• /
• v.34 no.2
• /
• pp.260-263
• /
• 2012

In this letter, we propose a moving-target tracking algorithm based on a particle filter that uses the time difference of arrival (TDOA)/frequency difference of arrival (FDOA) measurements acquired by distributed sensors. It is shown that the performance of the proposed algorithm, based on the particle filter, outperforms the one based on the extended Kalman filter. The use of both the TDOA and FDOA measurements is shown to be effective in the moving-target tracking. It is proven that the particle filter deals with the nonlinear nature of the movingtarget tracking problem successfully.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8A
• /
• pp.1163-1168
• /
• 1999

This paper proposes a wireless positioning method using the CDMA mobile communicaton network. The proposed method is time-based positioning method that uses mobile-station arrival time of forward link signal from base-stations. In this mehtod there are TDOA and TOA methods that use time-difference-of-arrival and time-of-arrival, respectively. Error characteristics and implementation simplicity of the two methods are compared and analyzed each other. As a results, it showed that TDOA has advantage of less sensitivity to the time error compared to TOA but has disadantage of more sensitivity to the spatial error. Also, from architecture of the CDMA system that is time synchronized to only active base-station it is analyzed that adoption of TDOA method is more advantageous than TOA because time difference of signal arrival from the neighbor base-stations against the active base-station can be measured more easily. Therefore, conclusion is made that TDOA is beat suit to the time-based positioning method for the present CDMA mobile communication networkgorithm performs block-by-block coherent decoding with the aid of pilot symbols. It is shown that the complexity of the algorithm grows linearly as a function of sequence length. The performance of the algorithm is shown to better than that of the conventional pilot symbol aided (PSI) algorithm. Simulation results are presented to assess the performance of the algorithm and the results are compared with that of the conventional PSI alforithm.