• 대한전자공학회논문지
• /
• 제24권1호
• /
• pp.52-59
• /
• 1987

A new on-line estimation algorithm for a time varying time delay is proposed. This algorithm is based on the concept of minimization of prediction error. As only the parameters directly related to the poles and zeros of the process are estimated in the algorithm, persistently exciting condition for the convergence of parameters can be less restrictive. Under some assumptions which is necessary in adaptive control, it is shown that this algorithm estimates time varying time delay accurately. In view of computational burden, this algorithm needs far less amount of calculations than other methods. The larger the time delay is, the more effective this algorithm is . Computer simulation shows good properties of the algorithm. This algorithm can be used effectively in adaptive control of large dead time processes.

• 전기학회논문지
• /
• 제67권3호
• /
• pp.433-439
• /
• 2018

In this paper, a SDINS(strapdown inertial navigation system) rapid initial alignment technique with adaptive time delay compensation is proposed. The proposed method consists of two steps. In first step, misalignment and data latency are estimated by conducting pre-transfer alignment. Then, hybrid alignment is designed to rapidly find the misalignment changes induced by pyro-shock. To improve the performance of hybrid alignment, adaptive time delay compensation method is suggested. We verify the performance improvement of the proposed alignment scheme comparing with the conventional transfer alignment method by van test. The test result shows that the proposed alignment technique improves alignment performance.

• 한국통신학회논문지
• /
• 제32권3A호
• /
• pp.261-270
• /
• 2007

실시간과 비실시간 서비스 클래스의 각 QoS요구 사항을 만족하면서 전체 시스템 용량을 최대화하기 위하여 DTPQ스케줄링 알고리즘이 제안된 바 있다. 기존 DTPQ방식은 개별 서비스 클래스의 QoS를 만족하면서 전체 시스템의 평균 수율을 극대화하기 위해 실시간 서비스의 HOL 패킷의 지연 시간이 정해진 임계값을 넘는 경우에만 서비스하는 접근으로서, 이를 구현하기 위해서는 주어진 환경에서 적절한 지연 임계값을 설정할 수 있어야 한다. 본 논문에서는 실시간 사용자의 채널 상태와 지연 시간에 따라 지연 임계값을 적응적으로 적용하는 A-DTPQ 기반의 스케줄링 기법을 제안한다. 이는 기존의 DTPQ알고리즘과 달리 트래픽 부하 및 채널 특성 등에 따라 지연 임계값을 적응적으로 결정하는 방식이다. 시스템 레벨 시뮬레이션을 통해 제안 방식의 고정된 최적 임계값을 가지는 DTPQ방식보다 성능이 향상시킬 수 있음을 확인하였으며, 향후 연구에서는 다양한 서비스 클래스에 대해 이와 같은 개념을 일반화할 수 있을 것이다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3551-3567
• /
• 2016

The Low Earth Orbit satellite network has the unique characteristics of the non-uniform and time-variant traffic load distribution, which often causes severe link congestion and thus results in poor performance for delay-sensitive flows, especially when the network is heavily loaded. To solve this problem, a novel adaptive routing algorithm, referred to as the delay-oriented adaptive routing algorithm (DOAR), is proposed. Different from current reactive schemes, DOAR employs Destination-Sequenced Distance-Vector (DSDV) routing algorithm, which is a proactive scheme. DSDV is extended to a multipath QoS version to generate alternative routes in active with real-time delay metric, which leads to two significant advantages. First, the flows can be timely and accurately detected for route adjustment. Second, it enables fast, flexible, and optimized QoS matching between the alternative routes and adjustment requiring flows and meanwhile avoids delay growth caused by increased hop number and diffused congestion range. In addition, a retrospective route adjustment requesting scheme is designed in DOAR to enlarge the alternative routes set in the severe congestion state in a large area. Simulation result suggests that DOAR performs better than typical adaptive routing algorithms in terms of the throughput and the delay in a variety of traffic intensity.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 합동 추계학술대회 논문집 정보 및 제어부문
• /
• pp.150-153
• /
• 2002

When a system is teleoperated in the indoor environment through the wireless LAN, we must consider the communication time delay. The time delay is random and unbounded due to the inherent characteristic and surrounding environment. As result of this, the stability and performance of the teleoperated system is degraded. In this paper, we present the adaptive control algorithm to overcome this problem by measuring time delay and allocating task corresponding to time delay dynamically. And the simple experiment is conducted to demonstrate the feasibility.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권7호
• /
• pp.3057-3075
• /
• 2020

End-to-end network delay plays an vital role in distributed services. This delay is used to measure QoS (Quality-of-Service). It would be beneficial to know all node-pair delay information, but unfortunately it is not feasible in practice because the use of active probing will cause a quadratic growth in overhead. Alternatively, using the measured network delay to estimate the unknown network delay is an economical method. In this paper, we adopt the state-of-the-art matrix completion technology to better estimate the network delay from limited measurements. Although the number of measurements required for an exact matrix completion is theoretically bounded, it is practically less helpful. Therefore, we propose an online adaptive sampling algorithm to measure network delay in which statistical leverage scores are used to select potential matrix elements. The basic principle behind is to sample the elements with larger leverage scores to keep the traits of important rows or columns in the matrix. The amount of samples is adaptively decided by a proposed stopping condition. Simulation results based on real delay matrix show that compared with the traditional sampling algorithm, our proposed sampling algorithm can provide better performance (smaller estimation error and less convergence pressure) at a lower cost (fewer samples and shorter processing time).

• 전자공학회논문지B
• /
• 제31B권7호
• /
• pp.33-41
• /
• 1994

A single channel adaptive noise canceling (ANC) technique with a recursive time delay estimator (RTDE) is presented for removing effects of additive noise on the speech signal. While the conventional method makes a reference signal for the adaptive filter using the pitch estimated on a frame basis from the input speech, the proposed method makes the reference signal using the delay estimated recursively on a sample-by-sample basis. As the RTDEs, the recursion formulae of autocorrelation function (ACF) and average magnitude difference function (AMDF) are derived. The normalized least mean square (NLMS) and recursive least square (RLS) algorithms are applied for adaptation of filter coefficients. Experimental results with noisy speech demonstrate that the proposed method improves the perceived speech quality as well as the signal-to-noise ratio and cepstral distance when compared with the conventional method.

• Journal of Communications and Networks
• /
• 제8권2호
• /
• pp.234-240
• /
• 2006

We study the dynamic burst assembly based on traffic prediction and offset and delay differentiation in optical burst switching network. To improve existing burst assembly mechanism and build an adaptive flexible optical burst switching network, an approach called quality of service (QoS) based adaptive dynamic assembly (QADA) is proposed in this paper. QADA method takes into account current arrival traffic in prediction time adequately and performs adaptive dynamic assembly in limited burst assembly time (BAT) range. By the simulation of burst length error, the QADA method is proved better than the existing method and can achieve the small enough predictive error for real scenarios. Then the different dynamic ranges of BAT for four traffic classes are introduced to make delay differentiation. According to the limitation of BAT range, the burst assembly is classified into one-dimension limit and two-dimension limit. We draw a comparison between one-dimension and two-dimension limit with different prediction time under QoS based offset time and find that the one-dimensional approach offers better network performance, while the two-dimensional approach provides strict inter-class differentiation. Furthermore, the final simulation results in our network condition show that QADA can execute adaptive flexible burst assembly with dynamic BAT and achieve a latency reduction, delay fairness, and offset time QoS guarantee for different traffic classes.

• 융합보안논문지
• /
• 제7권2호
• /
• pp.17-25
• /
• 2007

본 논문에서는 차세대 패킷 네트워크에서의 서비스 품질 기능 고도화를 목적으로 상대적 지연 차별화 기능을 제공하는 알고리듬을 제시하고 시뮬레이션을 통해 성능 분석을 수행한다. 또한, 제안된 알고리듬을 XPC 860 CPU 기반의 시험 보드상에서 VHDL로 구현하여 실제 트래픽 입력 상황하에서의 성능 분석을 수행한다. 제안된 알고리듬은 매 시간 구간마다 입력되는 트래픽을 측정하고 이를 기반으로 다음 시간 구간 동안 입력될 트래픽의 양을 예측한 후 실제로 다음 시간 구간 동안에 입력된 트래픽과 비교하여 오차분을 도출하여 이를 다음 타임 슬롯의 지연 차별화 동작에 지속적으로 반영하는 것이 특징적 요소이므로 오차분을 고려하지 않는 기존 방식에 비해 버스트 트래픽에 대하여 우수한 적응성을 보여준다. 제안된 방식의 성능은 시뮬레이션과 실제 보드상에서의 시험을 통해 절대적 지연 목표를 충족시킴과 동시에 기존 방식에 비해 버스트 트래픽에 대하여 성능 개선 효과가 달성됨이 확인된다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.895-897
• /
• 1988

This paper is concerned with linear system containing time delay in model reference adaptive control. An algorithm is developed using Lyapunov second method and properties of strictly positive real function.