• ETRI Journal
• /
• v.44 no.3
• /
• pp.512-523
• /
• 2022

Random delay countermeasures introduce random delays into the execution flow to break the synchronization and increase the complexity of the side channel attack. A novel method for attacking devices with random delay countermeasures has been proposed by using a maximal overlap discrete wavelet transform (MODWT)-based power trace alignment algorithm. Firstly, the random delay in the power traces is sensitized using MODWT to the captured power traces. Secondly, it is detected using the proposed random delay detection algorithm. Thirdly, random delays are removed by circular shifting in the wavelet domain, and finally, the power analysis attack is successfully mounted in the wavelet domain. Experimental validation of the proposed method with the National Institute of Standards and Technology certified Advanced Encryption Standard-128 cryptographic algorithm and the SAKURA-G platform showed a 7.5× reduction in measurements to disclosure and a 3.14× improvement in maximum correlation value when compared with similar works in the literature.

• Journal of Korean Society of Transportation
• /
• v.10 no.1
• /
• pp.41-54
• /
• 1992

The purpose of this thesis is to construct a model to estimate the delay that vehicles arriving randomly will be experienced at an isolated singalized intersection. To do this the following objectives are set in this study: (i) An what distance a random arrival pattern occurs after a platoon of vehicles are dis-charged from the stop line; (ii) A model which estimates the average delay per through-vehicle with respect to the de-gree of saturation; and (iii) The relation between the stepped delay and average approach delay per vehicle. The following are the findings of this study: (i) A random arrival pattern on the first second and third lanes occur 300,400 and 300m downstream from stop line rdspectively. A random arrival pattern on lane group occurs 500m downstream from the stop line ; (ii) A model for the estimation of approach delay has been developed in such a way that up to x=0.7 the delay increases linearly and beyond 0.7 the delay increases rapidly in a form of second order polynomial due to high degree of saturation : and (iii) Approach delay equals approximately 1.21 times of stopped delay.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.5
• /
• pp.1469-1484
• /
• 2014

In this paper we are concerned with a class of stochastic partial functional differential equations with infinite delay. Supposing that the linear part is a Hille-Yosida operator but not necessarily densely defined and employing the integrated semigroup and random dynamics theory, we present some appropriate conditions to guarantee the existence of a random attractor.

• Journal of the Semiconductor & Display Technology
• /
• v.10 no.3
• /
• pp.21-28
• /
• 2011

In recent years, owing to the development of the image processing technology, the research to build control system using a vision sensor is stimulated. However, a random time delay must be considered, because it works of a various time to get a result of an image processing in the system. It can be seen as an obstacle factor to a control of visual tracking in real system. In this paper, implementing two vision controllers each, first one is made up PID controller and the second one is consisted of a Smith Predictor, the possibility was shown to overcome a problem of a random time delay in a visual tracking system. A number of simulations and experiments were done to show the validity of this study.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.7
• /
• pp.583-589
• /
• 2004

Modem control systems often use a communication network to send measurement and control signals between nodes. Communication delays can be time varying. The length of the time delays is often hard to predict and modeled as being random. This paper proposes a combined controller used to compensate network time delay by estimating the delay with the interacting multiple model (IMM). The network delay is modeled as a Markov chain and 3 modes representing heavy, medium, and low network loads are used in the IMM. The proposed method is applied to an optimal control system with double integrators and the results are compared with the existing control methods.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.915-920
• /
• 2003

Modern control systems often use a communication network to send measurement and control signals between nodes. Communication delays can be time varying. The length of the time delays is often hard to predict and are modeled as being random. This paper proposes a combined controller used to compensate network time delay by estimating the delay with the interacting multiple model (IMM). The network delay is modeled as a Markov chain and 3 modes representing heavy, medium, and low network loads are used in the IMM. The proposed method is applied to an optimal control system with double integrators and the results are compared with the existing control methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.876-884
• /
• 2012

This paper introduces two multi-hop delay factors which can be caused by conventional TDMA scheduling; queueing delay and delay by random link scheduling, and proposes a new sequential scheduling scheme to resolve these two factors. We also simulate the TDMA network with the proposed link scheduling scheme and compare it with conventional(random) link scheduling scheme in terms of end-to-end packet transmission delay. From the simulation results, the more the average hop distance increases, the more the difference of the delay performance of both scheduling schemes increases. When the average number of hops is 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 22%, 36%, 48%, and 55% respectively when compared to the random scheduling scheme.

• International Journal of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.43-51
• /
• 2023

Slotted ALOHA (S-ALOHA) is a classical medium access control protocol widely used in multiple access communication networks, supporting distributed random access without the need for a central controller. Although stability and delay have been extensively studied in existing works, most of these studies have assumed ideal channel conditions or independent fading, and the impact of time-correlated wireless channels has been less addressed. In this paper, we investigate the queueing delay performance in S-ALOHA networks under time-correlated channel conditions by utilizing a Gilbert-Elliott model. Through simulation studies, we demonstrate how temporal correlation in the wireless channel affects the queueing delay performance. We find that stronger temporal correlation leads to increased variability in queue length, a larger probability of having queue overflows, and higher congestion levels in the S-ALOHA network. Consequently, there is an increase in the average queueing delay, even under a light traffic load. With these findings, we provide valuable insights into the queueing delay performance of S-ALOHA networks, supplementing the existing understanding of delay in S-ALOHA networks.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.348-353
• /
• 2003

This paper considers the optimal control problem in real-time control systems with random time-delays. It proposes an algorithm which uses the linear quadratic (LQ) control method and a dedicated technique to compensate for the time-delay effects. Since it is assumed that the time-delays are unknown but the probability distribution of the delays are known a priori, the algorithm considers the mean value of the time-delays as a nominal value for random delay compensation. An example is given to show the performance of the proposed algorithm, where an inverted pendulum system is controlled over a controller-area network (CAN). Simulation results show that the proposed algorithm provides good performance results. It is shown that our algorithm is comparable to existing algorithms in both computation cost and performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.822-829
• /
• 2005

In this paper, a processing time and trafnc capacity analysis algorithm for RFID system using LBT-Random Searching scheme is proposed. Service time, carrier sensing time, additional delay time required for contiguous frequency channel occupancy, and additional delay time required for the contiguous using the same frequency channel are considered and the processing delay and frequency channel capacity are analyzed for the steady state operation of the system. The simulation results showing maximum capacity of the system and explaining the accuracy of the algorithm are provided.