• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.1
• /
• pp.80-88
• /
• 2002

As many sensors and actuators are used in automated systems, various industrial networks are adopted for digital control system. In order to take advantages of the networking, however, the network implementation should be carefully designed to satisfy real-time requirements considering network delays. This paper presents the implementation scheme of a networked control system via Profibus-DP network. More specifically, the effect of the network delay on the control performance was evaluated on a Profibus-DP testbed, and a GA-based PID tuning algorithm is proposed to design controllers suitable for networked control systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.1
• /
• pp.205-214
• /
• 2008

To transfer large amount of packets fast in sensor network, it is necessary that the delay between successive packet transmissions should be minimized as possible. In Sensor network, since the Operating Systems are worked on the event driven, the Timer Event is used to transfer packets successively. However, since the transferring time of packet completely is varies very much, it is very hard to set appropriate interval. If interval is too long, delay also becomes too long but if interval is too short, the fail of transfer request would increase. In this paper, we propose ESTEO which reduces the delay between successive packet transmissions by using SendDone Event which informs that a packet transmission has been completed. In ESTEO, the delay between successive packet transmissions is shortened very much since the transmission of next Packet starts at the time when the transmission of previous packet has completed, irrespective of the transmission time. Therefore ESTEO could provide high packet transmission rate given large amount of packets.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.1013-1019
• /
• 2016

This paper describes a novel Context-awareness Markov Chain Prediction (CMCP) algorithm based on movement prediction using Markov chain in Delay Tolerant Network (DTN). The existing prediction models require additional information such as a node's schedule and delivery predictability. However, network reliability is lowered when additional information is unknown. To solve this problem, we propose a CMCP model based on node behaviour movement that can predict the mobility without requiring additional information such as a node's schedule or connectivity between nodes in periodic interval node behavior. The main contribution of this paper is the definition of approximate speed and direction for prediction scheme. The prediction of node movement forwarding path is made by manipulating the transition probability matrix based on Markov chain models including buffer availability and given interval time. We present simulation results indicating that such a scheme can be beneficial effects that increased the delivery ratio and decreased the transmission delay time of predicting movement path of the node in DTN.

• Journal of Korean Society of Transportation
• /
• v.31 no.4
• /
• pp.3-17
• /
• 2013

The purpose of this study is to develop a traffic assignment model where the variable of signal intersection delay is taken into account in assigning traffic in large-scale network settings. Indeed, despite the fact that the majority of the increase in travel time or cost involving congested urban network or interrupted flow are accounted for by stop delays or congested delays at signal intersections, the existing traffic assignment models did not reflect this. The traffic assignment model considering intersection delays presented in this study was built based on the existing traffic assignment models, which were added to by the analysis technique for the computation of intersection delay provided in Korea Highway Capacity Manual. We can conclude that a multiple variety of simulation tests prove that this model can be applied to real network settings. Accordingly, this model shows the possibility of utilizing a model considering intersection delay for traffic policy decisions through analysis of effects of changes in traffic facilities on large urban areas.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.2
• /
• pp.1-10
• /
• 2009

Energy efficient operations are essential to increase the life time of wireless sensor network. A cluster-based protocol is the most common approach to preserve energy during a data aggregation. This paper deals with an energy awareness and autonomous clustering method based on time delay. This method consists of three stages. In the first phase, Candidate Cluster Headers(CCHs) are selected based on a time delay which reflects the remaining energy of a node, with considering coverage efficiency of a cluster. Then, time delay is again applied to declare Cluster Headers(CHs) out of the CCHs. In the last phase, the issue on an orphan node which is not included into a cluster is resolved. The simulation results show that the proposed method increases the life time of the network around triple times longer than LEACH(Low Energy Adaptive Cluster Hierarchy). Moreover, the cluster header frequency is less diverse, and the energy on cluster heads is less spent.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.11
• /
• pp.2103-2108
• /
• 2011

In this paper, the problem of passivity analysis for neural networks with time-varying delays and norm-bounded parameter uncertainties is considered. By constructing a new augmented Lyapunov functional, a new delay-dependent passivity criterion for the network is established in terms of LMIs (linear matrix inequalities) which can be easily solved by various convex optimization algorithms. Two numerical example are included to show the effectiveness of proposed criterion.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.9
• /
• pp.1809-1814
• /
• 2009

In this paper, the problem of stability analysis for neural networks with discrete and distributed time-varying delays is considered. By constructing a new Lyapunov functional, a new delay-dependent stability criterion for the network is established in terms of LMIs (linear matrix inequalities) which can be easily solved by various convex optimization algorithms. Two numerical example are included to show the effectiveness of proposed criterion.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.449-458
• /
• 1999

In real-time systems, the accurate response time and minimal communication delay is highly desired. However, a conventional SNMP uses network resources inefficiently and introduces too much network traffic for periodic requests in particular. This paper presents an extended SNMP called Real-Time SNMP. It is designed to support real-time applications with time constraints to provide more accurate response time and less network traffic for periodic SNMP request PDU which is sent from a management station to agents. In addition, the module of the Real-Time SNMP agent works between management station and each SNMP agent to periodically generate requests for the associated agent. In this paper we have implemented the proposed Real-Time SNMP agent module and extended SNMP PDU. We also show the experimental results that indicated more punctual response time and reduced communication delay using the proposed Real-Time SNMP.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.4 no.1
• /
• pp.7-13
• /
• 2005

In this paper, we propose the time synchronization module on fiber optic repeater to use optic line delay for obtaining time synchronization between up-link and down-link, in the 2.3 GHz WiBro network using TDD/OFDM (Time Division Duplex/Orthogonal Frequency Division Multiplexing) Generally, when we use fiber optic repeater to remove the shade area, it occurs transmission delay which is caused by optic transmission between RAS (Radio Access Station) and fiber optic repeater and inner delay of fiber optic repeater. Because the WiBro system is adopting a TOO method and there exists the difference of switching time which is caused by these delay between up-link and down-link, it occurs ISI (Inter Symbol Interference), ICI (Inter Carrier Interference). These interference results in the reduction of the coverage. And the inconsistency between Up-Link and Down-Link switching time maybe gives rise to the interruption of communication. In order to prevent these cases, we propose synchronization module using analog optic line delay as the one of synchronizing up-link and down-link. And we propose the consideration factor for the designing time synchronization module and the feature of optic line of analog method. The measurement result of optic line time synchronization module of structure proposed is as follows, the delay error of $0.5{\mu}g$ and the insertion loss value below maximum 4.5dB in range of $0{\sim}40{\mu}s$. These results fully meet the specification of WiBro System.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.497-500
• /
• 2010

Wireless sensor network is the system for data collection and data process between many nodes. For this work, Synchronization of operation execution and ordering many events are needed. Reference the external time information is the most accurate way to have same time information for all nodes but it's hard to apply these to sensor network. So there are many study of time synchronization there are many error occurred when the time synchronization is executed in the sensor network and minimizing these errors is important. In this paper, we propose how to minimize errors using several time stamp information exchanging when the network is initialized. When the big difference is occurred between receive time and send time in the node communication(cause of traffic overhead and etc), it shows big error of time correction and transfer delay time. but it's hard to detect these errors when it exchanges time stamp information just one time. so we try to reduce these errors using the median value of transfer delay and time correction value with many times of time stamp information exchange.