• Title/Summary/Keyword: Time of Arrival(ToA)

Search Result 1,172, Processing Time 0.032 seconds

TDOA Based Moving Target Velocity Estimation in Sensor Network (센서네트워크 내에서 TDOA 측정치 기반의 이동 표적 속도 정보 추정)

  • Kim, Yong Hwi;Park, Min Soo;Park, Jin Bae;Yoon, Tae Sung
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.64 no.3
    • /
    • pp.445-450
    • /
    • 2015
  • In the moving target problem, the velocity information of the moving target is very important as well as the high accuracy position information. To solve this problem, active researches are being conducted recently with combine the Time Difference of Arrival (TDOA) and Frequency Delay of Arrival(FDOA) measurements. However, since the FDOA measurement is utilizing the Doppler effect due to the relative velocity between the target source and the receiver sensor, it may be difficult to use the FDOA measurement if the moving target speed is not sufficiently fast. In this paper, we propose a method for estimating the position and the velocities of the target by using only the TDOA measurements for the low speed moving target in the indoor environment with sensor network. First, the target position and heading angle are obtained from the estimated positions of two attached transmitters on the target. Then, the target angular and linear velocities are also estimated. In addtion, we apply the Instrumental Variable (IV) technique to compensate the estimation error of the estimated target velocity. In simulation, the performance of the proposed algorithm is verified.

Performance Improvement of CPSP Based TDOA Estimation Using the Preemphasis (프리엠퍼시스를 이용한 CPSP 기반의 도달시간차이 추정 성능 개선)

  • Kwon, Hong-Seok;Bae, Keun-Sung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.28 no.5
    • /
    • pp.461-470
    • /
    • 2009
  • We investigate and analyze the problems encountered in frame-based estimation of TDOA (Time Difference of Arrival) using CPSP function. Spectral leakage occurring in framing of a speech signal by a rectangular window could make estimation of CPSP spectrum inaccurate. Framing with other windows to reduce the spectral leakage distorts the signal due to the asynchronous weighting around the frame specifically both ends of the frame. These problems degrade the performance of the CPSP-based TDOA estimation. In this paper, we propose a method to alleviate those problems by pre-emphasis of the speech signal. It reduces the influence of the spectral leakage by reducing dynamic range of the spectrum of a speech signal with pre-emphasis. To validate the proposed method of pre-emphasis, we carry out TDOA estimation experiments in various noise and reverberation conditions, Experimental results have shown that the framing of pre-emphasized microphone output by a rectangular window achieves higher success rate of TDOA estimation than any other framing methods.

Performance Analysis of a Congestion cControl Mechanism Based on Active-WRED Under Multi-classes Traffic (멀티클래스 서비스 환경에서 Active-WRED 기반의 혼잡 제어 메커니즘 및 성능 분석)

  • Kim, Hyun-Jong;Kim, Jong-Chan;Choi, Seong-Gon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.5
    • /
    • pp.125-133
    • /
    • 2008
  • In this paper, we propose active queue management mechanism (Active-WRED) to guarantee quality of the high priority service class in multi-class traffic service environment. In congestion situation, this mechanism increases drop probability of low priority traffic and reduces the drop probability of the high priority traffic, therefore it can improve the quality of the high priority service. In order to analyze the performance of our mechanism we introduce the stochastic analysis of a discrete-time queueing systems for the performance evaluation of the Active Queue Management (AQM) based congestion control mechanism called Weighted Random Early Detection (WRED) using a two-state Markov-Modulated Bernoulli arrival process (MMBP-2) as the traffic source. A two-dimensional discrete-time Harkov chain is introduced to model the Active-WRED mechanism for two traffic classes (Guaranteed Service and Best Effort Service) where each dimension corresponds to a traffic class with its own parameters.

A Study on the Detection of Small Cavity Located in the Hard Rock by Crosswell Seismic Survey (경암 내 소규모 공동 탐지를 위한 시추공간 탄성파탐사 기법의 적용성 연구)

  • Ko, Kwang-Beom;Lee, Doo-Sung
    • Geophysics and Geophysical Exploration
    • /
    • v.6 no.2
    • /
    • pp.57-63
    • /
    • 2003
  • For the dectection of small cavity in the hard rock, we investigated the feasibility of crosswell travel-time tomography and Kirchhoff migration technique. In travel-time tomography, first arrival anomaly caused by small cavity was investigated by numerical modeling based on the knowledge of actual field information. First arrival delay was very small (<0.125 msec) and detectable receiver offset range was limited to 4m with respect to $1\%$ normalized first arrival anomaly. As a consequence, it was turned out that carefully designed survey array with both sufficient narrow spatial spacing and temporal (<0.03125 msec) sampling were required for small cavity detection. Also, crosswell Kirchhoff migration technique was investigated with both numerical and real data. Stack section obtained by numerical data shows the good cavity image. In crosswell seismic data, various unwanted seismic events such as direct wave and various mode converted waves were alto recorded. To remove these noises und to enhance the diffraction signal, combination of median and bandpass filtering was applied and prestack and stacked migration images were created. From this, we viewed the crosswell migration technique as one of the adoptable method for small cavity detection.

Numerical Analysis of an Enhanced Time-Based Location Registration Method (이동통신망에서의 향상된 시간 기반 위치 갱신 방법의 성능 분석)

  • Goo Yeon, Lee;Yong, Lee
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.11
    • /
    • pp.47-55
    • /
    • 2004
  • In this paper, an enhanced time-based registration method is proposed. The method reduces the registration cost when a mobile terminal stays in a cell for a long time. We also analyze the performance of the proposed method numerically. In the analysis, we assume Poisson call arrival distribution and exponential cell resident time. From the analysis we calculate the optimal time-interval. Additionally, limit cost analysis is made to investigate the behaviors in the limit conditions. To compare the performance of the proposed method with the original time-based registration method, we analyze the performance of the original time-based registration method. In the comparisons, we see that the proposed enhanced time-based registration method has better performance and is applicable to the PCS systems.

Incentive-Compatible Priority Pricing and Transfer Analysis in Database Services

  • Kim, Yong J.
    • The Journal of Information Technology and Database
    • /
    • v.4 no.2
    • /
    • pp.21-32
    • /
    • 1998
  • A primary concern of physical database design has been efficient retrieval and update of a record because predictable performance of a DBMS is indispensable to time-critical missions. To maintain such phenomenal performance, database manages often spends more than or as much as the goal of an organization can warrant. The motivation of this research stems from the fact that even predictable performance of a physical database can be hampered by stochastic query processing time, physical configurations of a database, and random arrival processes of queries. They all together affect the overall performance of a DBMS. In particular, if there are queuing delays due to limited capacity or during on-peak congestion, this paper suggest to prioritize database services. A surprising finding of this paper is that such a transition from a non-priority system to a corresponding priority-based system can be Pareto-improving in the sense that no users in the system will be worse off after the transition. Thus prioritizing database services can be a viable option for efficient database management.

  • PDF

DESIGN OF OPERATOR FOR SEARCHING TRAFFIC DEPENDENT SHORTEST PATH IN A ROAD NETWORK

  • Lee Dong Gyu;Lee Yang Koo;Jung Young Jin;Ryu Keun Ho
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.759-762
    • /
    • 2005
  • Recently, Intelligent Transportation System(ITS) has been applied to satisfy increasing traffic demand every year and to solve many traffic problems. Especially, Advanced Traveller Information System(ATIS) is a transportation system to optimize the trip of each other vehicle. It is important to provide the driver with quick and comfortable path from source to destination. However, it is difficult to provide a shortest path in a road network with dynamic cost. Because the existing research has a static cost. Therefore, in this paper we propose an operator for searching traffic dependent shortest path. The proposed operator finds the shortest path from source to destination using a current time cost and a difference cost of past time cost. Such a method can be applied to the road status with time. Also, we can expect a predicted arrival time as well as the shortest path from source to destination. It can be applied to efficiently application service as ITS and have the advantages of using the road efficiently, reducing the distribution cost, preparing an emergency quickly, reducing the trip time, and reducing an environmental pollution owing to the saving the fuel.

  • PDF

A Time Tree Scheduling Scheme for Energy Efficiency and Collision Avoidance in Sensor Networks (센서 네트워크에서 에너지 효율과 충돌 회피를 위한 타임 트리 스케줄링)

  • Lee, Kil-Hung
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.7
    • /
    • pp.962-970
    • /
    • 2009
  • This paper presents a data gathering and scheduling scheme for wireless sensor networks. We use a data gathering tree for sending the data from the sensor node to the base station. For an energy efficient operation of the sensor networks in a distributed manner, a time tree is built in order to reduce the collision probability and to minimize the total energy required to send data to the base station. A time tree is a data gathering tree where the base station is the root and each sensor node is either a relaying or a leaf node of the tree. Each tree operates in a different time schedule with possible different activation rate. Through the simulation, we found that the proposed scheme that uses time trees shows better characteristics in energy and data arrival rate when compared with other schemes such as SMAC and DMAC.

  • PDF

The Direction Finding Error of TDOA Method According to the Antenna Arrangement (안테나 배치에 따른 TDOA 방식의 방위탐지 오차)

  • Lim, Joong-Soo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.11
    • /
    • pp.4503-4508
    • /
    • 2010
  • A direction finding(DF) technology of a signal is very important for electronic warfare and has studied for a long time. The method of TDOA(time difference of arrival) is one of good DF methods in this time, and that is to receive an emitter signal with two antennas, to measure the time difference of a signal at two antennas, and converse the time difference to direction of the signal. For small DF error, high time resolution receiver and long baseline are needed. In this paper we suggest a good baseline with adaptive antenna arrangement into 10m*10m area.

On the Analysis of Transportation Process of Pusan Port (시뮬레이션에 의한 부산항만 운송과정의 분석에 관하여)

  • 박계각
    • Journal of the Korean Institute of Navigation
    • /
    • v.10 no.1
    • /
    • pp.101-127
    • /
    • 1986
  • Transportation provides an infrastructure vital to economic growth, and it is an integral part of production . As a port is the interface between the maritime transport and domestic transport sectors, it certainly plays a key role in any economic development. Therefore, it is doubtless that inadequacy of a nation's port will depress the level of throughput, to the level where it fails to meet the target set by the national economic planning schemes. Korea is surrounded by the seas and the economic structure of Korea consists of processing trades, so that it cannot be overstated that substantial economy in maritime transport coasts can be achieved through the improvement of the port transport system. This paper treats the transportation process in Pusan Port by Queueing Simulation method, and the reasonable size of Pusan Port is suggested from the point of view of efficiency maximization. The results of the analysis are summarized as follows; 1) the utility rate is 47.91 percents in general piers, 85-52 percents in container piers, and waiting time 5.2hrs, in general piers, 0.8 hrs, in container piers, and the probability of maximum queue length 12 ships in general piers, 2 ships in container piers, and the probability of waiting is 44 percents in general piers, 8 percents in container pier. 2) in general piers, the improvement of app. 30 percents in port capacity is desirable for operating effectively concerning the current arrival rate. By introducing the traffic control ion container piers, there is no apparent necessity of port investment, but I is expected to reduce invisible congestion occurred along the waiting line. 3) On Pusan Port, the optimal utility rate and the optimal arrival rate for reducing waiting time are 3.5 to 4.0(hrs./ship) in general piers, 5.1 to 6.0(hrs./ship) in container piers.

  • PDF