• Journal of the Korean Society of Industry Convergence
• /
• v.20 no.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.

• Journal of Communications and Networks
• /
• v.6 no.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.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• 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.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.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.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.270-276
• /
• 2007

The proposed LDS(Link-status Dependent Scheduling) algorithm in HR-WPAN(High Rate-Wireless Personal Area Network) up to now aims at doing only throughput elevation of the whole network, when the crucial device is connected with worst-link relatively, throughput of this device becomes aggravation. The proposed the WGS(Worst-case Guaranteed Scheduling) algorithm in this paper guarantees throughput of the device which is connected with worst-link in a certain degree as maintaining throughput of all devices 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 device which is connected worst-link in a certain degree in a design of HR-WPAN hereafter.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• 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.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.3
• /
• pp.265-270
• /
• 2004

This paper addresses the effect of group delay in satellite communication system. Phase of signal is distorted by the non-constant group delay. Group delay can be modeled as linear, parabolic and cubic type according to the polynomial characteristic. We investigate BER performance of satellite communication system with each 3 kinds of group delay. As signal bandwidth becomes wider, group delay makes more influence on the signal. BNR performance of satellite communication system is found when data rates are 1Mbps, 4Mbps and 8Mbps. Convolution coding with the code rate of 1/2 or 7/8 is used. At BER =10$\^$-5/, system with group delay needs more SNR of minimum 0.3㏈ to maximum 4.4㏈ than system without group delay. The worst case of BER performance happens in the linear group delay, 7/8 punctured convolution coding and 8 Mbps. The required SNR is increased by 4.4㏈ at this worst case.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.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.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• 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.