• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3A
• /
• pp.261-270
• /
• 2007

The Delay Threshold-based Priority Queueing (DTPQ) scheme has been shown useful for scheduling both real-time (RT) and non-real-time (NRT) service traffic in mobile broadband wireless access (MBWA) systems. The overall system capacity can be maximized subject to their QoS requirement by the DTPQ scheme, which takes the urgency of the RT service into account only when their head-of-line (HOL) packet delays exceed a given delay threshold. In practice, the optimum delay threshold must be configured under the varying service scenarios and a corresponding traffic load, e.g., the number of RT and NRTusers in the system. In this paper, we propose an adaptive version of DTPQ scheme, which updates the delay threshold by taking the urgency and channel conditions of RT service users into account. By evaluating the proposed approach in an orthogonal frequency division multiple access/time division duplex (OFDM/TDD)-based broadband mobile access system, it has been found that our adaptive scheme significantly improves the system capacity as compared to the existing DTPQ scheme with a fixed delay threshold.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.6
• /
• pp.213-224
• /
• 2003

The proposed algorithm can always set up the optimal threshold value regardless of channel characteristics using an adaptive threshold establishment method that determines the threshold level according to channel noise power, and then it uses the specially designed training symbols that can make the algorithm's estimation performance be less sensitive to power delay profile variation in a multipath channel. In result, the estimation performance of the proposed technique is less affected by channel characteristic variation.

• Journal of Electrical Engineering and Technology
• /
• v.2 no.4
• /
• pp.420-427
• /
• 2007

This paper highlights the comparison of a proposed methods named adaptive undervoltage load shedding based PTSI techniques for undervoltage load shedding and two previous methods named Fixed Shed Fixed Delay (FSFD) and Variable Shed Variable Delay (VSVD) for avoiding voltage collapse. There are three main area considerations in load shedding schemes as the amount of load to be shed, the timing of load shedding event, and the location where load shed is to be shed. The proposed method, named as adaptive UVLS based PTSI seem to be most appropriate among the uncoordinated schemes. From the simulation result can be shown the Adaptive UVLS based PTSI give faster response, accurate and very sensitive control for the UVLS control technique. This technique is effectively when calculating the amount to be shed. Therefore, it is possible to bring the voltage to the threshold value in one step. Thus, the adaptive load shedding can effectively reduce the computational time for control strategy.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.802-805
• /
• 2005

A dynamic bandwidth allocation (DBA) scheme, an inter -optical network unit (ONU) bandwidth scheduling, is presented to provide quality of service (QoS) to different classes of packets in Ethernet passive optical networks (EPONs). This scheme, referred to as TADBA, is based on efficient threshold reporting from, and adaptive polling order rearranging of, ONUs. It has been shown that the network resources are efficiently allocated among the three traffic classes by guaranteeing the requested QoS, adaptively rearranging the polling orders, and avoiding nearly all fragmentation losses. Simulation results using an OPNET network simulator show that TADBA performs well in comparison to the available allocation scheme for the given parameters, such as packet delay and channel utilization.

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

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.11
• /
• pp.962-966
• /
• 2001

The major problem at a branch point for point-to-multipoint available bit rate(ABR) services in asynchronous transfer mode (ATM) networks is how to consolidate backward resource management(BRM) cells from each branch for a multicast connection. In this paper, we propose an efficient feedback consolidation algorithm based on an adaptive dynamic threshold(ADT) to eliminate the consolidation noise and the reduce the consolidation delay. The main idea of the ADT algorithm lies in that each branch point estimates the ABR traffic condition of the network through the virtual queue estimation and the transmission threshold of the queue level in branch points is adaptively controlled according to the estimation. Simulation results show that the proposed ADT algorithm can achieve a faster response in congestion status and a higher link utilization compared with the previous works.

• Journal of KIISE
• /
• v.42 no.12
• /
• pp.1495-1502
• /
• 2015

Data compression involves a trade-off between delay time and data size. Greater delay times require smaller data sizes and vice versa. There have been many studies performed in the field of wireless sensor networks on increasing network life cycle durations by reducing data size to minimize energy consumption; however, reductions in data size result in increases of delay time due to the added processing time required for data compression. Meanwhile, as energy generation occurs periodically in solar energy-based wireless sensor networks, redundant energy is often generated in amounts sufficient to run a node. In this study, this excess energy is used to reduce the delay time between nodes in a sensor network consisting of solar energy-based nodes. The energy threshold value is determined by a formula based on the residual energy and charging speed. Nodes with residual energy below the threshold transfer data compressed to reduce energy consumption, and nodes with residual energy above the threshold transfer data without compression to reduce the delay time between nodes. Simulation based performance verifications show that the technique proposed in this study exhibits optimal performance in terms of both energy and delay time compared with traditional methods.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.4
• /
• pp.258-264
• /
• 2004

This paper propose a method that GOP structure based on the picture complexity change realtime adaptive without pre-analysis or time delay. Proposed algorithm calculates the complexity of pictures at first, and the ratio of the complexity( X$\sub$p/ /X$\sub$i/) between P picture and I picture is calculated. The suitable M value for the three picture select by comparing with predetermined threshold. Used bit and vbv_delay the value of GOP is calculated according to selected M. Experimental results show that the prediction error is reduce than the fixed GOP structure. Since the complexity distribution of the sequence is different, applied limits of threshold value is changed, also.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.10
• /
• pp.2419-2424
• /
• 2013

In a conventional MOG algorithm, a small threshold for background decision causes the background recognition delay in a periodic background and a large threshold makes it recognize passing objects as background in a stationary background. This paper proposes the improved MOG algorithm using adaptive threshold. The proposed algorithm estimates changes of weight in the dominant model of the MOG algorithm both in the short and long terms, classifies backgrounds into the stationary and periodic ones, and assigns proper thresholds to them. The simulation results show that the proposed algorithm decreases the maximum number of frame in background recognition delay from 137 to 4 in the periodic background keeping the equal performance with the conventional algorithm in the stationary background.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.3
• /
• pp.389-395
• /
• 2013

Ethernet is the most widely deployed access network protocol around the world. IEEE 802.3az WG released the EEE standard based on LPI mode to improve the energy efficiency of Ethernet. This paper proposes improved adaptive power control mechanism that can enhance energy-efficiency based on EEE from small Ethernet switch. The feature of this mechanism is that it predicts the traffic characteristic of next cycle by measuring the amount of traffic flowing in during certain period and adjusts the optimal threshold value to relevant traffic load. Performance evaluation results indicate that the proposed mechanism improves overall performance compared to traditional mechanism, since it significantly reduces energy consumption rate, even though average packet delay increases a little bit.