• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4A
• /
• pp.330-335
• /
• 2007

This paper proposes a multichannel random access channel allocation scheme for multihop cellular networks to guarantee the stable throughput of a random access. The fundamental contribution is a mathematical formula for an optimal partition ratio of shared random access channels between a base station and a relay station. In addition, the proposed scheme controls the retransmission probability of random access packets under heavy load condition. Simulation results show that the proposed scheme can guarantee the required random access channel utilization and packet transmission delay even if the a random access packet arrival rate is higher than 0.1.

• Journal of Internet Computing and Services
• /
• v.9 no.5
• /
• pp.141-151
• /
• 2008

In the paper, we analyze the performance of random access channels in multi-service multi-user OFDMA systems. The resource of the random access channels in OFDMA systems are available sub-channels and PN-codes. For given available sub-channels and PN-codes,' we analyze the performance of the random access channels of OFDMA systems in terms of the access success probability, the blocking probability, the access delay and the throughput per 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 used to find proper region of the access probabilities of each service class for differentiated quality of service(QoS)s, and for the system operations in multi-service multi-user OFDMA systems.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.352-361
• /
• 2004

In this paper, we study how to achieve the maximum capacity under delay constraints for large mobile wireless networks. We develop a systematic methodology for studying this problem in the asymptotic region when the number of nodes n in the network is large. We first identify a number of key parameters for a large class of scheduling schemes, and investigate the inherent tradeoffs among the capacity, the delay, and these scheduling parameters. Based on these inherent tradeoffs, we are able to compute the upper bound on the maximum per-node capacity of a large mobile wireless network under given delay constraints. Further, in the process of proving the upper bound, we are able to identify the optimal values of the key scheduling parameters. Knowing these optimal values, we can then develop scheduling schemes that achieve the upper bound up to some logarithmic factor, which suggests that our upper bound is fairly tight. We have applied this methodology to both the i.i.d. mobility model and the random way-point mobility model. In both cases, our methodology allows us to develop new scheduling schemes that can achieve larger capacity than previous proposals under the same delay constraints. In particular, for the i.i.d. mobility model, our scheme can achieve (n-1/3/log3/2 n) per-node capacity with constant delay. This demonstrates that, under the i.i.d. mobility model, mobility increases the capacity even with constant delays. Our methodology can also be extended to incorporate additional scheduling constraints.

• Speech Sciences
• /
• v.1
• /
• pp.285-293
• /
• 1997

This paper was constructed to investigate strange attractor in considering speech which is regarded as chaos in that the random signal appears in the deterministic raising system. This paper searches for the delay time from AR model power spectrum for constructing fit attractor for speech signal. As a result of applying Taken's embedding theory to the delay time, an exact correlation dimension solution is obtained. As a result of this consideration of speech, it is found that it has more speaker recognition characteristic parameter, and gains a large speaker discrimination recognition rate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.2
• /
• pp.360-368
• /
• 2008

In this paper, in order that the various QoS(Qualify of Service)s that are required by different traffic class are guaranteed in the random access channels in multi-service multi-user OFDMA systems, the backoff-based random access algorithm is proposed and corresponding performance is analyzed in terms of the access success probability, the throughput, the average delay and the blocking probability. Through the numerical analysis, it is shown that the proposed backoff-based random access algorithm can provide the differentiated QoSs to random access attempts according to their service class.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.3
• /
• pp.687-705
• /
• 2006

In this paper we consider GPH distribution that is defined as a distribution for sum of random number of random variables following exponential distribution. We establish approximation process of general distributions to GPH distributions and offer numerical results for various cases to show the accuracy of the approximation. We also propose analysis method of delay distribution of queueing systems using approximation to GPH distributions and offer numerical results for various queueing systems to show applicability of GPH approximation.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.11
• /
• pp.786-792
• /
• 2004

A wavelet based ECG data compression has become an attractive and efficient method in many mobile tele-cardiology applications. But large data size required for high compression performance leads a serious delay. In this paper, new wavelet compression method with minimum delay is proposed. It is based on deciding the type and compression ratio(CR) of block organically according to the standard deviation of input ECG data with minimum block size. Compression performances of the proposed algorithm for different MIT ECG Records were analyzed comparing other ECG compression algorithm. In addition to the processing delay measurement, compression efficiency and reconstruction sensitivity to error were also evaluated via random noise simulation models. The results show that the proposed algorithm has both lower PRD than other algorithm on same CR and minimum time in the data acquisition, processing and transmission.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.3
• /
• pp.289-295
• /
• 2008

The shared-route decision algorithms in multicasting communications networks to provide the internet-based services such as IPTV, remote education/health, and internet broadcasting are presented. The three main measures of maximum delay, average delay and estimated delay between each node and member are adopted. Under the Mesh network with the uniform random cost between each node, the algorithm's performance is compared to the optimal solution with the minimum cost by all enumeration. The simulation results show that the algorithm using the estimated delay outperforms the other two methods.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.150-153
• /
• 2002

When a system is teleoperated in the indoor environment through the wireless LAN, we must consider the communication time delay. The time delay is random and unbounded due to the inherent characteristic and surrounding environment. As result of this, the stability and performance of the teleoperated system is degraded. In this paper, we present the adaptive control algorithm to overcome this problem by measuring time delay and allocating task corresponding to time delay dynamically. And the simple experiment is conducted to demonstrate the feasibility.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.9
• /
• pp.929-938
• /
• 2009

This paper presents a novel control methodology for communication network based nonlinear systems with time delay nature. We construct a nominal nonlinear control law for representing a linear model and a reset control system which is aimed for corrective control strategy to compensate system error due to uncertain time delay through wireless communication network. Next, online neural control approach is proposed for overcoming nonstationary statistical nature in the network topology. Additionally, DBN (Dynamic Bayesian Network) technique is accomplished for modeling of its dynamics in terms of casuality, which is then utilized for estimating prediction of system output. We evaluate superiority and reliability of the proposed control approach through numerical simulation example in which a nonlinear inverted pendulum model is employed as a networked control system.