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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.3997-4015
• /
• 2014

Radio frequency identification (RFID) is an emerging wireless communication technology which allows objects to be identified automatically. The tag anti-collision is a significant issue for fast identifying tags due to the shared wireless channel between tags and the reader during communication. The EPCglobal Class-1 Generation-2 which uses Q algorithm for the anti-collision is widely used in many applications such as consumer electronic device and supply chain. However, the increasing application of EPCglobal Class-1 Generation-2 which requires the dynamic environment makes the efficiency decrease critically. Furthermore, its frame length (size) determination and frame termination lead to the suboptimal efficiency. A new anti-collision algorithm is proposed to deal with the two problems for large-scale RFID systems. The algorithm has higher performance than the Q algorithm in the dynamic environment. Some simulations are given to illustrate the performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.7
• /
• pp.1624-1637
• /
• 2013

In RFID systems, one important issue is how to effectively address tag collision, which occurs when multiple tags reply simultaneously to a reader, so that all the tags are correctly identified. However, most existing anti-collision protocols assume isotropic collisions where a reader cannot detect any of the tags from the collided signals. In practice, this assumption turns out to be too pessimistic since the capture effect may take place, in which the reader considers the strongest signal as a successful transmission and the others as interference. In this case, the reader disregards the other collided tags, and in turn, fails to read the tag(s) with weaker signal(s). In this paper, we propose a capture effect-aware anti-collision protocol, called Multi-Round Collision Tree (MRCT) protocol, which efficiently identifies the tags in real RFID environments. MRCT deals with the capture effect as well as channel error by employing a multi-round based identification algorithm. We also analyze the performance of MRCT in terms of the number of slots required for identifying all tags. The simulation results show that MRCT significantly outperforms the existing protocol especially in a practical environment where the capture effect occurs.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.98-98
• /
• 2004

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.11
• /
• pp.25-32
• /
• 2007

In this paper, we propose the Group Separation Algorithm for RFID Tag Anti-Collision. We study the RFID Tag anti-collision technique of ALOHA and the anti-collision algorithm of binary search. The existing technique is several problems; the transmitted data rate included of data, the recognition time and energy efficiency. For distinction of all tags, the Group Separation algorithm identify each Tag_ID bit#s sum of bit #1#. In other words, Group Separation algorithm had standard of selection by collision table, the algorithm can reduce unnecessary number of search even than the exisiting algorithm. The Group Separation algorithm had performance test that criterions were reader#s number of repetition and number of transmitted bits for understanding tag. We showed the good performance of Group Separation algorithm better than exisiting algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.2 s.344
• /
• pp.27-38
• /
• 2006

When an RFID reader attempts to read tags, interference might occur if the neighboring readers also attempt to communicate with the same tag at the same time or the neighboring readers use the same frequency at the same time. These interferences cause the RFID reader collision. When the RFID reader collision occirs, either the command from the reader can not be transmitted to the tags or the response from the tags can not be received by the reader correctly. RFID reader anti-collision algorithms have been developed to reduce it. One of the best blown reader anti-collision algorithms is the Colorwave algorithm proposed by MIT. The Colorwave algorithm reduces the reader collisions by having the readers operate at different times. In Colorwave the time is divided into frames and a frame is divided into a number of slots. Each reader can access the tags using the slot time assigned to it. Depending on the probability of the interference, the colorwave adjusts the frame size to improve the efficiency. In this paper, we analyze the operations and the performance of the Colorwave algorithm and identify the problems of the algorithm. We also show that by adding some modifications to the algorithm the performance can be improved significantly.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.9
• /
• pp.29-37
• /
• 2004

In RFID system one of the problems that we must solve is to devise a good anti-collision algorithm to improve the efficiency of tag identification which is usually low because of tag collision. Among the existing RFID anti-collision algorithms, Framed Slotted ALOHA algorithm though simple, has a disadvantage that the number of slots used to identify the tags increases exponentially as the number of tags does. In the paper, we propose a new anti-collision algorithm called Partial-Response Framed Slotted ALOHA(PRFSA) which restricts the number of responding tags by dividing the tags into a number of groups when there are large number of tags and changes the frame size when there are small tags. Since the proposed algorithm keeps the frame size and the number of responding tags in such a way that can increase slot utilization, the algorithm shows superior performance to the existing ones. The simulation results showed that the proposed algorithm improves the slot efficiency by 85～100% compared to the existing algorithm.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.389-396
• /
• 2009

In RFID systems, identifying the tag attached to the subject begins with the request from a reader. When the reader sends a request, multiple tags in the reader's interrogation zone simultaneously respond to it, resulting in collision. The reader needs the anti collision algorithm which can quickly identify all the tags in the interrogation zone. We propose the Anti Collision Algorithm using Parity Mechanism(ACPM). In ACPM, a collision can be prevented because the tags which match with the prefix of the reader's request respond as followings; the group of tags with an even number of 1's in the bits to the prefix + 2nd bits responds in slot '0', while the group of tags with an odd number of 1's responds in slot '1'. The ACPM generates the request prefix so that the only existing tags according to the response in the corresponding slot. If there are two collided bits in tags, then reader identify tags by the parity mechanism. That is, it decreases the tag identification time by reducing the overall number of requests.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.203-206
• /
• 2005

Recently, the RFID(Radio Frequency Identification) technology has gained significant attention. One of the performance issues in RFID systems is to resolve the tag collision among responses from RFID tags. In this paper, we proposed a new scheme for estimation of the number of tags in the reader filed. The scheme is used by anti-collision algorithm to identify multiple tags efficiently. And we also present the simulation result that shows the proposed scheme to estimate tags efficiently and also to improve the systems efficiency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.747-754
• /
• 2013

This paper proposed a new transponder detection method to reduce tag recognition time and simplify anti-collision process in RFID systems. In conventional systems, a transponder in detectable area is passively recognized by responding to a reader command. In addition, if there are multiple tags in the area, a collision between tags occurs by responding at the same time to a command and anti-collision process begins. In the proposed method, tags are actively recognized without any command from a reader which results to reducing a tag recognition time and simplifying anti-collision process. To compare transponder recognition time, the process of transponder recognition in conventional systems is analysed. A circuit to detect transponder directly is developed and antenna voltage variation of a reader in the appearance of multiple transponders is analysed for the implementation of the proposed method.