• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.5
• /
• pp.25-33
• /
• 2005

We propose a method to protect the tag's information from illegal reader in RFID system. In this method, a special tag called ownership tag makes intentionally collisions during singulation. By the forced collision of an ownership tag a reader can obtain the information of ordinary tags. Whereas a reader can not find my information on tag's ID without the ownership tag.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.5
• /
• pp.501-509
• /
• 2010

In this paper, the interference avoidance performance of the RFID reader with the compressive receiver was analyzed. In the environment of the multiple dense readers operating, the recognition rates of the conventional RFID reader and the proposed RFID reader with the compressive receiver were measured and compared. The recognition rate of the proposed reader was improved more than 2.7 times compared to the conventional reader. Especially, in the environment of two proposed RFID readers operating simultaneously, little degradation of the recognition rate was observed.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.29-30
• /
• 2007

In this paper, we propose Group Separation(GS) algorithm for RFID tag recognition. In GS algorithm, reader calculates tag ID by collision point, stores memory with the collision table. And reader classifies according to total number of tag ID's 1, requests each group. If tag comes into collision with the other tag, reader searches tag ID in collision table. As a result, we observes that transmitted data rate, the recognition time is decreased.

• 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.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.4
• /
• pp.53-63
• /
• 2008

Reader collision may occur when neighboring RFID readers use the same channel at the same time. Especially when the readers are operated in dense mode, even though many channels are available, because of frequent reader collisions we can not guarantee the performance of RFID readers. Conventional solutions such as FH(Frequency Hopping) or LBT(Listen Before Talk) are not effective in this situation because they can not schedule RFID readers effectively when RFID readers are operated in multi-channel, dense reader mode, In this paper, we propose a new RFID reader anti-collision algorithm which employs LBT, random backoff before channel access, and probabilistic channel hopping at the same time. While LBT and Random backoff before channel access reduces collisions between competing readers, probabilistic channel hopping increases channel utilization by adaptively changing the hopping probability by reflecting the reader density and utilization. Simulation results shows that our algorithm outperforms conventional methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.8
• /
• pp.1619-1624
• /
• 2012

If multiple Tags in the RFID System transmit their IDs to the Reader at the same time, tag identification time is delayed due to collisions. Therefore, to reduce the reader's identification time, an efficient anti-collision technology is needed. In this paper, we propose a hybrid anti-collision method based on the QT and DFSA. Then, the performances of proposed method are compared with the existing method through extensive simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4A
• /
• pp.358-364
• /
• 2007

RFID, Radio Frequency Identification, technology is a contactless automatic identification technology using radio frequency. For this RFID technology to be widely spread, the problem of multiple tag identification, which a reader identifies a multiple number of tags in a very short time, has to be solved. Up to the present, many anti-collision algorithms have been developed in order to solve this problem, and those can be largely divided into ALOHA based algorithm and tree based algorithm. In this paper, two new anti-collision algorithms combining the characteristics of these two categories are presented. And the performances of the two algorithms are compared and evaluated in comparison with those of typical anti-collision algorithms: 18000-6 Type A, Type B, Type C, and query tree algorithm.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.34-39
• /
• 2012

Collisions between tags greatly reduce the identification speed in radio frequency identification (RFID) systems and increase communication overhead. In particular for an active RFID system, tags are powered by small batteries, and a large number of re-transmissions caused by collisions can deteriorate and exhaust the tag energy which may result in missing tags. An efficient collision-free arbitration protocol for active RFID systems is proposed in this paper. In this protocol, a new mechanism involving collision detection, collision avoidance, and fast tag access is introduced. Specifically, the pulse burst duration and busy-tone-detection delay are introduced between the preamble and data portion of a tag-to-reader (T-R) frame. The reader identifies tag collision by detecting pulses and transmits a busy tone to avoid unnecessary transmission when collision occurs. A polling process is then designed to quickly access the collided tags. It is shown that the use of the proposed protocol results in a system throughput of 0.612, which is an obvious improvement when compared to the framed-slotted ALOHA (FSA) arbitration protocol for ISO/IEC 18000-7 standard. Furthermore, the proposed protocol greatly reduces communication overhead, which leads to energy conservation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.616-619
• /
• 2012

When multiple Tags transmit their IDs to the Reader, tag identification time is delayed due to collisions. Therefore, to reduce the reader's identification time, an efficient anti-collision technology is needed. In this paper, a new anti-collision method is proposed. The method estimates the number of tags and allocates proper number of slots based on the DFSA. The performance of proposed method is compared with existing methods through extensive simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.17-26
• /
• 2005

RFID(Radio Frequency IDentification) is a technology that automatically identifies objects attached with electronic tags by using radio wave. For the implementation of an RFID system, an anti-collision algorithm is required to identify several tags within the RFID reader's range. Few researches report the performance trade-off among anti-collision algorithms in terms of the communications traffic between the reader and tags, the identification speed, and so on. In this paper, we analyze both tree based memoryless algorithms and slot aloha based algorithms that comprise of almost every class of existing anti-collision algorithms. To compare the performance, we evaluated each class of anti-collision algorithms with respect to low-cost RFID system with 96-bit EPC(Electronic Product Code). The results show that the collision tracking tree algorithm outperforms current tree based and aloha based algorithms by at least 2 times to 50 times.