• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.16-18
• /
• 2006

RFID는 RF신호를 이용하여 물체에 부착된 태그(tag)를 읽어 물체를 식별하는 비 접촉 인식 기술이다. RFID 리더의 식별영역에 여러 개의 태그가 있는 경우 이들 사이의 충돌(collision)이 발생되기 때문에 이들을 식별할 수 있는 메커니즘이 있어야 한다. 본 논문에서는 먼저 기존에 제안된 트리 기반 메모래스 충돌방지 알고리즘들을 살펴보고, 본 논문에서 제안하는 향상된 쿼리 기반 충돌 알고리즘(AQT : Advanced Query Tree based Collision Algorithm)을 소개한다.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2021.11a
• /
• pp.185-186
• /
• 2021

해양사고 분석을 위한 해양사고 재결서는 중요한 정보제공의 원천이며 재발방지를 위한 개선사항을 제시한 자료이다. 하지만 이는 보고서 형태로 구성되어 수량화 하여 데이터로 활용하기에는 한계가 있다. 본 연구에서는 이러한 해양사고 재결서를 원인요소와 결과요소로 구분하여 계층화작업을 시행하였다. 이를 통해 충돌사고에서 선박조우상황과 충돌부위와의 상관관꼐를 증명하기 위한 기초자료로 사용하고자 한다. .

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.208-210
• /
• 2012

일반적으로 비동기식 센서 네트워크 MAC 프로토콜들은 별도의 충돌회피 알고리즘을 사용하지 않기 때문에 동기식 MAC 프로토콜에 비해 충돌에 의한 성능 저하가 크게 나타난다. 본 논문에서는 충돌에 따른 비동기식 MAC 프로토콜의 성능 저하 문제를 최소화하기 위해 수신 노드가 충돌을 야기한 송신 노드들의 전송 순서를 제어하여 추가적인 충돌을 제거할 수 있는 비동기식 MAC 프로토콜용 충돌해결 알고리즘을 소개한다. 충돌을 감지한 수신 노드는 충돌을 일으킨 송신 노드들에 대한 정보를 수집하고 이를 이용하여 충돌이 발생하지 않는 전송 순서를 각 송신 노드에게 지정한다. 송신 노드들은 지정된 순서에 따라 독점적인 채널 사용 권한을 얻으며 이를 통해 송신 노드간의 충돌을 회피할 수 있다. 실험에 대한 분석에 따르면 본 논문에서 제안하는 충돌해결 알고리즘은 반복적인 충돌을 방지하여 그로 인해 낭비되는 시간과 대역폭을 줄이고 이를 통해 각 노드당 평균 데이터 처리량을 약 18.6% 증가시킬 수 있다.

• Journal of Korea Multimedia Society
• /
• v.9 no.3
• /
• pp.307-314
• /
• 2006

This paper proposes a QT_rev algorithm for identifying multiple tags. The proposed QT_rev algorithm is based on the query tree algorithm. In the algorithm, the tag will send all the bits of their identification codes when the query string matches the first bits of their identification codes. On the other hand, in the QT_rev algorithm, the tag will send the remaining bits of their identification codes. After the leader receives all the responses of the tags, it knows which bit is collided. Therefore, if the collision occurs in the last bit, the reader can identify two tags simultaneously without further query. According to the simulation results, the QT_rev algorithm outperforms the QT algorithm in terms of the number of queries and the number of response bits.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.5
• /
• pp.806-811
• /
• 2006

In RFID system, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to as anti-collision algorithm. Among the existing anti-collision algorithms, SFSA, though simple, has a disadvantage that when the number of tags is variable, the system performance degrades because of the fixed frame size. This paper proposes a new anti-collision algorithm called DFSA which determines the optimal frame size using the number of collided slots at every frame. According to the simulation results, the tag identification time of the proposed algorithm is faster than that of SFSA.

• 한국항공운항학회:학술대회논문집
• /
• 2004.11a
• /
• pp.258-261
• /
• 2004

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

In this paper, we developed the EM wave absorber for eliminating false images in collision-avoidance radar. First of all, we fabricated some samples in different composition ratio of $TiO_2$ and CPE. And the relative permittivities of samples are calculated from S-parameter of samples by using 1-port method. We designed and fabricated the EM wave absorber by using the calculated relative permittivity. As a result, the EM wave absorber with composition of $TiO_2$:CPE=70:30 wt% has thickness of 1.85 mm and absorption ability higher than 20 dB in the frequency range 76-77 GHz.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.6
• /
• pp.51-61
• /
• 2007

In this paper, Air-interface protocols of ISO 18000-6 Types and EPCglobal Classes applied to RFID system in UHF band are analyzed, and those anticollision algorithms are realized. Also, the each algorithm which improves the performance of standard protocol is proposed, and the performance is compared when clock period of link timing is a identical condition on $12.5{\mu}s$. As the result, when 500 tags exist simultaneously inside reader interrogation zone, the tag recognition performance of a standard protocol is better in preceding order of Class-1 Generation-1, Type B, Type A, Class-0 and Class-1 Generation-2. And also the performance of improved protocol is better in ascending order of Type B, Type A, Class-1 Generation-1, Class-0 and Class-1 Generation-2. Therefore, performance of tag recognition remarkably depends on the regulated clock period in the protocol and link timing between a reader and a tag.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10A
• /
• pp.987-996
• /
• 2008

In this paper, the conventional anti-collision algorithms, such as Channel Monitoring algorithm and Pulse Protocol algorithm are analyzed. To decrease tag identification time, and increase system throughput and efficiency, we propose a new reader anti-collision algorithm, Pulse Protocol-based Hybrid Reader Anti-collision Algorithm, using Slot-occupied Probability under dense reader environment. The proposed algorithm uses Slot-occupied Probability to improve the performance of Pulse Protocol Algorithm. That is, A reader checks Slot-occupied Probability after generating random backoff time. If Slot-occupied Probability is greater than 0, it uses another new random backoff time to avoid reader collision. We also compare the performance of the proposed algorithm with those of Channel Monitoring and Pulse Protocol algorithms in respect of identification time system throughput, and system efficiency. Simulation results show that the proposed algorithm has an increment of 5% of identification time and system throughput as increasing the number of readers.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.5
• /
• pp.1133-1138
• /
• 2010

In the anti-collision scheme proposed by EPCglobal Class-1 Gen-2 standard, the frame size for a query round is determined by Q-algorithm. In the Q-algorithm, the reader calculates a frame size without estimating the number of tags in it's identification range. It uses only the slot status. Therefore, Q-algorithm has advantage that the reader's algorithm is simpler than other algorithms. However, it cannot allocate an optimized frame size because it does not consider the number of tags. Also, the conventional Q-algorithm does not define an optimized parameter value C for adjusting the frame size. In this paper, we propose a modified Q-algorithm and evaluate the performance with computer simulations. The proposed Q-algorithm estimates the number of tags at every query round, and determines the parameter value C based on the estimated number of tags.