• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.1
• /
• pp.46-53
• /
• 2008

This paper presents a 13.56 MHz RFID reader that can be used as a door-lock system for smart home security. The RFID reader consists of a transmitter, a receiver, and a data processing block. To verify the operation of the developed RFID reader, we present both a PSPICE simulation for transmitter/receiver and a digital simulation for data processing block. In particular, a CRC block for error detection of received data and a Manchester decoding block for position detection of collided data are designed using VHDL. In addition, we applied a binary search algorithm for multi-tag anti-collision. The anti-collision procedure is carried out by PIC microcontroller on software. The experimental results show that the developed reader can provide the right multi-tag recognition.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.1 s.343
• /
• pp.41-48
• /
• 2006

An anti-collision algorithm is very important in the RFID system because it decides tag identification time and tag identification accuracy. We propose improved anti-collision algorithms using Bin slot in RFID system. In the proposed algorithms, if the reader memorizes the Bin slot information, it can reduce the repetition of unnecessary PingID command and the time to identify tags. If we also use ScrollA11ID command in the proposed algorithm, the reader knows the sequence of collided E bits. Using this sequence, the reader can reduce the repetition of PingID command and tag identification time. We analyze the performance of the proposed anti-collision algorithms and compare the performance of the proposed algorithms with that of the conventional algorithm. We also validate analytic results using simulation. According to the analysis, for the random tag n, comparing the proposed algorithms with the conventional algorithm, the performance of the proposed algorithms is about $130\%$ higher when the number of the tags is 200. And for the sequential tag ID, the performance of the conventional algorithm decreases. On the contrary, the performance of the proposed algerian using ScrollA11ID command is about $16\%$ higher than the case of using random tag ID.

• 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 information and communication convergence engineering
• /
• v.5 no.4
• /
• pp.311-315
• /
• 2007

This paper proposes a revised query tree algorithm in RFID systems. The proposed QT_ecfi algorithm revises the QT algorithm, which has a memory-less 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.

• The Journal of the Korea Contents Association
• /
• v.9 no.10
• /
• pp.40-50
• /
• 2009

Incorrect deployment of RFID readers occurs reader-to-reader interferences in many applications using RFID technologies. Reader-to-reader interference occurs when a reader transmits a signal that interferes with the operation of another reader, thus preventing the second reader from communicating with tags in its interrogation zone. Interference detected by one reader and caused by another reader is referred to as a reader collision. In RFID systems, the reader collision problem is considered to be the bottleneck for the system throughput and reading efficiency. In this paper, we propose a novel RFID reader anti-collision algorithm based on evolutionary algorithm(EA). First, we analyze characteristics of RFID antennas and build database. Also, we propose EA encoding algorithm, fitness algorithm and genetic operators to deploy antennas efficiently. To show superiority of our proposed algorithm, we simulated our proposed algorithm. In the result, our proposed algorithm obtains 95.45% coverage rate and 10.29% interference rate after about 100 generations.

• Journal of Information Technology Services
• /
• v.12 no.3
• /
• pp.331-343
• /
• 2013

In RFID systems, the anti-collision algorithm is being improved to recognize Tag's ID within recognition area of the reader quickly and efficiently. This paper focuses on Tag collision. Many studies have been carried out to resolve Tag collision. This paper proposes a new N-ary Query Tree Algorithm to resolve more than Tag collision simultaneously, according to the value of m(2 ~ 6). This algorithm can identify more tags than existing methods by treating a maximum 6 bit collision, regardless of the continuation/non-continuation Tag's ID patterns. So, it extracts maximumly different $2^6$ bit patterns per single prefix in recognition process. The performance of N-ary Query Tree Algorithm is evaluated by theoretical analysis and simulation program.

• Journal of information and communication convergence engineering
• /
• v.7 no.3
• /
• pp.292-296
• /
• 2009

The performance of anti-collision algorithm in RFID systems, which are based on FSA algorithm, may be affected by the frame size a query round. In this paper, an anti-collision algorithm with early cancellation of query round is proposed to enhance the performance of EPCglobal Class-1 Gen-2. The Q-algorithm calculates a Q value to determine the next frame size during a query round. In the proposed algorithm, if the new Q value is different from the previous one, the reader transmits a QueryAdjust command to cancel the current query round. The simulation results show that the proposed algorithm can have a stable performance irrespective of the C value of Q-algorithm and the number of tags.

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

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.715-719
• /
• 2009

Incorrect deployment of RFID readers occurs reader-to-reader interferences in many applications using RFID technologies. Reader-to-reader interference occurs when a reader transmits a signal that interferes with the operation of another reader, thus preventing the second reader from communicating with tags in its interrogation zone. Interference detected by one reader and caused by another reader is referred to as a reader collision. In RFID systems, the reader collision problem is considered to be the bottleneck for the system throughput and reading efficiency. In this paper, we propose a novel RFID reader anti-collision algorithm based on evolutionary algorithm(EA). First, we analyze characteristics of RFID antennas and build database. Also, we propose EA encoding algorithm, fitness algorithm and genetic operators to deploy antennas efficiently. To show superiority of our proposed algorithm, we simulated our proposed algorithm. In the result, our proposed algorithm obtains 95.45% coverage rate and 10.29% interference rate after about 100 generations.

• The Journal of the Korea Contents Association
• /
• v.9 no.10
• /
• pp.67-74
• /
• 2009

Incorrect deployment of RFID readers occurs reader-to-reader interferences in many applications using RFID technologies. Reader-to-reader interference occurs when a reader transmits a signal that interferes with the operation of another reader, thus preventing the second reader from communicating with tags in its interrogation zone. Interference detected by one reader and caused by another reader is referred to as a reader collision. In RFID systems, the reader collision problem is considered to be the bottleneck for the system throughput and reading efficiency. In this paper, we propose a novel RFID reader anti-collision algorithm based on evolutionary algorithm(EA). First, we analyze characteristics of RFID antennas and build database. Also, we propose EA encoding algorithm, fitness algorithm and genetic operators to deploy antennas efficiently. To show superiority of our proposed algorithm, we simulated our proposed algorithm. In the result, our proposed algorithm obtains 95.45% coverage rate and 10.29% interference rate after about 100 generations.