• 한국도로학회논문집
• /
• 제17권5호
• /
• pp.93-103
• /
• 2015

PURPOSES : The purpose of this study is to present a linear programing optimization model for the design of lane-based lane-uses and signal timings for an isolated intersection. METHODS: For the optimization model, a set of constraints for lane-uses and signal settings are identified to ensure feasibility and safety of traffic flow. Three types of objective functions are introduced for optimizing lane-uses and signal operation, including 1) flow ratio minimization of a dual-ring signal control system, 2) cycle length minimization, and 3) capacity maximization. RESULTS : The three types of model were evaluated in terms of minimizing delay time. From the experimental results, the flow ratio minimization model proved to be more effective in reducing delay time than cycle length minimization and capacity maximization models and provided reasonable cycle lengths located between those of other two models. CONCLUSIONS : It was concluded that the flow ratio minimization objective function is the proper one to implement for lane-uses and signal settings optimization to reduce delay time for signalized intersections.

• 한국도로학회논문집
• /
• 제15권6호
• /
• pp.125-133
• /
• 2013

PURPOSES : The purpose of this study is to propose delay-minimizing operation methodology of a signalized intersection based upon optimization of lane-uses on approaching lanes for an intersection. METHODS : For the optimization model of lane-uses, a set of constraints are set up to ensure feasibility and safety of the lane-uses, traffic flow, and signal settings. Minimization of demand to saturation flow ratio of a dual-ring signal control system is introduced to the objective function for delay minimization and effective signal operation. Using the optimized lane-uses, signal timings are optimized by delay-based model of TRANSYT-7F. RESULTS : It was found that the proposed objective function is great relation with delay time for an intersection. From the experimental results, the method was approved to be effective in reducing delay time. Especially, cases for two left-turn lanes reduced greater delays than those for a left turn lane. It is noticed that the cases for different traffic volume by approach reduced greater delays than those for the same traffic volume by approach. CONCLUSIONS : It was concluded that the objective function is proper for lane-uses optimizing model and the operation method is effective in reducing delay time for signalized intersections.

• ETRI Journal
• /
• 제45권1호
• /
• pp.45-59
• /
• 2023

In this paper, to optimize the average delay and power allocation (PA) for system users, we propose a resource scheduling scheme for wireless networks based on Cyclic Prefix Orthogonal Frequency Division Multiplexing (CP-OFDM) according to the first fifth-generation standards. For delay minimization, we solve a throughput maximization problem that considers CPOFDM systems with carrier aggregation (CA). Regarding PA, we consider an approach that involves maximizing goodput using an effective signal-to-noise ratio. An algorithm for jointly solving delay minimization through computation of required user rates and optimizing the power allocated to users is proposed to compose the resource allocation approach. In wireless network simulations, we consider a scenario with the following capabilities: CA, 256-Quadrature Amplitude Modulation, millimeter waves above 6 GHz, and a radio frame structure with 120 KHz spacing between the subcarriers. The performance of the proposed resource allocation algorithm is evaluated and compared with those of other algorithms from the literature using computational simulations in terms of various Quality of Service parameters, such as the throughput, delay, fairness index, and loss rate.

• Journal of information and communication convergence engineering
• /
• 제5권1호
• /
• pp.54-58
• /
• 2007

A real-time frame-layer rate control algorithm with a token bucket traffic shaper is proposed for distortion variation minimization. The proposed rate control method uses a non-iterative optimization method for low computational complexity, and performs bit allocation at the frame level to minimize the average distortion over an entire sequence as well as variations in distortion between frames. The proposed algorithm does not produce time delay from encoding, and is suitable for real-time low-complexity video encoder. Experimental results indicate that the proposed control method provides better visual and PSNR performances than the existing rate control method.

• 한국통신학회논문지
• /
• 제36권12B호
• /
• pp.1548-1555
• /
• 2011

UDSM(Ultra Deep SubMicron)기술을 이용한 시스템 온-칩 설계 시 가창 중요한 설계 요소는 버스 상에서의 전력소모와 지연시간을 최소화 하는 것이다. 인접한 선에서 발생되는 crosstalk는 전파 지연을 발생시키는데 지대한 영향을 미치며, 이를 제거하거나 최소화 시키는 일은 SoC(System on a Chip) 설계에서 시스템의 신뢰성 및 성능 향상과 직결된다. 기존의 방법들은 주로 crosstalk 지연이나 버스 스위칭 횟수 중 하나 만을 최소화하는 방법이 제안되었다. 본 논문에서는 인코딩 적용 4 비트 클러스터 상의 버스 스위칭 횟수에 따라 crosstalk과 스위칭 횟수를 동시에 최소화 할 수 있도록 "invert" 기능과 "logic-convert" 기능을 적응적으로 선택하는 새로운 인코딩 기법을 제안한다. 실험결과 제안한 버스 인코딩 기법은 완벽하게 crosstalk 지연를 제거한 반면, 기존의 다른 방법들에 비해 25% 이상 전력을 절약하였음을 보여준다.

• 대한전기학회논문지
• /
• 제35권11호
• /
• pp.503-510
• /
• 1986

A new algorithm based on the concept of prediction error minimization is suggested to estimate the time varying delay in discrete processes. In spite of the existence of the stochastic noise, this algorithm can estimate time varying delay accurately. Computation time of this algorithm is far less than that of the previous extended parameter methods. With the use of this algorithm, generalized minimum variance control shows good control behavior in simulations.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.621-622
• /
• 2008

When exchanging user data between nodes in a hierarchical conference system using the endpoint mixing scheme, the hierarchical structure may cause extra delay. The algorithm[1] was proposed for minimizing the media delay between the number of the neighboring nodes. In this paper, we implement a hierarchical conference with SIP protocol based on the algorithm.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.388-391
• /
• 1999

This Paper presents an efficient algorithm that minimizes the area of the combinational system through cell replacement. During the minimization, it maintains the circuit speed same. For the minimization, the proposed algorithm defines the criticality of each cell, based on the critical delay and the number of paths passing through the cell. Then, it visits the cells of the system, one by one, from the one with the lowest criticality, and replaces it with the minimum area cell that satisfies the delay constraint. Experimental results, using the LGsynth91 benchmark circuits synthesized by misII, show that the proposed algorithm reduces the circuit area further by 17.54% on the average without sacrificing the circuit speed.

• 한국통신학회논문지
• /
• 제22권12호
• /
• pp.2626-2634
• /
• 1997

The purpose of multicasting is to reduce the network costs for transmitting the same traffic to multiple destinations. In this paper, an efficient delay-bounded multicasting routing algorithm is proposed, which satistifies the network conditions of cost minimization and can adjust the dynamic events, such as 'leave and/or join ones' from the multicast group. Also, our algorithm is designed for various network requirements such as the efficiet dynamic group support, high-quality data distribution, and adaptability to variable situation. After the delay tolerance and the maximum group size are determined according to network state and requirements for delay and cost, the dynamic delay-bounded multicast tree is constructed using partial multicast routing. We evaluate the performance of the proposed algorithm by running simulations on randomly generated test networks using a Sun Sparc 20 workstation. We were able to obtain good simulation resutls, which means solutions that lies between the minimum cost solution and the minimum delay one.

• International journal of advanced smart convergence
• /
• 제7권4호
• /
• pp.19-26
• /
• 2018

One of the distinct features of Wireless Sensor Networks (WSNs) is duty cycling mechanism, which is used to conserve energy and extend the network lifetime. Large duty cycle interval introduces lower energy consumption, meanwhile longer end-to-end (E2E) delay. In this paper, we introduce an energy consumption minimization problem for duty-cycled WSNs. We have applied Q-learning algorithm to obtain the maximum duty cycle interval which supports various delay requirements and given Delay Success ratio (DSR) i.e. the required probability of packets arriving at the sink before given delay bound. Our approach only requires sink to compute Q-leaning which makes it practical to implement. Nodes in the different group have the different duty cycle interval in our proposed method and nodes don't need to know the information of the neighboring node. Performance metrics show that our proposed scheme outperforms existing algorithms in terms of energy efficiency while assuring the required delay bound and DSR.