• The KIPS Transactions:PartA
• /
• v.16A no.4
• /
• pp.289-298
• /
• 2009

Generally, RFID systems are composed of one reader and several passive tags, and share the single wireless channel. For this reason, collisions occurwhen more than two tags simultaneously respond to the reader's inquiry. To achieve this problem, many papers, such as QT[8], HCT[10], BSCTTA[2], and QT-BCS[9], have been proposed. In this paper, we propose the tree-based anti-collision algorithm using a bit change sensing unit (TABCS) based on BSCTTA algorithm. The proposed algorithm can identify bits returned from tags through bit change sensing unit, even if multi collisions occur. So, it rapidly generates the unique prefix to indentify each tag, and reduce the total of bits. As the result, the cost of identifying all tag IDs is relatively reduced as compared with existing algorithms. It is verified through simulations that the proposed algorithm surpass other existing algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.85-94
• /
• 2010

Many RFID systems use dynamic slotted ALOHA to identify the label information of the RFID tags. One of the key problems in the RFID system is how to estimate the number of RFID tags up to the desired level of accuracy. In this paper, we present the framework of tag estimation algorithm for the collision-oblivious (CO) reader which can only decide whether the tag response is successful or not. Thus, the CO reader must rely on the success estimator to predict the RFID tag population. We propose two estimation algorithms to predict the number of RFID tags, named the memoryless success estimator (MSE) and the intersection-based success estimator (ISE). The MSE considers only the estimate obtained at the current inventory round, while the ISE finds an appropriate intersection interval of the existing estimates collected at every inventory round. Through the simulation results, we demonstrate that the ISE is a fast, accurate, and controllable estimator whose performance is close to that of the collision/idle estimators.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.181-183
• /
• 2007

본 논문은 RF 리더기와 RF 태그 상호간의 통신시에 발생할 수 있는 충돌을 감지하고 이를 능동적으로 회피할수 있는 RFID(Radio Frequency IDentification)의 설계에 관한 내용이다. RFID는 사람, 자동차, 화물, 상품 등에 정보를 부가하는 시스템으로 그 부가정보를 무선통신매체를 이용하여 비접족으로 해독하는 시스템으로 기존의 바코드보다 데이터의 전송속도와 용량의 증가 그리고 편리성이 향상되는 장점이 있으나, 동시에 여러개의 RF태그와의 무선통신으로 인한 데이터의 충돌이 발생할 수 있다. 이러한 충돌을 감지하고 이를 적절하게 회피하는 것은 RFID 시스템의 신뢰성을 높이는데 필수적인 요소이다. RFID 태그로 사용되기 위해서는 건전지로 구동될 수 있도록 저전력소모가 요구되며 또한 통신의 시작과 충돌을 파악할 수 있는 캐리어 감지기능이 필수적이다. 본 논문에서는 이러한 조건들을 만족하는 Chipcon 사(社)의 양방향 RF IC를 사용하였다. Chipcon 사(社)의 양방향 RF IC는 다중 주파수 대역의 선택과 변조방식을 시리얼통신을 통해서 손쉽게 변경할 수 있기 때문에 충돌감지시 다양한 회피알고리즘을 상황에 맞게 구현할 수 있다. 본 논문에서는 양방향 RF IC를 사용하여 충돌을 감지하고 회피할 수 있는 RFID시스템을 설계하고 구현하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.2
• /
• pp.287-292
• /
• 2007

In this paper, a QT_ecfi algorithm is proposed for identifying all the tags within the identification range. The proposed QT_ecfi algorithm revises the QT algorithm, which has a memoryless property. In the QT_ecfi algorithm, the tag will send the remaining bits of their identification codes when the query string matches the first bits of their identification codes. When the reader receives all the responses of the tags, it knows which bit is collided. If the collision occurs in the last bit, the reader can identify two tags simultaneously without further query. While the tags are sending their identification codes, if the reader detects a collision bit, it will send a signal to the tags to stop sending. According to the simulation results, the QT_ecfi 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.4
• /
• pp.638-644
• /
• 2006

In this paper, a QT_ss protocol is proposed for identifying all the tags within the identification range. The proposed QT_ss protocol revises the QT protocol, which has a memoryless property. In the QT_ss protocol, the tag will send all the bits of their identification codes when the query string matches the first bits of their identification codes. While the tags are sending their identification codes, if the reader detects a collision bit, it will send a signal to the tags to stop sending. According to the simulation results, the QT_ss protocol outperforms the QT protocol in terms of the number of response bits.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.526-529
• /
• 2006

In this paper, a QT_ss protocol is proposed for identifying all the tags within the identification range. The proposed QT_ss protocol revises the QT protocol. which has a memoryless property. In the QT_ss protocol, the tag will send all the bits of their identification codes when the query string matches the first bits of their identification codes. While the tags are sending their identification codes. if the reader detects a collision bit, it will send a signal to the tags to stop sending. According to the simulation results, the QT_ss protocol outperforms the QT protocol in terns of the number of response bits.