• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.253-259
• /
• 2008

RFID is a generic term for technologies which use RF waves to identify, track, or categorize any object. A radio frequency identification (RFID) reader recognizes objects through wireless communications with RFID tags. Tag collision arbitration for passive tags is a significant issue for fast tag identification due to communication over a shared wireless channel. One of the research areas in RFID system is a tag anti-collision protocol. In this paper, various anti-collision protocols are discussed. The pros and cons of different anti-collision protocols are compared with each other and their performance is analyzed and the better performance anti-collision protocol is suggested.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.776-796
• /
• 2010

Integrated RFID-WSNs (wireless sensor networks) have recently been researched to provide object identities, sensing information, mobile service, and network functionalities. In integrated RFID-WSNs, the reader collision is one of the critical problems. Above all, due to the absence of universally applicable anti-collision protocols and the channel capture phenomenon, the medium access control protocols in integrated RFID-WSNs suffer from reader collision and starvation problems. In this paper, we propose an efficient MAC protocol, called EMP, to avoid the above problems in integrated RFID-WSNs. EMP is a CSMA-based MAC protocol which is compatible with sensor networks operating on integrated nodes which consist of an RFID reader and a senor node. EMP resolves not only the reader collision problem, but also the starvation problem using a power control mechanism. To verify the performance of EMP, we compared it with other anti-reader collision MAC protocols using simulations. As a result, the performance of EMP showed improvements in throughput, system efficiency, and energy consumption compared to the single data channel protocols (CSMA/CA, Pulse, and DiCa) in dense deployment environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.2294-2309
• /
• 2020

In this article, a new Aloha-based tag identification protocol is presented to improve the reading efficiency of the EPC C1 Gen2-based UHF RFID system. Collision detection (CD) plays a vital role in tag identification process which determines the efficiency of anti-collision protocols since most Aloha-based protocols optimize the incoming frame length based on the collisions in current frame. Existing CD methods are ineffective in identifying collision, resulting in a degradation of identification performance. Our proposed algorithm adopts an enhanced CD (ECD) scheme based on the EPC C1 Gen2 standard to optimize identification performance. The ECD method can realize timely and effective CD by detecting the pulse width of the randomly sent by tags. According to the ECD, the reader detects the slot distribution and predicts tag cardinality in every collision slot. The tags involved in each collision slot are identified by independently assigned sub-frames. A large number of numerical results show that the proposed solution is superior to other existing anti-collision protocols in various performance evaluation metrics.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.4
• /
• pp.281-285
• /
• 2011

One of the key issues in implementing RFID systems is to design anti-collision protocols for identifying all the tags in the interrogation zone of a RFID reader with the minimum identification delay. In this paper, Furthermore, in designing such protocols, the limited resources in tags and readers in terms of memory and computing capability should be fully taken into consideration. we first investigate two typical RFID anti-collision algorithms, namely RFID Gen2 Q algorithm (accepted as the worldwide standard in industrial domain) and FAFQ algorithm including their drawbacks and propose a new RFID anti-collision algorithm, which can improve the performance of RFID systems in terms of tag identification time considerably. Further, we compared performance of the proposed algorithm with Q algorithm and FAFQ algorithm through computer simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.1929-1945
• /
• 2011

RFID technologies have attracted a lot of attention in recent years because of their cost/time-effectiveness in large-scale logistics, supply chain management (SCM) and other various potential applications. One of the most important issues of the RFID-based systems is how quickly tags can be identified. Tag collision arbitration plays a more critical role in determining the system performance especially for passive tag-based ones where tag collisions are dealt with rather than prevented. We present a novel tag collision arbitration protocol called Optimum Frame-Slotted Aloha (OFSA). The protocol has been designed to achieve time-optimal efficiency in tag identification through an analytic study of tag identification delay and tag number estimation. Results from our analysis and extensive simulations demonstrate that OFSA outperforms other collision arbitration protocols. Also, unlike most prior anti-collision protocols, it does not require any modification to the current standards and architectures facilitating the rollout of RFID systems.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.1
• /
• pp.98-104
• /
• 2012

In RFID Systems, collisions between multiple tags frequently arise due to simultaneous responses from multiple tags using the same communication channel. Most of anti-collision protocols such as QT regard these collisions as useless cycles, thereby wasting the channel bandwidth. In this paper, we propose a new anti-collision protocol, namely ASP (Adjustable splitting by patterns of collisions) protocol that utilizes the patterns collision for noticeable performance enhancements.

• Journal of IKEEE
• /
• v.13 no.2
• /
• pp.108-117
• /
• 2009

In recent years, one of alternatives for constructing RFID networks that provide mobile services is using wireless sensor networks (WSN) to enhance network capacity, utility and scalability. Due to absence of compatible reader anti-collision control and channel capture phenomenon, the medium access control protocols as used in the RFID networks lead to reader collision and starvation problem. In this paper, we develop a MAC protocol which is called Enhanced Collision Avoidance MAC (ECO) to avoid reader to reader collisions in an integrated RFID network. ECO is a CSMA-based MAC protocol, and operates on integrated nodes which consist of a RFID reader and a mote. Performance evaluation shows superior results to pure-CSMA protocols under dense deployment environments, both in number of failures and in throughput.

• 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 the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.1
• /
• pp.19-25
• /
• 2012

In evaluating the performance of RFID systems, the tag anti-collision arbitration has been considered to be an important issue. For BT(Binary Tree) and ABS( Adaptive Binary Splitting) protocols, the so-called capture effect, which presumably happens frequently in the process of readers' receiving messages from multiple tags, can lead to some failures in detecting all tags in BT and ABS. In this paper, we propose a new anti-collision protocol, namely FTB (Feedback TagID with Binary splitting), which can solve the aforementioned problem and improve the performance.

• Journal of KIISE:Software and Applications
• /
• v.36 no.7
• /
• pp.560-570
• /
• 2009

RFID, Radio Frequency Identification, is a technology of automated identification replacing bar-code. RFID technology has advantages that it recognizes fast and it is strong to contamination using wireless communication. However, there are difficult problems that should be solved for popularization of RFID. Among of these, tag anti-collision problem is dealed in this paper. It affected the performance of RFID system directly. This paper analyzes conventional algorithms and proposes new algorithms of tag anti-collision. The algorithm proposed was composed of appropriate properties to each phase of distribution and recognition as hybrid between ALOHA-based algorithm and QT-based algorithm. At phase of distribution, the number of tags recognizing at a frame was reduced using ALOHA-based algorithm. It addressed the delay problem because of deep depth of tree. At phase of recognition, it solved ALOHA-based chronic problem that couldn't recognize all the tags sometimes. Moreover, QTR algorithm that recognize by reversed tag IDs was adopted for the performance. The FQTR algorithm proposed in this paper showed brilliant performance as compared with convention algorithms by simulation.