• Proceedings of the KIEE Conference
• /
• 2015.07a
• /
• pp.1389-1390
• /
• 2015

본 논문에서는 선도-추종자 로봇의 대형을 유동적으로 변형하며 장애물을 효과적으로 회피하는 방법을 제안한다. 로봇이 장애물을 회피함에 있어서 고정된 대형으로 이동하는데 어려운 문제가 발생한다. 본 논문에서는 이러한 문제점을 해결하기위해 장애물 회피시 선도로봇의 방향각과 위치, 선도로봇과 추종자 로봇의 거리를 이용하여 대형을 유동적으로 변형하여 장애물과의 충돌을 회피하는 방법을 사용하고 로봇의 경로계획을 위하여 포텐셜 필드 알고리즘을 사용하였다. 본 논문에서는 Matlab을 이용한 모의실험을 통하여 제안된 방법의 성능을 확인하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2017.11a
• /
• pp.21-23
• /
• 2017

본 논문에서는 스펙트럼 감지 무선 인지 네트워크에서 동기화 에러가 존재하는 환경을 고려한다. 동기화에러가 존재 할 때 주어지는 오검출 확률(miss detection probability)을 이용하여 일차 사용자와 이차 사용자들 간의 충돌 확률(collision probabliyt)를 유도한다. 유도된 수식을 몬테 카를로 모의실험(Monte Carlo simulation)을 통해 확인한다.

• Journal of the Korean Society for Railway
• /
• v.6 no.1
• /
• pp.15-20
• /
• 2003

The computer simulation techniques were adopted to evaluate the effects of seating positions of passenger under various accident scenarios. The baseline of computer simulation model was tuned by the sled impact tests which conducted under the upright and standard seating positions. This study shows the effect of relative velocity between occupant and struck vehicle while occupant is impacted to a front seat's seatback. Although, base on the current accident scenarios, The KHST is performed well enough to protect average adult male occupants. However, Results from the tests indicate small size occupant or higher impact speed may cause sever neck and femur injuries.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.231-234
• /
• 2001

본 논문은 다단계 상호연결망에서 높은 처리율과 결함 허용을 위해 중복 경로를 제공하는 E-Cube-network 구조를 제안한다. Cube network의 확장된 형태인 E(Extended)-Cube network 구조를 통해 패킷 전송중 충돌이 발생한 경우 스위치 자신을 순환하고, 재차 충돌이 발생하면 멀티플렉서를 통해 또 다른 새로운 경로로 패킷을 전송하는 새로운 알고리즘을 제시한다. 그리고 모의실험을 통해 기존의 Cube network 구조보다 높은 종단간 처리율을 보인다.

• The KIPS Transactions:PartD
• /
• v.8D no.1
• /
• pp.10-23
• /
• 2001

Transactions in real-time active databases have the notion of activeness where transactions are generated by external effects and another transaction. In this paper, we propose the multi version concurrency control algorithm for real-time active transactions. A real-time active transaction has a timing constraint in the form of a deadline until which the user wants to complete the transaction, and is characterized by triggering relationships which mean that association between a transaction that triggers the execution of another transaction and the triggered transaction. The triggering relationship is an important factor to resolve data conflicts among real-time active transactions. The proposed concurrency control mechanism resolves data conflicts by considering triggering relationships between conflicting transactions as well as priorities and precedence relationships. The conflict resolution mechanism considers association types of the triggering relationship such as abort and commit dependency, and then resolves data conflicts in favor of higher priority transactions. We also present the experimental results of our algorithm comparing other real-time active concurrency control algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.321-328
• /
• 2010

This paper presents a coordinator-based TDMA reader protocol that can avoid the reader collision in a passive RFID system. In the proposed protocol, the coordinator can not only minimize the number of empty slots by efficiently allocating slots to readers incoming in Poisson distribution, but reduce latency time through the limited frame size. The proposed protocol can be implemented in either mobile or fixed mode through the slot structure to be described in the context. The simulation results show it works as suggested and the frame size limitation as well as the statistical distribution of incoming readers has a great impact on the overall slots and the average latency time.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.157-159
• /
• 2014

전술데이터링크는 전장 환경에서 모든 플랫폼들을 네트워크를 통해 하나로 묶어 전쟁 효과를 극대화할 수 있는 기반이 되는 통신 기술이다. 이러한 전술데이터링크의 원활한 운영을 위해 플랫폼간 시간 동기가 필수적이며, 대부분 GPS(Global Positioning System)를 사용하고 있다. 전세계적으로 가장 널리 사용되고 있는 전술데이터링크인 Link-16 에서는 네트워크에 가입하면서 NTR(Network Time Reference) 과의 시간을 동기화하는 절차를 제공한다. 이러한 시간 동기 절차는 대략적인 동기와 정밀한 동기의 두 단계로 구분된다. 대략적인 동기는 프레임이 시작하는 첫 타임 슬롯에서 주변 노드로부터 IEM(Initial Entry Message)을 수신하여 전송 시간만큼의 오류를 포함하는 시간 동기 방식이다. 본 논문에서는 모의 실험을 통해 IEM 을 전송하는 노드의 거리에 따른 메시지의 충돌 확률을 구하고, 그 충돌 확률에 따라 시간 동기에 소요되는 시간으로 Link-16 의 시간 동기 성능을 분석하였다.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2001.04a
• /
• pp.34-39
• /
• 2001

The median barrier is one of the roadside hardware to prevent severe human and property damage from highway traffic accidents. The foreign standard of concrete median barrier was introduced and implemented without modification fitting to domestic vehicle and highway condition. In a car accident, median barrier doesn't protect vehicle effectively, especially for heavy vehicle such as bus and heavy truck. The purpose of this study is to develop the optimal performance design of concrete median barrier using the design of experiment with crash simulation analysis which is done by Pam-Crash that is one of the commercial crash simulation software. As a result of this study, an optimal design of concrete median barrier is obtained considering von Mises stress, volume and COG acceleration of truck.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5A
• /
• pp.460-466
• /
• 2007

There are two coordination functions in IEEE 802.11 standard. One is PCF, polling based function, and the other is DCF, contention based function. DCF is simpler than PCF but the performance is similar with the latter. That's the reason why DCF is more popular than PCF. However, DCF has a risk of collision with other nodes in the network because the function is a distributed contention based one. CSMA/CA of DCF has collision avoidance algorithm in it, but the performance of avoidance algorithm has limitations. In this paper we proposed a new scheme called TAR(Tone-based Access scheme with Repetitive conention). In TAR, there is narrow contention-only channel other than original data transmitting channel, so that both a data transmission and the contention can be performed simultaneously. The TAR uses the same contention concept with the CSMA/CA, but it has the originality for the narrow contention channel and the repetitive contention scheme which greatly reduce the collision probability. We proved the performance of TAR by some simulations, and it showed good results.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.48-55
• /
• 2009

In this paper, We propose Adaptive Group Separation algorithm for efficient RFID system AGS algorithm determines the optimized initial prefix size j, and divides the group of. A reader requests the group and searches the tag ID. If a tag collision occurred, reader adds a one bit, '0' or '1' at first bit of collision point, As a result we observe that transmitted data bits and the recognition time are decreased. The proposed algorithms have been verified by computer simulation. The performance of the proposed anti-collision algorithm is evaluated in terms of the number of repetitions and the amount of transmission bits according to the in crease of the number of tags is 256. The AGS algorithm improve the number of repetitions by about 32.3% and reduce tile amount of the transmission bits by about 1/40 than slotted binary tree algorithm.