• Title/Summary/Keyword: Random delay

Search Result 294, Processing Time 0.026 seconds

Intelligent Controller for Networked Control Systems with Time-delay (시간지연을 갖는 네트워크 제어 시스템의 지능형 제어기 설계)

  • Bae, Gi-Sun;Joo, Young-Hoon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.2
    • /
    • pp.139-144
    • /
    • 2011
  • We consider the stabilization problem for a class of networked control systems with random delays in the discrete-time domain. The controller-to-actuator and sensor-to-controller time-delays are modeled as two Markov chains, and the resulting closed-loop systems are Markovian jump nonlinear systems with two modes. The T-S (Takagi-Sugeno) fuzzy model is employed to represent a nonlinear system with Markovian jump parameters. The aim is to design a fuzzy controller such that the closed-loop Markovian jump fuzzy system is stochastically stable. The necessary and sufficient conditions on the existence of stabilizing fuzzy controllers are established in terms of LMIs (Linear Matrix Inequalities). It is shown that fuzzy controller gains are mode-dependent. Finally, a simulation example is presented to illustrate the effectiveness of the proposed design method.

Performance evaluation of a multiple-access algorithm for PCN in microcell environment (마이크로셀 환경에서 개인휴대통신을 위한 다중접속 알고리즘의 성능 평가)

  • 전영희;이재형;최형진
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.7
    • /
    • pp.55-63
    • /
    • 1996
  • In this paper, a multiple-access algorithm for PCN is proposed. The proposed algorithm provides th integrated service of information soruces and can be operated stably in high load state. Given bandwidth is efficiently used for it in the microcell environment. And system performance can be improved through the statistical-multiplexing technque. In order to process the speech signal usually requiring real-tiem processing, we adopt a random access of AlOHA type for th ebasic protocol sturcture and assume the form of ALOHA-reservation. We have analyzed the performance of the proposed algorithm through system throughput and packet delay in the microcell environment.

  • PDF

Wavelength Assignment Algorithms fora Multihop Lightwave Network

  • Seo, Jun-Bae;Seo, Hyun-Hwa;Lee, Hyong-Woo;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.6B
    • /
    • pp.523-532
    • /
    • 2003
  • GENMET(GEneralized Multihop Network) which is based on Wavelength-Division Multiplexsing(WDM) and can be used in order to construct the next generation lightwave network is a logical(virtual), packet-switched and multihop topology network. GENMET is a regular multihop network which is a generalization of Shuffle network and do Bruijn network As such, it has the advantage of simple routing which is critical in a high speed network Given a physical topology, different logical topologies can be derived for assigning wavelengths to the UserNodes. By appropriately assigning wavelengths, performance of the network, such as mean hop count, maximum throughput and mean packet delay can be improved. In this paper, we propose heuristic algorithms for effectively assigning a limited number of wavelengths to the given UserNodes. The Performance of proposed algorithm is compared with the random assignment and the lower bounds.

A Study on 2-Dimensional Sound Source Tracking System IV - Mainly on Approximation of the Relative Bearing and Distance - (2차원적 음원추적에 관한 연구IV -음원위치의 근사적 결정법을 중심으로 -)

  • 문성배;전승환
    • Journal of the Korean Institute of Navigation
    • /
    • v.25 no.4
    • /
    • pp.371-379
    • /
    • 2001
  • We have reported the new measurement system which was substituted digital filter for the analog filter in order to develop the optimal system that could find the time delay between each sensors with high accuracy. And also we have confirmed through the experiments that the accuracy of measurements were differentiated by the methods what kind of digital filter had been adopted. This paper suggests two algorithms which approximate the sound source's bearing and distance. One is that sound source's relative bearing can be approximately regarded as the gradient of hyperbolic asymptote, the other is that the source's range can be approximated under the condition of a long range source relative to the sensor's interval. And a series of experiments were carried out with the source's distance 22.42meters and the random bearing interval within the limits of $-90^{\circ}$~$+90^{\circ}$. As a result, we have recognized that the approximation methods could measure the bearing and distance with higher accuracy than the method using trigonometric relation could do.

  • PDF

Performance analysis of OFDM on the multi-path fading channel (다경로 페이딩 채널에서 OFDM의 성능분석)

  • 정영모;이상욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.11
    • /
    • pp.2923-2931
    • /
    • 1996
  • In this paper, the symbol error probability for orthogonal frequency division multiplexing (OFDM) in the multipath fading environment is obtained analytically. In the analysis, OFDM signals with and without the guard interval are considered, and the two-ray fading model is used for the multi-path fading channel. From the analysis results, it is found that the adjacent subchannel interfernce increases the symbol error rate when the guard interval is not employed or shorter than the length of the delay. It is also shown that the adjacent subchannel interference is a Gaussian random variable and its variance depends on the subchannel location and the number of subchannels. Finally, it is found that the variance of the subchannel interference also increases as the power of the signal increases for the OFDM with insufficient guard interval, yieldin an irreducible error at high signal to noise ratio.

  • PDF

Performance Analysis of Backoff Algorithm in Wireless LANs with Prioritized Messages (무선랜 환경에서 우선순위를 고려한 백오프 알고리듬 성능분석)

  • Jeong Seok-Yun;Heo Seon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.1656-1660
    • /
    • 2006
  • Distributed coordination function(DCF) is the primary random access mechanism of IEEE 802.11, which is the basic protocol of wireless LAN based on the CSMA/CA protocol. It enables fast installation with minimal management and maintenance costs and is a very robust protocol for the best effort service in wireless medium. The current DCF, however, is known to be unsuitable for real-time applications such as voice message transmission. In this paper, we focus on the performance issues of IEEE 802.11 which accommodate the prioritized messages. Existing results use the initial window size and backoff window-increasing factor as tools to handle the priority of the messages. Instead, we introduce a novel scheme which chooses the backoff timer with arbitrary probabilities. By this, one can greatly reduce the backoff delay of the lower priority messages without degrading the performance of higher priority.

  • PDF

Redundancy Management of Brake-by-wire System using a Message Scheduling (메시지 스케줄링을 이용한 Brake-by-wire 시스템의 Redundancy Management)

  • Yune, J. W.;Kim, K. W.;Kim, T. Y.;Kim, J. G.;Lee, S.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2000.11a
    • /
    • pp.717-720
    • /
    • 2000
  • Event-driven communication protocols such as CAN(Controller Area Network) have inherent packet delays due to the contention process for the use of network medium. These delays are stochastic in nature because most packets arrive at random time instants. The stochastic property of the delay adversely influences the control system's performance in terms of stability, responsiveness and steady-state error. Another problem for safety-critical application such as brake-by-wire systems is the reliability of the communication modules that can fail abruptly. This paper deals with two methods to overcome the above problems : (i) scheduling method that can maintain packet delays under some acceptable level, and (ii) redundancy management of communication modules that prescribes dual-redundancy modules' behavior when one of them fails.

  • PDF

Development of an ATM switch simulator (ATM 스위치 시뮬레이터의 개발)

  • 변성혁;김덕경;이승준;허정원;선단근;박홍식
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.9
    • /
    • pp.1209-1218
    • /
    • 1995
  • In this paper, we develope an ATM switch simulator in order to evaluate the HAN/B-ISDN ATM switch currently being developed by ETRI. It models the basic cell switching functions of the target ATM switch with priority control and multicasting features and it also supports such various traffic models as random or bursty traffic, balanced or unbalanced traffic, multicast traffic models. Using this simulator, we can evaluate the performances of the ATM switch in terms of various performance indices, i.e. cell delay, cell loss probability, etc., and this simulator can be utilized in the system parameter tunings such as the common buffer size and address buffer size.

  • PDF

Performance Analysis of Output Queued Batcher-Banyan Switch for ATM Network (ATM 망에 적용 가능한 출력단 버퍼형 Batcher-Banyan 스위치의 성능분석)

  • Keol-Woo Yu;Kyou Ho Lee
    • Journal of the Korea Society for Simulation
    • /
    • v.8 no.4
    • /
    • pp.1-8
    • /
    • 1999
  • This paper proposes an ATM switch architecture called Output Queued Batcher-Banyan switch (OQBBS). It consists of a Sorting Module, Expanding Module, and Output Queueing Modules. The principles of channel grouping and output queueing are used to increase the maximum throughput of an ATM switch. One distinctive feature of the OQBBS is that multiple cells can be simultaneously delivered to their desired output. The switch architecture is shown to be modular and easily expandable. The performance of the OQBBS in terms of throughput, cell delays, and cell loss rate under uniform random traffic condition is evaluated by computer simulation. The throughput and the average cell delay are close to the ideal performance behavior of a fully connected output queued crossbar switch. It is also shown that the OQBBS meets the cell loss probability requirement of $10^{-6}$.

  • PDF

Linear Sub-band Decomposition-based Pre-processing for Perceptual Video Coding

  • Choi, Kwang Yeon;Song, Byung Cheol
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.5
    • /
    • pp.366-373
    • /
    • 2016
  • This paper proposes a pre-processing algorithm to improve the coding efficiency of perceptual video coding. First, an input image is decomposed into multiple sub-bands through linear sub-band decomposition. Then, the sub-bands that have low visual sensitivity are suppressed by assigning small gains to them. Experimental results show that if the proposed algorithm is adopted for pre-processing in a High Efficiency Video Coding (HEVC) encoder, it can provide significant bit-saving effects of approximately 12% in low delay mode and 9.4% in random access mode.