• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.208-208
• /
• 2006

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.600-603
• /
• 2000

In this paper, we propose the design method of distributed control system using Controller Area Network (CAN). CAN is an advanced serial communication protocol for distributed real-time control systems. It is a contention-based multi-master network whose timeliness properties come from its collision resolution algorithm which gives a high schedulable utilization and guaranteed bus access latency. With proposed method using CAN, we apply to robot controller. The effectiveness of proposed method is demonstrated by the simulation and experiment.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.432-441
• /
• 2006

As the community antenna television (CATV) networks becomes ubiquitous, instead of constructing an entirely new broadband network infrastructure, it has emerged as one of the rapid and economic technologies to interconnecting heterogeneous network to provide broadband access to subscribers. How to support ubiquitous real-time multimedia applications, especially in a heavy traffic environment, becomes a critical issue in modern CATV networks. In this paper, we propose a time guaranteed and efficient upstream minislots allocation algorithm for supporting quality-of-service (QoS) traffic over data over cable service interface specification (DOCSIS) CATV networks to fulfill the needs of realtime interactive services, such as video telephony, video on demand (VOD), distance learning, and so on. The proposed adaptive fast expansion algorithm and the loading statistics with dynamic swapping algorithm have been shown to perform better than that of the multimedia cable network system (MCNS) DOCSIS.

• Journal of the Korean Society for Precision Engineering
• /
• v.11 no.4
• /
• pp.88-98
• /
• 1994

A new local path planning algorithm for free-ranging robots is proposed. Considering that a laser range finder has the excellent resolution with respect to angular and distance measurements, a simple local path planning algorithm is achieved by a directional weighting method for obtaining a heading direction of nobile robot. The directional weighting method decides the heading direction of the mobile robot by estimating the attractive resultant force which is obtained by directional weighting function times range data, and testing whether the collision-free path and the copen parthway conditions are satisfied. Also, the effectiveness of the established local path planning algorithm is estimated by computer simulation in complex environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.3
• /
• pp.456-463
• /
• 2021

In this paper, Ultra Wide-Band(UWB) radar sensor is employed to detect flying drones and avoid collision in dense clutter environments. UWB signal is preferred when high resolution range measurement is required for moving targets. However, the time varying motion of flying drones may increase clutter noises in return signals and deteriorates the target detection performance, which lead to the performance degradation of anti-collision radars. We adopt a dynamic clutter suppression algorithm to estimate the time-varying distances to the moving drones with enhanced accuracy. A modified Constant False Alarm Rate(CFAR) is developed using an adaptive filter algorithm to suppress clutter while the false detection performance is well maintained. For this purpose, a velocity dependent CFAR algorithm is implemented to eliminate the clutter noise against dynamic target motions. Experiments are performed against flying drones having arbitrary trajectories to verify the performance improvement.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.12
• /
• pp.119-126
• /
• 2009

In this paper propose a method to reduce data for collision resolution. It is to reduce a damage of the back off algorithm to apply in both wire and wireless networks. Double back off size can be work in the first and the last movement point service as a same time in IEEE 802.16. It propose of the algorithm to be suited to IEEE 802.16 for increasing network access percentage in increase a data treat, delay error range and random access over fuller condition. In the result of the computer simulation, the proposal algorism give a increasing speed more than under the this paper. From this computer simulation result, we can get the confirmation of the small loss in saturated and saturated could be a longer in last network.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.2
• /
• pp.1-8
• /
• 2004

In this paper, we proposed ARAHE(Adaptive Resource Allocation algorithm for HIPERLAN/2 with Error channel). It uses EIB(Error Indication Bits) for efficient resource allocation. We evaluate the performance of ARAHE by simulation and the result shows ARAHE has better performance than current method in the case of delay, utilization and TSR(Transmission Success Rate).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1252-1260
• /
• 1999

The HFC network has a architecture of a star topology in fiber optic trunks, and tree and branch topology is used in the part of coaxial cable. It is well known that the HFC upstream channel is noisy. Ingress, common mode distortion and impulse noise exist in the upstream channel. In order to provide Quality of Service(QoS) to users with real-time data such as voice, video and interactive services, the evolving IEEE 802.14 standard for HFC networks must include an effective priority scheme. The scheme separates and resolves collisions between stations in a priority order. It is important to simulate protocols under a practical environment. The proposed algorithm in this paper is simulated with the assumption that the collision detector made certain mistake due to noises. Simulation results show that the proposed algorithm is more efficient than existing tree-based algorithm under practical environment.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.20 no.1
• /
• pp.39-45
• /
• 2012

In the standard CFD code, Lagrangian-Eulerian method is very popular to simulate the liquid spray penetrating into gaseous phase. Though this method can give a simple solution and low computational cost, it have been reported that the Lagrangian spray models have numerical grid dependency, resulting in serious numerical errors. Many researches have shown the grid dependency arise from two sources. The first is due to unaccurate prediction of the droplet-gas relative velocity, and the second is that the probability of binary droplet collision is dependent on the grid resolution. In order to solve the grid dependency problem, the improved spray models are implemented in the KIVA-3V code in this study. For reducing the errors in predicting the relative velocity, the momentum gain from the gaseous phase to liquid particles were resolved according to the gas-jet theory. In addition, the advanced algorithm of the droplet collision modeling which surmounts the grid dependency problem was applied. Then, in order to validate the improved spray model, the computation is compared to the experimental results. By simultaneously regarding the momentum coupling and the droplet collision modeling, successful reduction of the numerical grid dependency could be accomplished in the simulation of the high-pressure injection diesel spray.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9A
• /
• pp.905-915
• /
• 2007

This paper proposes a filter-based algorithm to adaptively adjust the contention window in IEEE 802.11 DCF. The proposed mechanism is focused on the general and realistic environments that have various conditions regarding to noise, media types and network load. For this flexible adaptation, Filter-based DCF(FDCF) takes a more realistic policy such as median filter concept in the image processing technologies. We can handle these various environments by adjusting the contention window size according to the result of filtering based on history-buffer. We can ignore temporarily and randomly occurred transmission failures due to noise errors and collisions in noisy environments. In addition, by changing the reference number and history-buffer size, FDCF can be extended as a general solution including previous proposed mechanism. We have confirmed that the proposed mechanism can achieve the better performance than those of previous researches in aspects of the throughput and the delay in the realistic environments.