• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.6
• /
• pp.1147-1165
• /
• 2011

We present a simple and cost effective rate control scheme for streaming video over a wireless channel by using the information of mobile devices' buffer level. To prevent buffer fullness and emptiness at receivers, the server should be able to adjust sending rate according to receivers' buffer status. We propose methods to adjust sending rate based on the buffer level and discrete derivative of the buffer occupancy. To be compatible with existing network protocols, we provide methods to adjust sending rate by changing the inter-packet delay (IPD) at the server side. At every round-trip time, adjustments of sending rate are made in order to achieve responsiveness to sudden changes of buffer availabilities. A series of simulations and the prototype system showed that the proposed methods did not cause buffer overflows and it can maintain smoother rate control and react to bandwidth changes promptly.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.501-515
• /
• 2006

The IEEE 802.11 protocol is the most mature technology for WLANs(Wireless Local Area Networks). However, as the number of stations increases, the delay and throughput performance of IEEE 802.11 MAC(Medium Access Control) degrades severely. In this paper, we present the comprehensive performance analysis of IEEE 802.11 MAC protocol by investigating the MAC layer packet service time when arrival packet sizes have a general probability distribution. We obtain the discrete probability distribution of the MAC layer service time. By using this, we analyze the system throughput and the MAC layer packet service time of IEEE 802.11 MAC protocol in wireless LAN environment. We take some numerical examples for the system throughput and the mean packet service time for several special distributions of arrival packet sizes.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.8
• /
• pp.709-716
• /
• 2005

As a way to build more efficient and intelligent container cranes for todays hub ports, communication networks are used to interconnect numerous sensors, actuators, controllers, and operator switches and consoles that are spatially distributed over a crane. Various signals such as sensor values and operator's commands are digitized and broadcast on the network instead of using separate wiring cables. This not only makes the design and manufacturing of a crane more efficient, but also easier implementation of intelligent control algorithms. This paper presents the performance evaluation of CAN(Controller Area Network), TTP(Time Triggered Protocol) and Byteflight that can be used for cranes. Through discrete event simulation, several important quantitative performance factors such as the probability of a transmission failure, average system delay (data latency) and maximum system delay have been evaluated.

• Journal of Communications and Networks
• /
• v.6 no.2
• /
• pp.147-155
• /
• 2004

In this paper, we propose an efficient sequencing technique, namely minimum Row time scheduling (MFTS), to manage variable-Iength message transmissions for single-hop passive starcoupled WDM optical networks. By considering not only the message length but also the state of the receivers and the tuning latency, the proposed protocol can reduce the average delay of the network greatly. This paper also introduces a new channel assignment technique latency minimizing scheduling (LMS), which aims to reduce the scheduling latency. We evaluate the proposed algorithm, using extensive discrete-event simulations, by comparing its performance with shortest job first (SJF) algorithm. We find that significant improvement in average delay could be achieved by MFTS algorithm. By combining the proposed message sequencing technique with the channel selection technique, the performance of the optical network could be further improved.

• Proceedings of the KIPE Conference
• /
• 2001.10a
• /
• pp.336-340
• /
• 2001

In a digital system, there are inevitable delays in calculations and applying the inverter output voltages to the motor terminals. Because of the delays, the conventional predictive current controller implemented in the digital system has large overshoot and large harmonics. A new predictive current controller, considering the delays, for a permanent magnet synchronous motor (PMSM) is presented. The effectiveness and feasibilities are shown by experimental results.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.6
• /
• pp.368-375
• /
• 1988

This paper is concerned with the design of the optimal gains of the controller in the speed control system for the induction motor controlled by the microprocessor. The system is modelled with the discrete-time state equation, considering the time delay, for the facility of the optimization techniques. Introducing the conjugate gradient descent method, as the optimization technique, are derived the optimal gains, the gains which give the best transient characteristics. At the optimal gains obtained, the theoretcal transient responses are verified by experimental ones on a 5HP induction motor drive system.

• Journal of the Korea Society for Simulation
• /
• v.2 no.1
• /
• pp.46-54
• /
• 1993

Analytic and simulation models for prioritized token ring are presented in this paper. Its protocol is based on prioritized token ring with reservation (R-PTR). Since the protocol of the R-PTR is simple and the performance of the R-PTR is not inferior to that of the IEEE-PTR under almost all traffic load environments, we use the R-PTR as our token ring model. By using the properties of Markovian process, the expressions for average throughput and average packet transmission delay are derived. The results obtained from the analytic model are compared with that of the discrete event simulation model.

• ETRI Journal
• /
• v.28 no.5
• /
• pp.676-679
• /
• 2006

In this letter, we propose an adaptive hard handoff algorithm with a dynamic hysteresis value based on the received signal strength from the serving base station, for mobile cellular communication systems. A discrete-time method is presented to evaluate handoff algorithms analytically. Performance is evaluated in terms of the average number of handoffs, the probability of link degradation, and the average handoff delay. Numerical results and simulations demonstrate that the proposed algorithm outperforms the handoff algorithm with fixed hysteresis values and the handoff algorithm using both threshold and hysteresis.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.541-544
• /
• 2001

The difference of transfer mode between TDMA and ATM causes cell delay variation(CDV) to be generated in the receiving station. I proposed a optimization method of timestamps for discrete-timestamps mechanism to compensate CDV and an application method in multiple timestamps mechanism.

• Journal of the Korea Society for Simulation
• /
• v.1 no.1
• /
• pp.31-36
• /
• 1992

To estimate the probability of long delay in a queuing system using discrete-event simulation is studied. We contrast the coverage, half-width, and stability of confidence intervals constructed using two methods: batch means and new resampling technique; binary bootstrap. The binary bootstrap is an extension of the conventional bootstrap that resamples runs rather than data values. Empirical comparisons using known results for the M/M/1 and D/M/10 queues show the binary bootstrap superior to batch means for this problem.