• Journal of information and communication convergence engineering
• /
• v.9 no.3
• /
• pp.260-265
• /
• 2011

In RFID System, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to anti-collision algorithm. In 13.56MHz RFID system, STAC protocol is defined as an anti-collision algorithm for multiple tag reading. In STAC protocol, there is no differentiation between the collided tags and others in the identification process. Therefore, tags may never be successfully identified because its responses may always collide with others. This situation may cause the tag starvation problem. This paper proposes a fair identification scheme for STAC protocol. In the proposed scheme, if the number of collided slots is large during a query round, the reader broadcasts a CollisionRound command to begin a collision round. During the collision round, the reader identifies only tags that are experienced collision during the previous query round.

• Journal of information and communication convergence engineering
• /
• v.9 no.1
• /
• pp.44-49
• /
• 2011

In RFID System, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to anti-collision algorithm. In Gen-2 RFID system, if the slot-count size varies during a query round due to the collisions, a new query round begins with a QueryAdjust command. Anti-collision algorithm of Gen-2 RFID system is simple. But, it has the tag starvation problem that a tag may never be successfully identified because its responses always collide with others. Therefore, this paper proposes a scheme to guarantee the fair identification delay. In the proposed scheme, if the slot-count value changes due to the collisions, the reader broadcasts a CollisionRound command to begin a collision round. During the collision round, the reader identifies only tags that occurred collision during the previous query round.

• International Journal of Contents
• /
• v.2 no.1
• /
• pp.34-38
• /
• 2006

In this paper, an overview of anti-collision algorithm for RFID system of a standard EPC Class1 protocol is presented, and the binslotted dynamic search algorithm (BDS) based upon the slotted ALOHA and binary tree procedure is proposed and analyzed. Also, the performance is evaluated as comparing the BDS algorithm with the standard bin-slotted algorithm (BSA) through the simulation program. The performance of the proposed BDS algorithm is improved by dynamically identifying the collided-bit position and the collided bins stored in the stack of the reader. As the results, the number of request command that a reader send to tags in the reader s interrogation zone and the total recognition time are decreased to 59% as compared with BSA algorithm. Therefore, the tag identification performance is fairly improved by resolving a collision problem using the proposed BDS algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12B
• /
• pp.1686-1697
• /
• 2011

This paper aims to build up a RFID-automated cargo movement system in an air-cargo warehouse. In our research, we do the spectrum measurements compliant with the RFID frequency bands to observe the interferences from legacy systems in the air-cargo warehouse. To overcome the dense-reader mode (DRM) problem, we apply three novel approaches, which are the periodic transmit of a reader, the Visible RFID reader & tag, and the sensor-based RFID system. Moreover, for the tag collision issue, we implement the Adaptive Adjustable Framed Q(AAFQ) algorithm, and the demonstration on RFID tag anti-collision algorithms show that the AAFQ algorithm has highly desirable tag anti-collision performance compared to any other commercially available solutions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9B
• /
• pp.1092-1097
• /
• 2011

An anti-collision protocol which tries to minimize the collision probability and identification time is the most important factor in all identification technologies. This paper focuses on methods to improve the efficiency of tag's process in identification systems. Our scheme, Binary Slotted Query Tree (BSQT) algorithm, is a memoryless protocol that identifies an object's ID more efficiently by removing the unnecessary prefixes of the traditional Query Tree (QT) algorithm. With enhanced QT algorithm, the reader will broadcast 1 bit and wait the response from the tags but the difference in this scheme is the reader will listen in 2 slots (slot 1 is for 0 bit Tags and slot 2 is for 1 bit Tags). Base on the responses the reader will decide next broadcasted bit. This will help for the reader to remove some unnecessary broadcasted bits which no tags will response. Numerical and simulation results show that the proposed scheme decreases the tag identification time by reducing the overall number of request.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.5
• /
• pp.12-20
• /
• 2008

RFID(Radio frequency indentification) technology, that the reader detect the tag information attached on the objects without contact, is considered the kernel of realizing tile Ubiquitous Sensor Network. Particularly, because there are lots of tags(which the reader have to detect) in the UHF RFID system(that is applied at the Logistic & Distribution industry). In the UHF RFID system the negative effects, we called the tag-collision, may occur and we should solve these effects. So, in the EPCglobal Gen2 protocol they present the Slotted Random Anti-collision algorithm to prevent the tag-collision effect. In this paper, in order to minimize the tag-collision effect and bring on the system efficiency, we propose the Power Increasing Method that controls the transmission power of the reader depending on the environment and verily the improved performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.12
• /
• pp.1013-1022
• /
• 2012

Tag collection is one of the major concerns in radio frequency identification(RFID) system. All tags in RFID reader's transmission range send response message back to the reader in response to collection request message on the given rf channel. When multiple tags respond simultaneously, tag-collision may occur. Tag-collision problem is one of the most important issues in active RFID performance. To mitigate this problem, frame slotted ALOHA(FSA) anti-collision protocol is widely used in active RFID system. Several studies show that the maximum system efficiency of FSA anti-collision protocol is 36.8%. In this paper, we propose an efficient slotted CSMA/CA protocol to improve tag collection performance. We compare our protocol to the FSA anti-collision protocol. For the experiment, an 433MHz active RFID system is implemented, which is composed of an RFID reader and multiple tags. We evaluated the tag collection performance using one RFID reader and 40 tags in the real test bed. The experimental result shows that proposed protocol improves the tag collection time, round and collision probability by 18%, 37.4% and 77.8%, respectively.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.51-60
• /
• 2009

In radio frequency identification(RFID) systems, when an RFID reader uses the same or adjacent frequency with neighbor readers, the interference between the readers may occur, which causes the reader collision and errors in tag recognition. In the previous study on RFID reader anti-collision, the techniques based on Frequency Division Mutiplex(FDM) or Time Division Multiplex(TDM) are proposed. However in these paper, the problem on the condition of RFID reader-to-reader interference considering the distance between interfering readers, frequency and operating time is not define exactly. In this paper, the interference effect is analyzed through RFID reader interference model considering the TDM and FDM, and the optimization problem is defined. To solve this, genetic-resource allocation technique is proposed. Therefore the optimal resource allocation applied RFID environment faithfully is accomplished.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1460-1478
• /
• 2020

This paper proposes a novel anti-collision protocol for large-scale RFID tags identification, named Bi-response Collision Tree Protocol (BCT). In BCT, two group of tags answer the reader's same query in two response-cycles respectively and independently according to the bi-response pattern. BCT improves the RFID tag identification performance significantly by decreasing the query cycles and the bits transmitted by the reader and tags during the identification. Computation and simulation results indicate that BCT improves the RFID tag identification performance effectively, e.g. the tag identification speed is improved more than 13.0%, 16.9%, and 22.9% compared to that of Collision Tree Protocol (CT), M-ary Collision Tree Protocol (MCT), and Dual Prefix Probe Scheme (DPPS) respectively when tags IDs are distributed uniformly.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2247-2256
• /
• 2011

In this paper, we propose a coordinator-based reader protocol that can avoid reader collisions in a passive RFID system. In a proposed protocol, unlike conventional protocols that a reader itself selects its own slot randomly to communicate with tags such as DCS, Colorwave, a coordinator reader allocates an unused slot to a reader to participate in the network and sends a current slot number. A reader allocated a slot can communicate with tags. The proposed protocol can adaptively modified to apply for multiple coordinator readers environment in a wide area. This causes reader collision problem, but can be alleviated partly by applying the frequency planning. In this way, we verifies that a RFID system using the proposed protocol is three to five times better than existing systems through the simulation.