• 제목/요약/키워드: Worst-case Delay

검색결과 46건 처리시간 0.023초

Worst-case Delay Analysis of Time-Triggered 802.15.4 for Wireless Industrial Environments

  • Kim, Hyun-Hee;Lee, Kyung-Chang
    • 한국산업융합학회 논문집
    • /
    • 제20권3호
    • /
    • pp.205-212
    • /
    • 2017
  • This paper focuses on worst-case delay analysis of the time-triggered IEEE 802.15.4 protocol to satisfy the industrial quality-of-service (QoS) performance. The IEEE 802.15.4 protocol is considered to be unsuitable for industrial networks because its medium access control method is contention-based CSMA/CA, which exhibits unstable performance with an unbounded delay distribution under heavy traffic. To avoid these limitations, this paper presents a time-triggered version of the nonbeacon-enabled network of IEEE 802.15.4 that relies on a time division multiplexing access (TDMA) method implemented in the application layer without any modification of specification. The timing analysis of this time-triggered IEEE 802.15.4 was executed, and the worst-case transmission delay was calculated. Based on this analysis, the time-triggered IEEE 802.15.4 is a promising alternative for wireless industrial networking.

Worst Average Queueing Delay of Multiple Leaky-Bucket-Regulated Streams and Jumping-Window Regulated Stream

  • Lee, Daniel C.
    • Journal of Communications and Networks
    • /
    • 제6권1호
    • /
    • pp.78-87
    • /
    • 2004
  • This paper presents deterministic, worst-case analysis of a queueing system whose multiple homogeneous input streams are regulated by the associated leaky buckets and the queueing system that has a single stream regulated by the jumping-window. Queueing delay averaged over all items is used for performance measure, and the worst-case input traffic and the worst-case performance are identified for both queueing systems. For the former queueing system, the analysis explores different phase relations among leaky-bucket token generations. This paper observes how the phase differences among the leaky buckets affect the worst-case queueing performance. Then, this paper relates the worst-case performance of the former queueing system with that of the latter (the single stream case, as in the aggregate streams from many users, whose item arrivals are regulated by one jumping-window). It is shown that the worst-case performance of the latter is identical to that of the former in which all leaky buckets have the same phase and have particular leaky bucket parameters.

Worst-case optimal feedback control policy for a remote electrical drive system with time-delay

  • 고유;장정;이창구;정길도
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.92-94
    • /
    • 2007
  • This paper considers an optimal control problem for a remote control to an electrical drive system with a DC motor. Since it is a linear control system with time-delay subject to unknown but bounded disturbance, we construct a worst-case feedback control policy. This policy can guarantee that, for all admissible uncertain disturbances, the real system state should be in a prescribed neighborhood of a desired value, and the cost functional takes the best guarantee value. The worst-case feedback control policy is allowed to be corrected at one correction point between the initial to the final time, which is equivalent to solving a 1-level min-max problem. Since the min-max problem at the stage does not yield a simple analytical solution, we consider an approximate control policy, which is equivalent and can be solved explicitly m the numerical experiments.

  • PDF

CAN기반 분산 제어시스템의 종단 간 지연시간 분석과 협조 스케줄링 알고리즘 개발 (Development of Coordinated Scheduling Algorithm and End-to-end Delay Analysis for CAN-based Distributed Control Systems)

  • 이희배;김홍열;김대원
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제53권7호
    • /
    • pp.501-508
    • /
    • 2004
  • In this paper, a coordinated scheduling algorithm is proposed to reduce end-to-end delay in distributed control of systems. For the algorithm, the analysis of practical end-to-end delay in the worst case is performed priory with considering implementation of the systems. The end-to-end delay is composed of the delay caused by multi-task scheduling of operating systems, the delay caused by network communications, and the delay caused by asynchronous timing between operating systems and network communications. Through some simulation tests based on CAN(Controller Area Network), the proposed worst case end-to-end delay analysis is validated. Through the simulation tests, it is also shown that a real-time distributed control system designed to existing worst case delay cannot guarantee end-to-end time constraints. With the analysis, a coordinated scheduling algorithm is proposed here. The coordinated scheduling algorithm is focused on the reduction of the delay caused by asynchronous timing between operating systems and network communications. Online deadline assignment strategy is proposed for the scheduling. The performance enhancement of the distributed control systems by the scheduling algorithm is shown through simulation tests.

CAN 기반 분산 제어시스템의 종단 간 지연 시간 분석과 온라인 글로벌 클럭 동기화 알고리즘 개발 (End-to-end Delay Analysis and On-line Global Clock Synchronization Algorithm for CAN-based Distributed Control Systems)

  • 이희배;김홍렬;김대원
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 B
    • /
    • pp.677-680
    • /
    • 2003
  • In this paper, the analysis of practical end-to-end delay in worst case is performed for distributed control system considering the implementation of the system. The control system delay is composed of the delay caused by multi-task scheduling of operating system, the delay caused by network communication, and the delay caused by the asynchronous between them. Through simulation tests based on CAN(Controller Area Network), the proposed end-to-end delay in worst case is validated. Additionally, online clock synchronization algorithm is proposed here for the control system. Through another simulation test, the online algorithm is proved to have better performance than offline one in the view of network bandwidth utilization.

  • PDF

HR-WPAN을 위한 Worst-case Guaranteed Scheduling Algorithm (Worst-case Guaranteed Scheduling Algorithm for HR-WPAN)

  • 김제민;이정규
    • 한국통신학회논문지
    • /
    • 제32권5B호
    • /
    • pp.270-276
    • /
    • 2007
  • 현재까지 HR-WPAN(High Rate-Wireless Personal Area Network)에 제안된 LDS(Link-status Dependent Scheduling) 알고리즘(algorithm)은 전체 네트워크(network)의 처리율(throughput) 향상만을 목적으로 함으로서, worst-link에 상대적으로 중요한 디바이스(device)가 연결된 경우, 그 디바이스의 처리율은 더욱 악화 된다. 본 논문에서 제안한 WGS(Worst-case Guaranteed Scheduling) 알고리즘은 link 상태가 변하더라도 모든 디바이스의 처리율을 동일하게 유지함으로써, worst-link에 연결된 디바이스의 처리율을 어느 정도 보장하고 전체 네트워크의 지연은 기존의 LDS 알고리즘보다 감소시킬 수 있다. 따라서 향후 HR-WPAN의 설계 시 worst-link에 연결된 디바이스의 처리율을 어느 정도 보장하고 전체 네트워크의 지연을 감소시키고 싶을 경우, 본 논문에서 제안한 WGS 알고리즘이 유용하게 사용될 수 있을 것이다.

HR-WPAN을 위한 Worst-case Guaranteed Scheduling algorithm (Worst-case Guaranteed Scheduling algorithm for HR-WPAN)

  • 김제민;이정규
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.249-251
    • /
    • 2007
  • The proposed LDS(Link-status Dependent Scheduling) algorithm in HR-WPAN up to now aims at doing only throughput elevation of the whole network, when the crucial DEV(Device) is connected with worst-link relatively, throughput of this DEV becomes aggravation, The proposed the WGS(Worst-case Guaranteed Scheduling) _algorithm in this paper guarantees throughput of the DEV which is connected with worst-link in a certain degree as maintaining throughput of all DEVs identically even if a link-status changes, decreases delay of the whole network more than current LDS algorithm Therefore proposed WGS algorithm in this paper will be useful in case of guaranteeing throughput of a DEV which is connected worst-link in a certain degree in a design of HR-WPAN hereafter.

  • PDF

군지연 특성을 고려한 위성통신 시스템의 성능 분석 (Performance Analysis of the Satellite Communication System Including the Grop Delay Characteristics)

  • 맹준호;유흥균;김기근;이대일;김도선
    • 한국전자파학회논문지
    • /
    • 제15권3호
    • /
    • pp.265-270
    • /
    • 2004
  • 본 논문에서는 group delay가 위성 통신 시스템에 미치는 영향을 분석한다. 일정한 상수가 아닌 group delay에서는 신호의 위상 왜곡이 발생한다. Group delay는 특성에 따라 linear, parabolic, cubic으로 모델링할 수 있다. 각각의 group delay 특성을 위성통신 시스템에 적용하여 BER(bit error rate)을 분석한다. Group delay는 신호의 대역폭이 커질수록 신호에 미치는 영향이 커지는 특성을 갖고 있으며, 위성 통신 시스템의 정보 전송속도가 1Mbps, 4Mbps, 8Mbps 의 세 가지인 경우에 대하여 BER을 분석한다. 이때 channel coding으로는 구속장이 7이고, code rate 1/2인 convolution coding과 7/8 punctured convolution coding 를 이용한다. BER = $10^{-5}$을 만족하는 요구 SNR을 관찰하였을 때, group delay의 영향을 받는 데이터는 group delay의 영향을 받지 않은 데이터에 비해 요구 SNR은 최소 0.3㏈에서 최대 4.4㏈으로 증가한다. 이들 중 group delay에 의한 영향이 가장 큰 경우는 group delay의 특성이 linear 특성이고 channel coding이 7/8 puncture convolution coding, 전송속도가 8 Mbps인 경우로서 이때 요구 SNR은 4.4㏈증가한다.

Optimal Control Policy for Linear-Quadratic Control Problems with Delay and Intermediate State Constraints

  • Chong, Kil-To;Kostyukova, Olga;Kurdina, Mariya
    • International Journal of Control, Automation, and Systems
    • /
    • 제6권6호
    • /
    • pp.845-858
    • /
    • 2008
  • In this paper, we consider a terminal, linear control system with delay, subject to unknown but bounded disturbances. For this system, we consider the problem of constructing a worst-case optimal feedback control policy, which can be corrected at fixed, intermediate time instants. The policy should guarantee that for all admissible uncertainties the system states are in prescribed neighborhoods of predefined system states, at all fixed, intermediate time instants, and in the neighborhood of a given state at a terminal time instant, and the value of the cost function is the best guaranteed value. Simple explicit rules(which can be easily implemented on-line) for constructing the optimal control policy in the original control problem are derived.

Closed-loop Feedback Control for Enhancing QoS in Real-time communication Networks

  • Kim, Hyung-Seok;Kwon, Wook-Hyun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2001년도 ICCAS
    • /
    • pp.40.1-40
    • /
    • 2001
  • In this paper, control theoretic approaches are proposed to guarantee QoS (Quality of Series) such as packet delay and packet loss of real-time traffic in high-speed communication network. Characteristics of variable rate real-time traÆc in communication networks are described. The mathematical model describing networks including source and destination nodes are suggested. By a traffic control mechanism, it is shown that worst-case end-to-end transfer delay of traffic can be controlled and packet loss can be prevented. The simulation shows results of delay control and buer level control to raise QoS in realtime traffic.

  • PDF