• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.6
• /
• pp.547-554
• /
• 2007

This thesis presents a kind of active noise control(ANC) algorithm for reducing noise due to engine inside a car. The proposed control algorithm is, by using WP(Wavelet Packet), a one improving the instability due to delay of noise transmission and the lack of response ability for the rapid change of noise, which are defects of the existing FXLMS(Filtered-X Least Mean Square) algorithm. The chief character of this system is a thing that faster operation than the FXLMS is implemented by inserting WP in the secondary path. In other words, WP implements parallel operation. Then, the weights of filter in the adaptive algorithm will be updated faster. In addition, because WP have so excellent a resolution, they can process very minute noise. The efficiency of this control algorithm will be demonstrated in the matlab simulation and in the actual experiments by using a Labview program and a car.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12A
• /
• pp.1320-1328
• /
• 2007

In recent year, the popularity of WLAN has generated much interests on improvement and performance analysis of the IEEE 802.11 protocol. In this paper, we analyze two medium access methods of the IEEE 802.11 MAC protocol by investigating the MAC layer packet service times when arrival packet sizes have a general probability distribution. We use the M/G/1/K queueing model to analyze the throughput and the delay performance of IEEE 802.11 MAC protocol in a wireless LAN. We compare the performances of Basic access method and RTS/CTS access method. We take some numerical examples for the system throughput and the queue dynamics including the mean packet delay and packet blocking probability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.4
• /
• pp.227-236
• /
• 1986

In this paper, an integrated voice/data packet network with window flow control is modeled by a colsed multichain queueing system, and its performance is analyzed by the mean value analysis method. Particularly, for the analysis of a packet network having various kinds of messages with different priority classes, we introduce an approach based on the mean value analysis and the concept of effective capacity. By the mathematical analysis and computer simulation, we obtain the following network statistics in the steady state: Mean buffer occupancy at each node, utilization of link throughput of a virtual channel, and mean delay time of each message. Our iterative analysis method can predict the link data status in most cases within about 10 percent of accurady, and the statistics of voice messages and external data within 5 percent as compared to simulation results.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.1
• /
• pp.147-156
• /
• 2017

This paper analyzes the performance limit of WAVE system for the platooning service requirements which is referred from the de facto standards. The performance of the packet error rate and mean delay as key parameters in the wireless communication systems should be satisfied to provide safety to the platooning vehicles. The test scenarios are conducted by considering the following vehicle groups: platooning vehicles, vehicles within a hop distance and vehicles within two hop distance( called hidden node vehicles). The models of packet error rate and delay deals with the topology of aforementioned vehicle groups, vehicle speed and communication range. The numerical results are obtained in terms of packet size, packet arrival rate and data transmission rate. Finally, this paper suggests the robust range of packet error rate and delay for the WAVE system to provide the platooning vehicle service.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.930-937
• /
• 2004

In this paper, we analyze the delay performance for a Markovian source transported over a wireless channel with time-varying error characteristics. To improve the reliability of the channel, the end points of the wireless link implement a selective-repeat (SR) ARQ error control protocol. We provide an approximate discrete-time analysis of the end-to-end mean packet delay, which consists of transport and resequencing delays. Numerical results and simulations indicate that our approximate analysis is sufficiently accurate for a wide range of parameter values.

• Journal of Industrial Technology
• /
• v.23 no.A
• /
• pp.41-46
• /
• 2003

Because the quality of a radio link in real environment is generally varied with time, there is a difference between the delay in the real environment and one obtained from the analytic model where a time-varying link model is not used as a link model for a Bluetooth. This paper analyzes the transmission delay of a message in the time-varying radio link model for the Bluetooth. The time-varying radio link is modeled with a two-state Markov model. The mean transmission delay of the message is analytically obtained in terms of the arrival rate of the message, the state transition probability in the Markov model, and the packet error rate.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.9
• /
• pp.227-234
• /
• 2018

Guaranteeing the end-to-end delay deadline is an important issue for quality of service (QoS) of delay sensitive systems, such as real-time system, networked control system (NCS), and cyber-physical system (CPS). Most routing algorithms typically use the mean end-to-end delay as a performance metric and select a routing path that minimizes it to improve average performance. However, minimum mean delay is an insufficient routing metric to reflect the characteristics of the unpredictable wireless channel condition because it only represents average value. In this paper, we proposes a deadline-aware routing algorithm that maximizes the probability of packet arrival within a pre-specified deadline for CPS by considering the delay distribution rather than the mean delay. The proposed routing algorithm constructs the end-to-end delay distribution in a given network topology under the assumption of the single hop delay follows an exponential distribution. The simulation results show that the proposed routing algorithm can enhance QoS and improve networked control performance in CPS by providing a routing path which maximizes the probability of meeting the deadline.

• The Journal of the Korea Contents Association
• /
• v.8 no.6
• /
• pp.43-53
• /
• 2008

Hyper text transfer protocol (HTTP) over transmission control protocol (TCP) is currently used to transfer objects in the Internet. Stream control transmission protocol (SCTP), an alternative to TCP, which allows for independent delivery among streams, and can thus reduce the mean response delay of web object. We present an analytical model to find the mean response delay for HTTP over SCTP, therefore, estimate the effectiveness of SCTP over TCP. Typical TCP delay models assume the wired environment. On the contrary, the proposed model in this paper assumes the multiple packet losses and wireless environment where fast retransmission is not possible due to small window. The estimated mean response time can be used the benchmark to meet quality of service (QoS) at end-user. We validate the accuracy of our model using experiments. It is shown that the differences between the results from model and those from experimental are very small below 6 % on average. We also find that the mean response delay for HTTP over SCTP is less than that for HTTP over TCP.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6B
• /
• pp.523-532
• /
• 2003

GENMET(GEneralized Multihop Network) which is based on Wavelength-Division Multiplexsing(WDM) and can be used in order to construct the next generation lightwave network is a logical(virtual), packet-switched and multihop topology network. GENMET is a regular multihop network which is a generalization of Shuffle network and do Bruijn network As such, it has the advantage of simple routing which is critical in a high speed network Given a physical topology, different logical topologies can be derived for assigning wavelengths to the UserNodes. By appropriately assigning wavelengths, performance of the network, such as mean hop count, maximum throughput and mean packet delay can be improved. In this paper, we propose heuristic algorithms for effectively assigning a limited number of wavelengths to the given UserNodes. The Performance of proposed algorithm is compared with the random assignment and the lower bounds.

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

I broadband ISDN every packet will show different result if it would be processed according to its usage by the server. That is, normal data won't show big differences if they would be processed at normal speed. But it will improve the quality of service to process some kinds of data - for example real time video or voice type data or some data for a bid to by something through the internet - more fast than the normal type data. solution for this problem was suggested - priority packets. But the analyses of them are under way. Son in this paper a switching system for an output queuing model in a single server was assumed and some packets were given priorities and analysed. And correlation, simulating real life situation, was given too. These packets were analysed through three cases, first packets having no correlation, second packets having only correlation and finally packets having priority three cases, first packets having no correlation, second packets having only correlation and finally packets having priority and correlation. The result showed that correlation doesn't affect the mean delay time and the high priority packets have improved mean delay time regardless of the arrival rate. Those packets were assumed to be fixed-sized like ATM fixed-sized cell and the contention strategy was assumed to be short bus contention method for the output queue, and the mean delay length and the maximum 버퍼 length not to lose any packets were analysed.