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

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

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

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.11
• /
• pp.87-97
• /
• 2013

In the RFID system, multiple tags respond in the process of identifying multiple tags in the reader's interrogation zone, resulting in collisions. Tag collision occurs when two or more tags respond to one reader, so that the reader cannot identify any tags. These collisions make it hard for the reader to identify all tags within the interrogation zone and delays the identifying time. In some cases, the reader cannot identify any tags. The reader needs the anti-collision algorithm which can quickly identify all the tags in the interrogation zone. The proposed algorithm efficiently divides tag groups through an efficient separation to respond, preventing collisions. Moreover, the proposed algorithm identifies tags without checking all the bits in the tags. The prediction with efficient separation reduces the number of the requests from the reader.

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

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

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

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