• 대한토목학회논문집
• /
• 제29권5D호
• /
• pp.563-570
• /
• 2009

본 연구는 신호교차로 분석시 추가지체 산정을 위하여 적용하는 초기 대기차량이 총 지체도에 얼마나 영향을 미치는지 분석하기 위한 목적으로 실시하였다. 평균교차로 지체시간을 측정하기위하여 통과차량과 대기행렬이 측정되었다. 분석결과, 시험차량의 평균 지체도가 60초/대 미만 일 경우에는 세가지 지체도 산정방법이 모두 유사한 것으로 분석되었으나, 60~70초/대는 초기 대기차량을 적용한 지체도만 시험차량의 평균지체도와 유사한 것으로 분석되었다.

• Journal of Communications and Networks
• /
• 제14권5호
• /
• pp.524-532
• /
• 2012

In this paper, we present the performance evaluation of the reliable cooperative media access control (RCO-MAC) protocol, which has been proposed in [1] by us in order to enhance system throughput in bad wireless channel environments. The performance of this protocol is evaluated with computer simulation as well as mathematical analysis in this paper. The system throughput, two types of average delays, average channel access delay, and average system delay, which includes the queuing delay in the buffer, are used as performance metrics. In addition, two different traffic models are used for performance evaluation: The saturated traffic model for computing system throughput and average channel access delay, and the exponential data generation model for calculating average system delay. The numerical results show that the RCO-MAC protocol proposed by us provides over 20% more system throughput than the relay distributed coordination function (rDCF) scheme. The numerical results show that the RCO-MAC protocol provides a slightly higher average channel access delay over a greater number of source nodes than the rDCF. This is because a greater number of source nodes provide more opportunities for cooperative request to send (CRTS) frame collisions and because the value of the related retransmission timer is greater in the RCO-MAC protocol than in the rDCF protocol. The numerical results also confirm that the RCO-MAC protocol provides better average system delay over the whole gamut of the number of source nodes than the rDCF protocol.

• Journal of Power Electronics
• /
• 제12권5호
• /
• pp.715-722
• /
• 2012

New discrete time domain models for the peak current controlled (PCC) power LED drivers in continuous conduction mode include for the first time the effects of the time delay in the pulse-width-modulator. Realistic amounts of time delay are found to have significant effects on the average output LED current and on the critical inductor value at the boundary between the two conduction modes. Especially, the time delay can provide an accurate LED current for the PCC buck converter with a wide input voltage. The models can also predict the critical inductor value at the mode boundary as functions of the input voltage and the time delay. The overshoot of the peak inductor current due to the time delay results in the increase of the average output current and the reduction of the critical inductor value at the mode boundary in all converters. Experimental results are presented for the PCC buck LED driver with constant-frequency controller.

• 산업기술연구
• /
• 제25권B호
• /
• pp.221-229
• /
• 2005

We present a numerical analysis of the optimal group number for minimizing the average paging delay. In the analysis, we consider uniform distributions for location probability conditions and apply M/D/1 queueing model to paging message queues of cells. We also get the lower bounds of group numbers and investigate the minimum transmission capacity under average paging delay constraints. Minimizing the average paging delay is important because it means minimizing the amount of bandwidth used for locating mobile terminals. Therefore, the numerical results of this paper will be very useful in PCS system when designing its signalling capacity due to its simplicity and effectiveness.

• 대한교통학회지
• /
• 제10권1호
• /
• pp.41-54
• /
• 1992

The purpose of this thesis is to construct a model to estimate the delay that vehicles arriving randomly will be experienced at an isolated singalized intersection. To do this the following objectives are set in this study: (i) An what distance a random arrival pattern occurs after a platoon of vehicles are dis-charged from the stop line; (ii) A model which estimates the average delay per through-vehicle with respect to the de-gree of saturation; and (iii) The relation between the stepped delay and average approach delay per vehicle. The following are the findings of this study: (i) A random arrival pattern on the first second and third lanes occur 300,400 and 300m downstream from stop line rdspectively. A random arrival pattern on lane group occurs 500m downstream from the stop line ; (ii) A model for the estimation of approach delay has been developed in such a way that up to x=0.7 the delay increases linearly and beyond 0.7 the delay increases rapidly in a form of second order polynomial due to high degree of saturation : and (iii) Approach delay equals approximately 1.21 times of stopped delay.

• Journal of Communications and Networks
• /
• 제10권1호
• /
• pp.28-37
• /
• 2008

In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink channels. We design a scheduler that selects a user for transmission and determines the transmission rate of the selected user based on the channel and backlog information of users. Since it requires prohibitively high computation complexity to determine an optimal scheduler for multi-user systems, we propose a low-complexity scheduling scheme that can achieve near-optimal performance. In this scheme, we reduce the complexity by decomposing the multiuser problem into multiple individual user problems. We arrange the probability of selecting each user such that it can be determined only by the information of the corresponding user and then optimize the transmission rate of each user independently. We solve the user problem by using a dynamic programming approach and analyze the upper and lower bounds of average transmission power and average delay, respectively. In addition, we investigate the effects of the user selection algorithm on the performance for different channel models. We show that a channel-adaptive user selection algorithm can improve the energy efficiency under uncorrelated channels but the gain is obtainable only for loose delay requirements in the case of correlated channels. Based on this, we propose a user selection algorithm that adapts itself to both the channel condition and the backlog level, which turns out to be energy-efficient over wide range of delay requirement regardless of the channel model.

• Structural Engineering and Mechanics
• /
• 제82권4호
• /
• pp.445-458
• /
• 2022

Some of the control systems used in engineering structures that use sensors and decision systems have some time delay reducing efficiency of the control system or even might make it unstable. In this research, in addition to considering the effect of the time delay in vibration control process, predictive control is used to compensate the time delay. A semi-active vibration control approach with the help of magneto-rheological dampers is implemented. In addition to using fuzzy inference system to determine the appropriate control voltage for MR damper, structural behavior prediction system and specifying future responses are also used such that the time delays occurring within control process are overcome. For this purpose, determination of prediction horizon is conducted for one, five, and ten steps ahead for single degree of freedom structures with periods ranging from 0.1 to 4 seconds, subjected to twenty earthquake excitations. The amount of time delay applied to the control system is 0.1 seconds. The obtained results indicate that for 0.1 second time delay, average prediction error values compared to the case without time delay is 3.47 percent. Having 0.1 second time delay in a semi-active control system reduces its efficiency by 11.46 percent; while after providing the control system with structure behavior prediction, the difference in the results for the control system without time delay is just 1.35 percent on average; indicating a 10.11 percent performance improvement for the control system.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.225-227
• /
• 2004

A sensor networkis composed of a large number of sensor nodes, which are densely deployed either inside the phenomenon or very close to it. One of the most important constraints on sensor nodes is the low power consumption requirement. Sensor nodes carry limited, generally irreplaceable, power sources. Therefore, while traditional networks aim to achieve high quality of service (QoS) provisions, sensor network protocols must focus primarily on power conservation. This paper presents the characteristics of energy consuming, average delay in 802.11 MAC, S-MAC that is specifically designed for wireless sensor networks. We analyze the energy consuming state in the 802.11 MAC in the simulation topology nodes, and measure average delay in 802.11 and S-MAC. Energy efficiency is the primary goal in this protocol design. 802.11 MAC is more efficient than S-MAC in the average delay, throughput. However S-MAC is an energy efficient protocol, a tradeoff between energy efficiency and delay.

• 한국경영과학회지
• /
• 제38권3호
• /
• pp.37-50
• /
• 2013

The purpose of this study is to determine the indicators and the criteria to classify types of train delays of high-speed rail in South Korea. Types of train delays have divided into the chronic delays and the knock-on delays. The Indicators based on relevance, reliability, and comparability were selected with arrival delay rate of over five minutes, median of arrival delays of preceding train and following train, knock-on delay rate of over five minutes, correlation of delay between preceding train and following train on intermediate and last stations, average train headway, average number of passengers per train, and average seat usages. Types of train delays were separated using the Ward's hierarchical cluster analysis. The criteria for classification of train delay were presented by the Fisher's linear discriminant. The analysis on the situational characteristics of train delays is as follows. If the train headway in last station is short, the probability of chronic delay is high. If the planned running times of train is short, the seriousness of chronic delay is high. The important causes of train delays are short headway of train, shortly planned running times, delays of preceding train, and the excessive number of passengers per train.

• 전자공학회논문지A
• /
• 제33A권6호
• /
• pp.23-32
• /
• 1996

This paper proposes a new buffer management scheme to service delay-sensitive traffic and loss-sensitive traffic fairly in ATM networks. The proposed scheme uses tow buffers for delay-sensitive traffic and loss-sensitive traffic. To satisfy the average delay time of delay-sensitive traffic, cells in real-time buffer are served first. When congestion occurs in nonreal-time buffer, low loss priority cell in real-time buffer can be pushed out by high loss priority cell in nonreal-time buffer can be transferred to real-time buffer considering threshold value in real-time buffer. Using computer simulation, the existing methods and proposed scheme are compared and analyzed with respect to cell loss rate and average delay time. Simulation results show that the proposed scheme have superior performance to conventional schemes.