• Journal of international Conference on Electrical Machines and Systems
• /
• v.1 no.1
• /
• pp.114-120
• /
• 2012

Eco-driving technique for electric vehicles (EVs) is investigated in this paper. Many findings on EVs have been reported; however, they did not deal with eco-driving from the viewpoint of theoretical study. The authors have developed an energy-saving driving technique - the so-called "eco-driving" technique based on dynamic programming (DP). Optimal speed profile of an EV, which minimizes the amount of total energy consumption, was determined under fixed origin and destination, running time, and track conditions. DP algorithm can deal with such complicated conditions and can also derive the optimal solution. Using the proposed method, simulations were run for some cases. In particular, the author ran simulations for the case of a gradient road with a traffic signal. The optimization model was solved with MATLAB.

• Journal of information and communication convergence engineering
• /
• v.22 no.3
• /
• pp.207-214
• /
• 2024

In wireless sensor networks, the implementation of routing protocols is crucial owing to their limited computational capacities. Tree routing is a suitable method in wireless sensors owing to its minimal routing overhead. However, single-hop metric schemes, such as hop count, cause congestion at specific nodes, whereas multiple metric schemes cannot control dynamically changing network environments. To address these issues, we propose a scheme to implement enhanced tree routing with adaptive metrics based on hop count. This approach assigns different weights to metrics to select suitable parent nodes based on hop count. The parent-selection algorithm utilizes hop count, buffer occupancy, and received signal strength indicator (RSSI) as metrics. This study evaluates the performance through simulation scenarios to analyze whether improvements can be made to address problems encountered in traditional tree routing. The performance metrics include packet delivery speed, throughput, and end-to-end delay, which vary depending on the volume of network traffic.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.23 no.4
• /
• pp.16-36
• /
• 2024

This study, developed a dynamic hard shoulder running(HSR) algorithm that includes ending speed and minimum operation time in addition to the starting speed for HSR, and presented an operation plan. The first stage of the algorithm was red, which means vehicles are prohibited from HSR. The second stage is red/amber, in which drivers are notified of HSR, and operators are given time to check whether there is any obstacle to HSR. Stage 3 is green, which vehicles are permitted for HSR. Stage 4 is amber, in which a signal is given to drivers that the end of HSR is imminent. In addition, a minimum time is applied to green and red, but if congestion is severe, red is terminated early to prevent congestion from worsening. The upstream and downstream traffic flow is managed stably through main line ramp metering and lane number matching. The operating standard speed reflects the characteristics of vehicles and drivers, and based on simulation results, 7090 was selected as the optimal operating standard speed considering traffic flow and safety aspects. Therefore it is desirable to apply the travel time divided by the minimum speed of the HSR link as the minimum operating time in order to ensure continuity of traffic flow

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.6
• /
• pp.413-421
• /
• 2015

Regularized Blind Deconvolution is a problem applicable in degraded images in order to bring the original image out of blur. Multichannel blind Deconvolution considered as an optimization problem. Each step in the optimization is considered as variable splitting problem using an algorithm called Alternating Minimization Algorithm. Each Step in the Variable splitting undergoes Augmented Lagrangian method (ALM) / Bregman Iterative method. Regularization is used where an ill posed problem converted into a well posed problem. Two well known regularizers are Tikhonov class and Total Variation (TV) / L2 model. TV can be isotropic and anisotropic, where isotropic for L2 norm and anisotropic for L1 norm. Based on many probabilistic model and Fourier Transforms Image deblurring can be solved. Here in this paper to improve the performance, we have used an adaptive regularization filtering and isotropic TV model Lp norm. Image deblurring is applicable in the areas such as medical image sensing, astrophotography, traffic signal monitoring, remote sensors, case investigation and even images that are taken using a digital camera / mobile cameras.

• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.370-382
• /
• 2013

Distributed massive MIMO systems, which have high bandwidth efficiency and can accommodate a tremendous amount of traffic using algorithms such as zero-forcing beam forming (ZFBF), may be deployed in large public venues with the antennas mounted under-floor. In this case the channel gain matrix H can be modeled as a multi-banded matrix, in which off-diagonal entries decay both exponentially due to heavy human penetration loss and polynomially due to free space propagation loss. To enable practical implementation of such systems, we present a multi-banded matrix inversion algorithm that substantially reduces the complexity of ZFBF by keeping the most significant entries in H and the precoding matrix W. We introduce a parameter p to control the sparsity of H and W and thus achieve the tradeoff between the computational complexity and the system throughput. The proposed algorithm includes dense and sparse precoding versions, providing quadratic and linear complexity, respectively, relative to the number of antennas. We present analysis and numerical evaluations to show that the signal-to-interference ratio (SIR) increases linearly with p in dense precoding. In sparse precoding, we demonstrate the necessity of using directional antennas by both analysis and simulations. When the directional antenna gain increases, the resulting SIR increment in sparse precoding increases linearly with p, while the SIR of dense precoding is much less sensitive to changes in p.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.19 no.2
• /
• pp.47-55
• /
• 2023

Recently, Sensor technologies are emerging to prevent traffic accidents and support safe driving in complex environments where human perception may be limited. The UWS is a technology that uses an ultrasonic sensor to detect objects at short distances. While it has the advantage of being simple to use, it also has the disadvantage of having a limited detection distance. The LDWS, on the other hand, is a technology that uses front image processing to detect lane departure and ensure the safety of the driving path. However, it may not be sufficient for determining the driving environment around the vehicle. To overcome these limitations, a system that utilizes FMCW radar is being used. The BSD radar system using FMCW continuously emits signals while driving, and the emitted signals bounce off nearby objects and return to the radar. The key technologies involved in designing the BSD radar system are tracking algorithms for detecting the surrounding situation of the vehicle. This paper presents a tracking algorithm for designing a BSD radar system, while explaining the principles of FMCW radar technology and signal types. Additionally, this paper presents the target tracking procedure and target filter to design an accurate tracking system and performance is verified through simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.179-182
• /
• 2008

It needs to consider of turns during a path-finding on real road network. Because a car is delayed by waiting a traffic signal and decreasing speed when drived in a turn road such as cross road and slip road. If a straightness of a path is increased, a real cost of traveling should be able to decrease. An older method, the algorithm with Turn Heuristic, considered of this case. The algorithm, that differently gave weights to left, right and U-turns, improved a straightness of a path, but increased a cost of exploring. In this paper, we propose a improved Turn Heuristic Algorithm. Proposed algorithm uses Dynamic Turn Heuristic. It is able to more decrease a cost of exploring than older method by using the Turn Heuristic in a part of path-finding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12A
• /
• pp.1009-1018
• /
• 2003

A new fading channel estimation technique is proposed for an OFDM based modem In the ITS system. The algorithm is based on the transfer function extraction of the channel using the pilot signals and compensated the channel preceding the equalization. The newly derived algorithm is division-free arithmetic operations allows the faster circuit operation and the smaller circuit size. Proposed techniques compensate firstly the distortion which is generated at fading channels and secondly eliminate inter-symbol interference. All algorithms are suitability estimated and improved for a system implementation using digital circuits. As the results, the circuit size is reduced by 20% of the conventional design and achieved about 10% performance improvement at low SNR under 10dB in case of ITS system adapted 16-QAM mode.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.10
• /
• pp.1-8
• /
• 2023

If there is a defect in the wheel bearing, which is a major part of the car, it can cause problems such as traffic accidents. In order to solve this problem, big data is collected and monitoring is conducted to provide early information on the presence or absence of wheel bearing failure and type of failure through predictive diagnosis and management technology. System development is needed. In this paper, to implement such an intelligent wheel hub bearing maintenance system, we develop an embedded system equipped with sensors for monitoring reliability and soundness and algorithms for predictive diagnosis. The algorithm used acquires vibration signals from acceleration sensors installed in wheel bearings and can predict and diagnose failures through big data technology through signal processing techniques, fault frequency analysis, and health characteristic parameter definition. The implemented algorithm applies a stable signal extraction algorithm that can minimize vibration frequency components and maximize vibration components occurring in wheel bearings. In noise removal using a filter, an artificial intelligence-based soundness extraction algorithm is applied, and FFT is applied. The fault frequency was analyzed and the fault was diagnosed by extracting fault characteristic factors. The performance target of this system was over 12,800 ODR, and the target was met through test results.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.12 s.354
• /
• pp.53-60
• /
• 2006

Handover of WiBro is based on 802.16e hard handover scheme. When PSS is handover, it is handover that confirm neighbor's cell condition and RAS ID in neighbor advertisement message. Serving RAS transmits HO-notification message to neighbor RAS. Transmiting HO-notification message to neighbor RAS, it occurs many signaling traffics. Also, When WiBro is handover, It occurs many packet loss. Therefore, user suffer service degradation. LPM handover is supporting seamless handover because it buffers data packets during handover. So It is proposed scheme that predicts is LPM handover and reserves target RAS with pre-authentication. These schemes occur many signaling traffics. In this paper, we propose PSS Movement Prediction to solve signaling traffic. Target RAS is decided by old data in history cache. When serving RAS receives HO-notification-RSP message to target RAS, target RAS inform to crossover node. And crossover node bicast data packet. If handover is over, target RAS forward data packet. Therefore, It reduces signaling traffics but increase handover success rate. When history cache success, It decrease about 48% total traffic. But When history cache fails, It increase about 6% total traffic