1,400 research outputs found
RAC-Multi: Reader Anti-Collision Algorithm for Multichannel Mobile RFID Networks
At present, RFID is installed on mobile devices such as mobile phones or PDAs and provides a means to obtain information about objects equipped with an RFID tag over a multi-channeled telecommunication networks. To use mobile RFIDs, reader collision problems should be addressed given that readers are continuously moving. Moreover, in a multichannel environment for mobile RFIDs, interference between adjacent channels should be considered. This work first defines a new concept of a reader collision problem between adjacent channels and then suggests a novel reader anti-collision algorithm for RFID readers that use multiple channels. To avoid interference with adjacent channels, the suggested algorithm separates data channels into odd and even numbered channels and allocates odd-numbered channels first to readers. It also sets an unused channel between the control channel and data channels to ensure that control messages and the signal of the adjacent channel experience no interference. Experimental results show that suggested algorithm shows throughput improvements ranging from 29% to 46% for tag identifications compared to the GENTLE reader anti-collision algorithm for multichannel RFID networks
Energy efficient tag identification algorithms for RFID: survey, motivation and new design
RFID is widely applied in massive tag based applications, thus effective anti-collision algorithms to reduce communication overhead are of great importance to RFID in achieving energy and time efficiency. Existing MAC algorithms are primarily focusing on improving system throughput or reducing total identification time. However, with the advancement of embedded systems and mobile applications, the energy consumption aspect is increasingly important and should be considered in the new design. In this article, we start with a comprehensive review and analysis of the state-of-the-art anti-collision algorithms. Based on our existing works, we further discuss a novel design of anti-collision algorithm and show its effectiveness in achieving energy efficiency for the RFID system using EPCglobal C1 Gen2 UHF standard
Tag Anti-collision Algorithm for RFID Systems with Minimum Overhead Information in the Identification Process
This paper describes a new tree based anti-collision algorithm for Radio Frequency Identification (RFID) systems. The proposed technique is based on fast parallel binary splitting (FPBS) technique. It follows a new identification path through the binary tree. The main advantage of the proposed protocol is the simple dialog between the reader and tags. It needs only one bit tag response followed by one bit reader reply (one-to-one bit dialog). The one bit reader response represents the collision report (0: collision; 1: no collision) of the tags' one bit message. The tag achieves self transmission control by dynamically updating its relative replying order due to the received collision report. The proposed algorithm minimizes the overhead transmitted bits per one tag identification. In the collision state, tags do modify their next replying order in the next bit level. Performed computer simulations have shown that the collision recovery scheme is very fast and simple even with the successive reading process. Moreover, the proposed algorithm outperforms most of the recent techniques in most cases
Recommended from our members
From M-ary Query to Bit Query: a new strategy for efficient large-scale RFID identification
The tag collision avoidance has been viewed as one of the most important research problems in RFID communications and bit tracking technology has been widely embedded in query tree (QT) based algorithms to tackle such challenge. Existing solutions show further opportunity to greatly improve the reading performance because collision queries and empty queries are not fully explored. In this paper, a bit query (BQ) strategy based Mary query tree protocol (BQMT) is presented, which can not only eliminate idle queries but also separate collided tags into many small subsets and make full use of the collided bits. To further optimize the reading performance, a modified dual prefixes matching (MDPM) mechanism is presented to allow multiple tags to respond in the same slot and thus significantly reduce the number of queries. Theoretical analysis and simulations are supplemented to validate the effectiveness of the proposed BQMT and MDPM, which outperform the existing QT-based algorithms. Also, the BQMT and MDPM can be combined to BQMDPM to improve the reading performance in system efficiency, total identification time, communication complexity and average energy cost
From M-ary Query to Bit Query: a new strategy for efficient large-scale RFID identification
The tag collision avoidance has been viewed as one of the most important research problems in RFID communications and bit tracking technology has been widely embedded in query tree (QT) based algorithms to tackle such challenge. Existing solutions show further opportunity to greatly improve the reading performance because collision queries and empty queries are not fully explored. In this paper, a bit query (BQ) strategy based Mary query tree protocol (BQMT) is presented, which can not only eliminate idle queries but also separate collided tags into many small subsets and make full use of the collided bits. To further optimize the reading performance, a modified dual prefixes matching (MDPM) mechanism is presented to allow multiple tags to respond in the same slot and thus significantly reduce the number of queries. Theoretical analysis and simulations are supplemented to validate the effectiveness of the proposed BQMT and MDPM, which outperform the existing QT-based algorithms. Also, the BQMT and MDPM can be combined to BQMDPM to improve the reading performance in system efficiency, total identification time, communication complexity and average energy cost
Perfect tag identification protocol in RFID networks
Radio Frequency IDentification (RFID) systems are becoming more and more
popular in the field of ubiquitous computing, in particular for objects
identification. An RFID system is composed by one or more readers and a number
of tags. One of the main issues in an RFID network is the fast and reliable
identification of all tags in the reader range. The reader issues some queries,
and tags properly answer. Then, the reader must identify the tags from such
answers. This is crucial for most applications. Since the transmission medium
is shared, the typical problem to be faced is a MAC-like one, i.e. to avoid or
limit the number of tags transmission collisions. We propose a protocol which,
under some assumptions about transmission techniques, always achieves a 100%
perfomance. It is based on a proper recursive splitting of the concurrent tags
sets, until all tags have been identified. The other approaches present in
literature have performances of about 42% in the average at most. The
counterpart is a more sophisticated hardware to be deployed in the manufacture
of low cost tags.Comment: 12 pages, 1 figur
Recommended from our members
An effective frame breaking policy for dynamic framed slotted aloha in RFID
The tag collision problem is considered as one of the critical issues in RFID system. To further improve the identification efficiency of an UHF RFID system, a frame breaking policy is proposed with dynamic framed slotted aloha algorithm. Specifically, the reader makes effective use of idle, successful, and collision statistics during the early observation phase to recursively determine the optimal frame size. Then the collided tags in each slot will be resolved by individual frames. Simulation results show that the proposed algorithm achieves a better identification performance compared with the existing Aloha-based algorithms
- …