Tag Collision Research Articles

Research on intelligent file management system: a design strategy based on RFID technology and improved AICT algorithm.

In this modern era of technology and digitalization, keeping track of a manual file system in the office environment is a challenging task. This research proposes a radio frequency identification (RFID) technology to improve conventional file management systems. The proposed system includes advances in information and communication technology (AICT) algorithm that addresses tag collision problems, resulting in increased data collection and reduced communication traffic. The system consists of modules such as information collection, file management, and user management. Each is analyzed from various aspects. Simulation results show that the AICT algorithm outperforms the improved collision tree algorithm by increasing recognition efficiency by 10% and reducing communication traffic by 30%. Moreover, the proposed approach provides a simple and convenient way to manage files in real-time meeting the needs of modern times. The AICT algorithm excelled the other algorithms regarding recognition efficiency.

Introducing a high-throughput energy-efficient anti-collision (HT-EEAC) protocol for RFID systems

The utilization of radio frequency identification (RFID) technology has witnessed a substantial rise in recent years, and this upward trend is expected to continue in the coming years. It is often described as an industry-changing concept, which is why continuous improvements in the technique of object identification are still needed. These enhancements are related to security, speed, and reliability of communications. RFID is frequently used in areas where a large number of things must be identified. Therefore, some problems of tag collision when many tags are transmitting their data are presented by these systems. The research presented here thoroughly analyzes and evaluates existing tag reading approaches that offer low power consumption during identification. The outcome of this work is the proposal of energy-efficient anti-collision protocol, namely HT-EEAC. By assessing the energy consumed for HT-EEAC at checkpoints, we were able to increase throughput and reduce energy consumption in our protocol. The HT-EEAC approach for updating frame size aims to enhance the energy and throughput of the EPC C1 G2 UHF RFID standard. Performance comparisons demonstrate the advantages of the strategy we propose in terms of low energy consumption per identified tag, minimal collisions, and high throughput. As a result, this method can be effectively utilized in the field of RFID systems to significantly enhance their efficiency.

An Efficient and Scalable RFID Anti-Collision Algorithm on Optimal Partition and Collided Block Bit-Mapping

In RFID systems, many anti-collision algorithms, driven by the concept of rescheduling the response sequence between the reader and unidentified tags, have been put forward to solve tag collision problem, including ALOHA-based, tree-based and hybrid algorithms. In this paper, we propose a novel RFID anti-collision algorithm called EAQ-CBB, which adopts three main approaches: tag population estimation based on collided bit detection method, optimal partitions and trimmed query tree based on the strategy of collided block bit-mapping (QTCBB). The relatively accurate estimation of tag backlog and optimal partition ensure a great reduction of collisions in the initial phase. For each collided partition, a QTCBB process is introduced immediately, which eliminates all the empty slots and significantly reduces the collided slots. Simulation results show that EAQ-CBB performs good stability and scalability when the key parameters change. Compared with the existing algorithms, such as DFSA, QTI, T-GDFSA and CT, EAQ-CBB outperforms the others with high system throughput, low normalized latency and low normalized overhead at a low cost of energy, which makes it easier to be used widely in the efficient-aware and energy-aware applications.

A RFID anti-collision approach for efficient query tree

In the radio frequency identification technology system, there are too many time slots which are caused by tag collision, and the communication complexity is high. On the basis of the anti-collision algorithm of the binary tree and the quadtree query tree, the methods of locking the collision bit and predicting the child node are used, a new lock-bit hybrid querytree (novel lock-bit hybrid query tree, NLHQT) algorithm is proposed. In the algorithm, the collision bit information is extracted through the lock instruction, and the extracted collision bit information is predicted. While reducing the collision time slot, the reader generates a new query prefix through prediction, thereby avoiding the generation of idle child nodes. Compared with the improved hybrid query tree (IHQT) anti-collision algorithm and the regression lock adaptive multi-tree search (RLAMS), the algorithm in this paper is more effective in reducing the total number of time slots and communication complexity, and the efficiency of identifying tags can be effectively improved.

Efficient Tag Grouping RFID Anti-Collision Algorithm for Internet of Things Applications Based on Improved K-Means Clustering

Dynamic Frame Slotted ALOHA (DFSA) is a de facto algorithm in the EPC Global Class-1 Generation-2 protocol for Radio Frequency Identification (RFID) tag collision problem. DFSA fails when the UHF RFID tag deployment becomes dense like in Internet of Things (IoT). Existing works do not provide readers prior tag estimates. Most algorithms assume a collision slot means two tag collision. But in dense IoT applications, much more than two tags can constitute a collision slot. Moreover, research proves collision slot might occur due to other reasons such as error-prone channel. This paper proposes a RFID anti-collision algorithm, kg-DFSA that equips the reader with prior information on accurate tag estimate. In kg-DFSA, tag identification is divided into two stages – initialization and identification. In the initialization stage, the reader uses improved K-means clustering running concurrently with a tag counter algorithm to cluster tags into K groups using tags’ RN16 while the counter returns an accurate tag number estimate. In the identification stage, the tags are read only in frame chunks that match their group IDs while a new frame size look up table is developed to boost efficiency. Variants of the proposed kg-DFSA, traditional DFSA and another grouping based DFSA algorithm (FCM-DFSA) were implemented in MATLAB. Extensive Monte Carlo simulation shows the proposed kg-DFSA edges DFSA in terms of success rate 50%, system efficiency 65% and identification time 28%. The proposed model is useful in enhancing the existing MAC protocol to support dense IoT deployment of RFID.

Rethinking Tag Collisions for Replay and Relay Attack Resistance in Backscatter Networks

Distinguishable physical layer features of radio frequency have the potential to serve as new fingerprints for authentication in backscatter networks. They have a definite advantage that backscatter tags do not have to run resource-intensive operations that commodity tags rarely implement. However, current physical layer authentication schemes impose substantial burdens on both service providers and users. Since physical layer features are highly susceptible to environmental factors, labor-intensive and time-consuming fingerprint library establishment is indispensable to make sufficient statistics for authentication. In this paper, we propose <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">TagDuet</i> , a collision-assisted authentication scheme that adopts an auxiliary tag to RFID systems, a typical type of backscatter networks, without the requirement of fingerprint library establishment. TagDuet places an independent backscatter tag in the proximity of a reader and utilizes the features in intended tag collisions to improve wireless security. Our phase cancellation decoding algorithm accurately decodes the collisions, which leads TagDuet fully compatible with the commodity RFID tags. TagDuet provides freshness, the paramount property to resist replay attacks, and robustness to relay attacks under FCC regulations for frequency hopping. We implement a prototype of TagDuet with commodity tags, evaluate the performance in randomized channels by the auxiliary tag, and demonstrate the resilience against replay and relay attacks.

Concurrent Rate-Adaptive Reading With Passive RFIDs

Radio frequency identification (RFID)-assisted management systems have been widely applied in warehousing, logistics, retailing, etc. In these scenarios, RFID-aided applications, e.g., object tracking and human behavior sensing, rely on a high-efficiency tag reading to realize accurate analyses and timely responses. However, serious tag collisions in those large-scale RFID systems will inevitably lead to significant decreases in the tag reading rates. To meet the strict timeliness requirements of those practical applications, we aim to treat the individual reading rate for each item tag differently and focus more attention on those user-interactive ones. However, due to unpredictable user behaviors, it is impractical to infer the user-interactive tags in advance. In addition, keeping focusing on them for continuous monitoring despite user movements and multipath-prevalent environments is also challenging. To solve these problems, we propose Spotlight, the first concurrent rate-adaptive reading system in passive RFIDs. Spotlight screens the ID-agnostic user-interactive tags by proposing a multichannel feature for narrow-band RFID systems without any hardware or protocol modification and achieves rate-adaptive reading by implementing real-time MU-MIMO beamforming. Substantial experiments with 1000+ COTS RFID tags exhibit that Spotlight outperforms the commercial reader by <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$2.7\times $ </tex-math></inline-formula> and the SDR-based reader by <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$6.12\times $ </tex-math></inline-formula> . In addition, Spotlight first proposes the online parallel decoding method to realize concurrency among multiple users, which breaks the commercial protocol’s throughput ceiling (37%) and achieves up to 59% throughputs.

Grouping based radio frequency identification anti-collision protocols for dense internet of things application

&lt;span lang="EN-US"&gt;Radio frequency identification (RFID) is an important internet of things (IoT) enabling technology. In RFIDs collision occur among tags because tags share communication channel. This is called tag collision problem. The problem becomes catastrophic when dense population of tags are deployed like in IoT. Hence, the need to enhance existing dynamic frame slotted ALOHA (DFSA) based electronic product code (EPC) C1G2 media access control (MAC) protocol. Firstly, this paper validates through simulation the DFSA theory that efficiency of the RFID system is maximum when the number tags is approximately equal to the frame size. Furthermore, literature review shows tag grouping is becoming popular to improving the efficiency of the RFID system. This paper analyzes selected grouping-based algorithms. Their underlining principles are discussed including their tag estimation methods. The algorithms were implemented in MATLAB while extensive Monte Carlo simulation was performed to evaluate their strengths and weaknesses. Results show that with higher tag density, fuzzy C-means based algorithm (FCMBG) outperformed traditional DFSA by over 40% in terms of throughput rate. The results also demonstrate FCMBG bettered other grouping-based algorithms (GB-DFSA and GBSA) whose tag estimation method are based on collision slots in terms slot efficiency by over 10% and also in terms of identification time.&lt;/span&gt;

A Time-Efficient Protocol for Unknown Tag Identification in Large-Scale RFID Systems

In radio-frequency identification (RFID) applications, RFID tags attached to new, misplaced, or counterfeited commodities sometimes may not be timely registered and are unknown for readers. In applications like inventory management and product tracking, these unknown tags pose several challenges for fast tag identification. A simple method to identify unknown tags is to first deactivate the registered known tags, and then collect IDs of the unknown ones. However, this is a nontrivial task. In fact, unknown tags cause interference with the deactivation of known tags. Moreover, the unknown tag collection methods used in existing protocols either suffer severe tag collisions or generate many empty slots, which increases the final execution time. In this article, we propose an efficient unknown tag identification (EUTI) protocol. First, EUTI builds a vector-based filter to exclude the tags that are not expected to reply in each slot, so that EUTI can use both predicted collision slots and singleton slots for unknown tag deactivation and avoid collisions caused by unknown tags. Second, EUTI adopts a reservation mechanism to reduce collision slots and guide each unknown tag to skip empty slots when replying, thus saving execution time. Moreover, we provide a theoretical analysis of EUTI to minimize execution time and extend EUTI to multi-reader scenarios. Numerical results show that EUTI outperforms the state-of-the-art solutions by reducing up to 44.12% in deactivation time, 26.47% in collection time, and 27.75% in total time.

Research on the RFID Anticollision Strategy Based on Decision Tree

RFID can automatically read the information stored on the tag. When multiple tags send data to the reader and writer at the same time, multiple tag collision will occur, resulting in the reader and writer being unable to successfully identify the tag. To solve this problem, an RFID multitag identification method based on decision tree is proposed. The Manchester code is used to represent different level states of voltage. The reader extracts the collision bits in the tag ID by using the Manchester code, and these collision bits form the new tag ID. In the process of decision tree search, the “XOR” command operation is added, and the query prefix is selectively sent to the tag to mark all collision bits. The process will continue until one tag is identified; then, reset the remaining unrecognized tags and continue to participate in a new round of identification. The simulation results show that the RFID multitag identification method based on decision tree can reduce the time complexity and communication overhead and improve the throughput, so it has high search efficiency.

An improved RFID anti-collision protocol (IMRAP) with low energy consumption and high throughput

The advancement of RFID (Radio Frequency Identification) has facilitated its widespread incorporation and caused an increase in the deployment of these solutions in a variety of contexts and constraints. These constraints are generally due to the quantity and the mobility of tags and readers utilized, both of which have an impact on the RFID system's efficiency by causing tag collisions. Whereas numerous solutions to the problem of tag collisions have been presented, few of them have been concerned with reducing collisions, energy consumed, and maximizing throughput at the same time. This article proposes an approach to estimate tags for attaining these objectives based on an x factor, which functions as a reward or a penalty depending on the performance of the frame. When compared to previous collision reduction protocols, simulations reveal that our solution achieves the highest performance in terms of throughput, collisions, and energy consumed.

An RFID multi-Tag anti-collision algorithm based on Successive Interference Cancellation with power adaptive regulation

Radio Frequency Identification (RFID) is a key technology supporting the Internet of Things (IoT). The simultaneous identification of multiple Tag signals by a Reader will generate the Tag collision problem, which will significantly reduce the identification efficiency of the system and prolong the identification time in the scenario of large-scale Tags. In order to solve this problem, this paper researches RFID Tag collision prevention algorithm, and establishes a multi-Tag collision prevention algorithm model by analyzing the Aloha Tag collision prevention algorithm, which can accurately portray the slot efficiency and time efficiency of the system when recognizing multiple Tags; then establishes a power adaptive regulation RFID multi-Tag identification algorithm using Successive Interference Cancellation (SIC) technology. After simulation and verification results show that the constrained Reader can resolve the signal to noise ratio threshold of 6.9db, the slot efficiency and time efficiency of the SIC-based RFID Tag anti-collision algorithm is improved by 179% and 154% compared to the ISOC algorithm; the designed RFID power adaptive regulation algorithm is improved by 259% and 203% compared to the ISOC algorithm in terms of slot efficiency and time efficiency 203%.

A RFID-Integrated Framework for Tag Anti-Collision in UAV-Aided VANETs

In this paper, we investigate tags in anti-collision applications of radio frequency identification (RFID) technology in unmanned aerial vehicle (UAV)-aided vehicular ad hoc networks (VANETs). The integration of RFID technology in UAV-aided VANETs can provide reliable traffic-related services for vehicles. However, multiple tags’ simultaneous responses to a reader mounted on a UAV, denoted as tag collision, gravely affect the correct tag detection on each vehicle. Therefore, in order to decrease the collision probability and improve the throughput, we propose a multi-frequency tag identification method. In the proposed scheme, we devise a tag grouping method based on adaptive power control to make the reader dynamically match the optimal frame length. Based on the above matching results, we introduce a tag estimation method using the optimal weight to improve the accuracy of tag estimation. We theoretically analyze the closed-form expression of the security outage probability expression. Finally, our simulation results demonstrate that the proposed tag anti-collision scheme achieved significant performance superiority in terms of the throughput and identification time slots.

A Tag-Correlation-Based Approach to Fast Identification of Group Tags

Tag identification is a critical operation in large-scale RFID applications. Typically, in the RFID-enabled warehouse, the reader needs to execute tag identifications to obtain the inventory information of numerous tagged items. The existing schemes usually divide the time frame into multiple slots and map each tag to one of them for replying its identity. This imposes serious tag collisions because two or more tags may be mapped to the same slot and their responses corrupt with each other. When tag collision happens, all the collided tags cannot be identified by the reader, which significantly increases the identification delay. To overcome the collision problem in the identification process, this paper proposes a Group Tag Identification (GTI) framework to identify grouped tags in both singleton and collision slots. The key novelty of GTI is in leveraging tag-correlation to identify grouped tags in the collision slots without any extra transmission overhead. The main challenge of this work is to overcome the communication and architectural limitations of RFID systems in the context of building ID and slot-correlation between tags. Extensive simulations show that GTI significantly reduces the identification delay by up to 40 percent when compared with the state-of-the-art dynamical frame slotted aloha schemes.

A Novel Frame-Slotted ALOHA Algorithm for Radio Frequency Identification System in Supply Chain Management

Abstract Radio Frequency Identification (RFID) is an essential wireless technology with different supply chain management (SCM) potential applications. Managing a supply chain primarily requires an ‘information sharing’ architecture and visibility of business process-related data. This information architecture helps the operational event management team identify critical incidents and deploy substitute actions. The RFID-based information system provides a technological infrastructure to supply chain business process-related data. The occurrence of tag-collision incident essentially challenges the tag detection ability of RFID systems. Tag collision takes place when more than one tag responds simultaneously to the reader at the identification process. Different algorithmic solutions are available to the tag collision problem. In general, the algorithmic solutions are of two types: (i) tree-based solutions, and (ii) ALOHA-based solutions. This paper presents a novel dynamic frame slotted ALOHA algorithm. It uses probability theory for tags to access the frame and improve the system efficiency. This paper presents experimental details to evaluate the performance of the Electronic Product Code Generation-2 (EPC Gen-2) arbitration algorithm. Finally, the paper discusses the experimental results of the proposed algorithm, and concludes with the scope of future research.

An Efficient Q‐Algorithm for RFID Tag Anticollision

In large‐scale Internet of Things (IoT) applications, tags are attached to items, and users use a radiofrequency identification (RFID) reader to quickly identify tags and obtain the corresponding item information. Since multiple tags share the same channel to communicate with the reader, when they respond simultaneously, tag collision will occur, and the reader cannot successfully obtain the information from the tag. To cope with the tag collision problem, ultrahigh frequency (UHF) RFID standard EPC G1 Gen2 specifies an anticollision protocol to identify a large number of RFID tags in an efficient way. The Q‐algorithm has attracted much more attention as the efficiency of an EPC C1 Gen2‐based RFID system can be significantly improved by only a slight adjustment to the algorithm. In this paper, we propose a novel Q‐algorithm for RFID tag identification, namely, HTEQ, which optimizes the time efficiency of an EPC C1 Gen2‐based RFID system to the utmost limit. Extensive simulations verify that our proposed HTEQ is exceptionally expeditious compared to other algorithms, which promises it to be competitive in large‐scale IoT environments.

A Fast Hybrid Strategy‐Based RFID Tag Identification Protocol

Tag collision is one of the critical problems in radiofrequency identification (RFID) technology which can be widely used to identify objects using tag attachment automatically. Through the transmission and reflection of wireless radiofrequency signals, noncontact identification is realized. However, when multiple tags respond to the reader simultaneously, a collision occurs, significantly degrading the identification performance of RFID systems. To tackle the tag collisions, we propose a fast hybrid strategy‐based RFID anticollision (FHS‐RAC) protocol. Based on the conventional query tree algorithm, the proposed FHS‐RAC makes full use of collision bits and the total response bits to achieve the faster tag identification. Extensive simulations and experiments verify the feasibility and effectiveness of our proposed scheme.

A Novel Hybrid Tag Identification Protocol for Large-Scale RFID Systems

Radio frequency identification technology is one of the main technologies of Internet of Things (IoT). Through the transmission and reflection of wireless radio frequency signals, non-contact identification is realized, and multiple objects identification can be realized. However, when multiple tags communicate with a singleton reader simultaneously, collision will occur between the signals, which hinders the successful transmissions. To effectively avoid the tag collision problem and improve the reading performance of RFID systems, two advanced tag identification algorithms namely Adaptive M-ary tree slotted Aloha (AMTS) based on the characteristics of Aloha-based and Query tree-based algorithms are proposed. In AMTS, the reader firstly uses the framed slotted Aloha protocol to map the tag set to different time slots, and then identify the collided tags using binary search method based on collision factor or mapping table. Both performance analysis and extensive experimental results indicate that our proposed algorithms significantly outperforms most existing anti-collision approaches in tag dense RFID systems.

Application of DCT to problem of collision resolution in RFID SAW systems by using correlation method

The article is devoted to SAW RFID systems. A problem of collision resolution by using a correlation method is under consideration. Collision is resolves by means of two correlation features, by the correlation function of the signal and by the correlation function of the DCT from the signal. A program, which is implements such collision resolution algorithm, was written. A collision is creating by using a simulation model of RFID tag. The model can generate a response from tag with «own» or with a random code, or can generate a collision of responses with random codes, which may contain or not contain an «own» code. The results of the algorithm’s operation are presented for the cases of reading from two to ten tags simultaneously. In addition to the main function, the algorithm implements error-correcting coding and decoding functions. It allows eliminating errors in case when there is no collision of tags, but a level of channel noise is high. The error-correcting coding is implemented by Reed-Solomon codes.

Challenges for RFID Technology used in Libraries

The technological advancements has taken fast pace globally throughout the world during last 10 years. The more and more digital impact has been seen in different areas related to every field. Private as well as government sectors put large emphasis and financial budget involvements to make most of the activities digital among people. The new RFID technology developed and when implemented in the libraries, it reduces the workload of circulating books through digital process of check-in and checkout among the users. RFID reduces time required to perform the Circulation operations in the libraries as compared to manual activities. RFID tags are capable and much faster than barcodes and with the help of handheld reader; items in the stack can be read at the same time. Apart from the advantages, the technology RFID has to face many challenges for its implementation and smooth working in the digital environment. The financial budget involved in it is very high. Due to chances of tag removal and tag collision, it needs extra care to be given. RFID is an excellent advanced technology but it needs to improve security factors and standards of its products and services.