• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.125-133
• /
• 2008

In this paper, we propose active queue management mechanism (Active-WRED) to guarantee quality of the high priority service class in multi-class traffic service environment. In congestion situation, this mechanism increases drop probability of low priority traffic and reduces the drop probability of the high priority traffic, therefore it can improve the quality of the high priority service. In order to analyze the performance of our mechanism we introduce the stochastic analysis of a discrete-time queueing systems for the performance evaluation of the Active Queue Management (AQM) based congestion control mechanism called Weighted Random Early Detection (WRED) using a two-state Markov-Modulated Bernoulli arrival process (MMBP-2) as the traffic source. A two-dimensional discrete-time Harkov chain is introduced to model the Active-WRED mechanism for two traffic classes (Guaranteed Service and Best Effort Service) where each dimension corresponds to a traffic class with its own parameters.

• The KIPS Transactions:PartC
• /
• v.16C no.3
• /
• pp.373-382
• /
• 2009

we present more efficient method of a medium access for real-time ubiquitous sensor networks. Proposed MAC protocol is like the randomized CSMA/CA protocol, but unlike previous legacy protocols, it does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports from sensor nodes, we carefully decide to select a fixed-size contention window with non-uniform probability distribution of transmitting in each slot. We show that the proposed method can offer up to several times latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using a widely-used network simulation package, NS-2. We finally show that proposed MAC scheme comes close to meet bounds on the best latency being achieved by a decentralized CSMA-based MAC protocol for real-time ubiquitous sensor networks which is sensitive to latency.

• 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.

• Journal of Advanced Navigation Technology
• /
• v.14 no.1
• /
• pp.49-56
• /
• 2010

Severe energy constraints and the low power consumption require the significance of the energy efficient error control mechanisms in wireless sensor network (WSN). In this paper, an automatic repeat request (ARQ) methodology for the analysis of error control schemes in WSN is presented such that the effects of packet length, the modulation scheme and the interference effect of the wireless channel are investigated. Moreover, an analyis of ARQ error control is provided by considering two major architectures for wireless sensor network, i.e., Mica2 and MicaZ sensor nodes. And the throughput performance of WSN with asynchronous FSK signal and DSSS-OQPSK signal with selective repeat ARQ scheme are analyzed in multiple interference environment, and the probability of receiving a correct bit and packet from target node to sink node is evaluated as a function of the channel parameter, the number of wireless sensor node, and the spreading factor.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.4
• /
• pp.120-131
• /
• 2004

In this paper, we propose the method of a motion planning generation in which the movement of the 3-link leg subsystem is constrained to a slider-link and a singular posture can be easily avoided. The proposed method is the jumping control moving in vertical direction which mimics a cat's behavior. That is, it is jumping toward wall and kicking it to get a higher-place. Considering the movement from the point of constraint mechanical system, the robotic system which realizes the motion changes its configuration according to the position and it has several phases such as; ⅰ) an one-leg phase, ⅱ) in an air-phase. In other words, the system is under nonholonomic constraint due to the reservation of its momentum. Especially, in an air-phase, we will use a control method using state transformation and linearization in order to control the landing posture. Also, an iterative learning control algorithm is applied in order to improve the robustness of the control. The simulation results for jumping control will illustrate the effectiveness of the proposed control method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2897-2908
• /
• 1996

This paper presents an effective call admission control algorithm using the Common Pool on the virtual path in ATM networks. Call admission control decides whether or not to accept a new call, so as to ensure the service quality of both individiual existing calls and of the new call itself. In the proposed algorithm, a new call is accepted when the sum of the bandwidths of existing calls and of the new call will not exceed lind capacity. If the sum of their bandwidths exceed link capacity, reserved bandwidth of Common Pool is considreed to accept the new call. Computer simulation results using a simuple network model are algorithm given to evaluate accuracy and call blocking probability by the proposed method.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.11
• /
• pp.22-33
• /
• 1999

This paper presents the method for the automatic tuning of a design weighting polynomial parameters of a generalized minimum-variance stochastic ultivariable self-tuning controller which adapts to changes in the higher order nonminimum phase system parameters with time delays and noises. The self-tuning effect is achieved through the recursive least square algorithm at the parameter estimation stage and also through the Robbins-Monro algorithm at the stage of optimizing the design weighting polynomial parameters of the controller. The proposed multivariable self-tuning method is simple and effective compared with pole restriction method. The computer simulation results are presented to adapt the higher order multivariable system with nonminimum phase and with changeable system parameters.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.12
• /
• pp.9-14
• /
• 2004

As the internet traffic type and size have bun diversified in recent years, the GMPLS-based distributed control and management protocol have surfaced as a serious issue for dynamic optical lightpath setup. In this reason, we investigated and analyzed network performance and protocols using global information-based link state approach and local information based link state approach. We calculated connection setup time, required control bandwidth and setup blocking probability that made from network update period and threshold metrics according to traffic arrival rate. The evaluated results will be used in broadband network and adopted for high speed network in the future widely.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.793-798
• /
• 2005

We focus on the RP (Rendezvous Point) system model in the multicast network based on BcN (Broadband Convergence Network) integrating broadcasting, telecommunication and Internet with one. Based on the condition multiple queues with different service and single server, when the arrivals tome in group with the site of the group geometrically distributed, we define the relationship between incoming arrival rate and corresponding buffer size. We also investigate the Profit according to both Service Provider and Network Operator Then we make a decision whether a new service request is accepted or not based on given interning rate range.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.39-44
• /
• 2003

The network performance gets down during congestion periods to solve the problem effectively. A RED(Random Earl Detection) algorithm of the queue management algorithm is proposed and IETF recommends it as a queue management. A RED algorithm controls a congestion aspect dynamically. In analyzing parameters when static value of parameter is set in the gateway cannot be handled the status of current network traffic properly We propose the Effective RED algorithm to solve with the weakness of RED In this algorithm the maximum drop probability decides to accept or drop the interning packets, is adjusted dynamically on the current queue state for controlling the congestion phase effectively in the gateway. This algorithm is confirmed by computer simulation using the NS(Network Simulator)-2.