• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.10
• /
• pp.849-858
• /
• 2001

One of the important problems which should be solved in the telecontroller control is the time delay problem. In this paper, we propose a method of solving a random time delay problem using QoS(quality of service), and we show not only how to solve an unpredictable time delay problem but also how to compute a maximum time delay that could satisfy a basic assumption of many telecontroller methods. Using our proposed method, it is find that we can offer more stable time delay in telecontroller than using TCP and UDP.

• Kyungpook Mathematical Journal
• /
• v.56 no.2
• /
• pp.431-450
• /
• 2016

In this paper, the existence, uniqueness, stability via continuous dependence and Ulam stabilities of nonlinear integro-differential equations with random impulses are studied under sufficient condition. The results are obtained by using Leray-Schauder alternative fixed point theorem and Banach contraction principle.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.1
• /
• pp.185-201
• /
• 2023

Grant-free random access (GFRA) can reduce the access delay and signaling cost, and satisfy the short transmission packet and strict delay constraints requirement in internet of things (IoT). IoT is a major trend in the future, which is characterized by the variety of applications and devices. However, most existing studies on GFRA only consider a single type of device and omit the effect of access delay. In this paper, we study GFRA in multicell massive multipleinput multiple-output (MIMO) systems where different types of devices with various configurations and requirements co-exist. By introducing the backoff mechanism, each device is randomly activated according to the backoff parameter, and active devices randomly select an orthogonal pilot sequence from a predefined pilot pool. An analytical approximation of the average spectral efficiency for each type of device is derived. Based on it, we obtain the optimal backoff parameter for each type of devices under their delay constraints. It is found that the optimal backoff parameters are closely related to the device number and delay constraint. In general, devices that have larger quantity should have more backoff time before they are allowed to access. However, as the delay constraint become stricter, the required backoff time reduces gradually, and the device with larger quantity may have less backoff time than that with smaller quantity when its delay constraint is extremely strict. When the pilot length is short, the effect of delay constraints mentioned above works more obviously.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.4
• /
• pp.38-49
• /
• 2002

In this paper, we propose a solution for random time-delay in teleoperation via internet using QoS, and show the experimental results of our proposed method. By ensuring a constant bandwidth required for the specific telecontrolled system, we change irregular random time-delay to a predictable time-delay, and so we can control the system with the time-delay shorter than the specified time-delay. Through the experimental results, we show the effectiveness of our proposed method.

• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.430-438
• /
• 2013

This paper addresses the issue of throughput-delay of one-to-many wireless multi-hop flows based on random linear network coding (RLNC). Existing research results have been focusing on the single-hop model which is not suitable for wireless multi-hop networks. In addition, the conditions of related system model are too idealistic. To address these limitations, we herein investigate the performance of a wireless multi-hop network, focusing on the one-to-many flows. Firstly, a system model with multi-hop delay was constructed; secondly, the transmission schemes of system model were gradually improved in terms of practical conditions such as limited queue length and asynchronous forwarding way; thirdly, the mean delay and the mean throughput were quantified in terms of coding window size K and number of destination nodes N for the wireless multi-hop transmission. Our findings show a clear relationship between the multi-hop transmission performance and the network coding parameters. This study results will contribute significantly to the evaluation and the optimization of network coding method.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.3
• /
• pp.1-4
• /
• 2010

RS-485, communication bases from small network system must prepare in collision. The collision is that mean the data transfer breaks. For a stabilized communication chooses 1:N polling methods. But polling is low speed in addition to maybe overload Master device. So, usual N:N Prefers a communication. In this case, must be preparing to avoid collision or some solutions. Generally, to after collision retransmits after short time. It's called delay time for short time. When making a delay time, uses address of each systems. (Address of each node) If the many nodes collided, the each node has different delay time. When making a delay time, uses a usual random number. Making a random number is hard job. So uses a usual pseudorandom number. It is more difficult from small size MCU. The Chaos random number provides stabled value. Finally, when uses the Chaos random number, the stability and reliability of system get better.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1B
• /
• pp.42-48
• /
• 2002

In broadband wireless networks, the effective meeting of the QoS guarantees may strongly depend on the Contention Resolution Algorithm used in the uplink contention period. The time it takes a station to transmit a successful request to the base station, or request delay, must be kept low even during periods of high contention. If a request suffers many collisions, it cannot rely on the preemptive scheduler to receive low access delays. However, the conventional collision resolution algorithm has a problem that all collided stations are treated equally regardless of their delay from previous contention periods. Some requests may have very long request delay caused by continuous collisions. In this paper, we propose an adaptive collision resolution algorithm for fast random access in broadband wireless networks. The design goal is to provide quick access to the request with a high number of collisions. To do this, the proposed algorithm separates the whole contention region into multiple sub regions and permits access through each sub region only to the requests with equal number of collisions. The sub region is adaptively created according to the feedback information of previous random access. By simulation, the proposed algorithm can improve the performance in terms of throughput, random delay and complementary distribution of random delay by its ability to isolate higher priorities from lower ones. We can notice the algorithm provides efficiency and random access delay in random access environment.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.693-695
• /
• 2016

A random and systematic jitter suppressed DLL is presented. The AC averages the delay time of successive delay stages and equalizes the delay time of all delay stages. Measurement results of the DLL-based clock generator fabricated in a one-poly six-metal $0.18{\mu}m$ CMOS process shows 13.4-ps rms jitter.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.237-239
• /
• 2007

In the paper, we analyze the performances of random access channels in multi-service multi-user OFDMA systems. The resource of the random access channels in OFDMA systems is the nubmer of available sub-channels and PN-codes. For given available sub-channels and PN-codes. we analyze the performances of the random access channels of OFDMA systems according to three resource allocation methods (resource full sharing, resource partial sharing, resource partition) in tenus of the access success probability, the blocking probability, the access delay and the throughput of each service class. Further, we find the feasible region of the access probability of each service class in which the allowable minimum access success probability, the allowable maximum blocking probability and the allowable maximum access delay are satisfied. The results also can be utilized to find proper region of the access probabilities of each service class for differentiated quality of service(QoS)s, and for the system operations.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.3
• /
• pp.444-452
• /
• 2008

We propose an intelligent predictive control approach for a nonlinear networked control system (NCS) with time-varying delay and random observation. The control is given by the sum of a nominal control and a corrective control. The nominal control is determined analytically using a linearized system model with fixed time delay. The corrective control is generated online by a neural network optimizer. A Markov chain (MC) dynamic Bayesian network (DBN) predicts the dynamics of the stochastic system online to allow predictive control design. We apply our proposed method to a satellite attitude control system and evaluate its control performance through computer simulation.