• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -2
• /
• pp.600-603
• /
• 2000

In this paper, we propose the design method of distributed control system using Controller Area Network (CAN). CAN is an advanced serial communication protocol for distributed real-time control systems. It is a contention-based multi-master network whose timeliness properties come from its collision resolution algorithm which gives a high schedulable utilization and guaranteed bus access latency. With proposed method using CAN, we apply to robot controller. The effectiveness of proposed method is demonstrated by the simulation and experiment.

• 한국안전학회지
• /
• 제21권4호
• /
• pp.25-32
• /
• 2006

LonWorks over IP(LonWorks-IP) virtual device network(VDN) is an integrated form of LonWorks device network and IP data network. In especially real-time distributed servo applications on the factory floor, timely response is essential for predictive and preventive maintenance. The time delay in servo control on LonWorks-IP based VDN has highly stochastic nature. LonWorks-IP based VDN induced transmission delay deteriorates the performance and stability of the real-time distributed control system and can't give an effective preventive and predictive maintenance. In order to guarantee the stability and performance of the system, and give an effective preventive and predictive maintenance, LonWorks-IP based VDN induced time-varying uncertain time delay needs to be predicted and compensated. In this paper new Pill control scheme based on Smith predictor, disturbance observer and band pass filter is proposed and tested through computer simulation about position control of DC servo motor. It is shown that how can the proposed control scheme be designed to minimize the effects of uncertain varying time delay and model uncertainties. The validity of the proposed control scheme is compared and demonstrated with the comparison of internal model controllers(IMC) based on Smith predictor with and without disturbance observer.

• 한국수자원학회논문집
• /
• 제42권3호
• /
• pp.259-270
• /
• 2009

본 연구에서는 다방향 흐름 분배 알고리듬과 실시간 유출 보정 알고리듬을 이용하여 개발한 분포형 강우 유출모형의 실제 유역에 대한 적용성을 평가하였다. 안동댐과 남강댐 유역에 대해 각각 우량계 관측자료와 레이더 관측 우량자료를 이용하여 분포형 강우-유출 모의를 수행하였다. 이전의 호우사상에 대한 유역 매개변수 보정 실시 후 보정된 매개변수를 이용하여 다른 호우사상에 대해 모형을 적용하였다. 안동댐 유역에 대해 흐름 군집화 결과를 제시함으로써 다방향 흐름 분배 알고리듬의 흐름추적에 대한 물리적 타당성을 입증하였다. 다방향 흐름 분배 알고리듬을 이용하여 정확도를 유지하면서 계산소요시간 단축이 이루어졌으며 실시간 유출 보정 알고리듬의 적용을 통해 좀 더 향상된 정확도를 갖는 결과가 도출되었다. 본 연구에서 개선된 유역 홍수관리를 위한 분포형 강우 유출 모형의 활용가능성을 제시하였다.

• 한국경영과학회지
• /
• 제28권2호
• /
• pp.75-89
• /
• 2003

Media Access Control (MAC) Protocol in IEEE 802.11 Wireless LAN standard supports two types of services, synchronous and asynchronous. Synchronous real-time traffic is served by Point Coordination Function (PCF) that implements polling access method. Asynchronous nonreal-time traffic is provided by Distributed Coordination Function (DCF) based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Since real-time traffic is sensitive to delay, and nonreal-time traffic to error and throughput, proper traffic scheduling algorithm needs to be designed. But it is known that the standard IEEE 802.11 scheme is insufficient to serve real-time traffic. In this paper, real-time traffic scheduling and admission control algorithm is proposed. To satisfy the deadline violation probability of the real time traffic the downlink traffic is scheduled before the uplink by Earliest Due Date (EDD) rule. Admission of real-time connection is controlled to satisfy the minimum throughput of nonreal-time traffic which is estimated by exponential smoothing. Simulation is performed to have proper system capacity that satisfies the Quality of Service (QoS) requirement. Tradeoff between real-time and nonreal-time stations is demonstrated. The admission control and the EDD with downlink-first scheduling are illustrated to be effective for the real-time traffic in the wireless LAN.

• Journal of information and communication convergence engineering
• /
• 제9권4호
• /
• pp.405-410
• /
• 2011

In this paper, a conflict-avoided resource reservation scheme for UWB (Ultra Wide Band) WPAN (Wireless Personal Area Network) with D-MAC (Distributed Medium Access Control) is proposed. Since distributed characteristic of the WiMedia D-MAC supporting DRP (Distributed Reservation Protocol) scheme may cause lots of conflicts, overall performances of the WiMedia D-MAC can be deteriorated. In addition, once a DRP conflict occurs, only one of the DRP reservations involved in that DRP conflict maintains the reserved MASs, while the other DRP reservation must be terminated and DRP negotiations for them have to be re-started. Such DRP termination and renegotiation time delays due to the DRP conflicts can be a critical problem to the mobile devices transceiving real-time QoS traffic streams. Therefore, we propose a mechanism to avoid DRP conflicts by providing a kind of path diversity using relay transmission scheme and demonstrate its performance improvements via simulation results.

• 한국시뮬레이션학회논문지
• /
• 제14권3호
• /
• pp.79-90
• /
• 2005

There are plenty of optimization models for the signal-system of a single intersection and area traffic. Some of those models are adopted for the real traffic signal control system. The simulators for a single crossroad have been developed, so that we could evaluate optimization models and traffic control systems. However, the simulators for the area traffic are still being developed. Therefore, there are many limitations in the analysis and evaluation for area traffic control system. The area traffic is consisted of several intersections which are very complicated and many traffic strategies are adopted for the control system. This paper features an effective area traffic control system based on the High Lever Architecture(HLA). In this paper, we discuss the design of HLA-based area traffic control simulation. We describe technical motivations for the HLA, the key elements of the architecture and how they are minimum and essential to the goal of reuse and interoperability. A distributed simulation with HLA/RTI provides stable and satisfactory experimental results. Moreover, the prototype traffic control system provides reliable accomplishment compared to the NETSIM and TRANSYT-7F models.

• 대한전기학회논문지:시스템및제어부문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.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.89.6-89
• /
• 2001

In Vehicle Information and Communication System (VICS), which is an active field of Intelligent Transport System (ITS), information of traffic congestion is sent to each vehicle at real time. However, a centralized navigation system is not realistic to guide millions of vehicles in a megalopolis. Autonomous distributed systems should be more flexible and scalable, and also have a chance to focus on each vehicle´s demand. This paper proposes a sub-optimal route planning mechanism of vehicles in urban areas using the non-network type immune system. Simulation is carried out using a cellular automaton model. This system announces a sub-optimal route to drivers in real time using VICS.

• 제어로봇시스템학회논문지
• /
• 제3권1호
• /
• pp.77-88
• /
• 1997

Fieldbus is the lowest level communication network in factory automation and process control systems. Performance of factory automation and process control systems is directly affected by the data delay induced by network traffic. Data generated from several distributed field devices can be largely divided into three categories: sporadic real-time, periodic real-time and non real-time data. Since these data share one fieldbus network medium, the limited bandwidth of a fieldbus network must be appropriately allocated to the sporadic real-time, periodic real-time and non real-time traffic. This paper introduces a new fieldbus design scheme which allocates the limited bandwidth of fieldbus network to several different kinds of traffic. The design scheme introduced in this study not only satisfies the performance requirements of application systems interconnected into the fieldbus but also fully utilizes the network resources. The design scheme introduced in this study can be applicable to cyclic service protocols operated under single-service discipline. The bandwidth allocation scheme introduced in this study is verified using a discrete-event/continuous-time simulation experiment.

• ETRI Journal
• /
• 제34권3호
• /
• pp.462-465
• /
• 2012

This letter proposes a new distributed scheduling scheme combined with routing to support the quality of service of real-time applications in wireless mesh networks. Next, this letter drives average end-to-end delay of the proposed scheduling scheme that sequentially schedules the slots on a path. Finally, this letter simulates the time division multiple access network for performance comparison. From the simulation results, when the average number of hops is 2.02, 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 28%, 10%, 17%, 27%, and 30%, respectively, compared to the conventional random scheduling scheme.