Query Tree Algorithm Research Articles

RFID tag recognition model for Internet of Things for training room management

With the rapid development of the Internet of Things and intelligent technology, the application of Radio Frequency Identification (RFID) technology in training room management is becoming increasingly widespread. An efficient and accurate RFID system can significantly improve the management efficiency and resource utilization of the training room, thereby improving teaching quality and reducing management costs. Although RFID technology has many advantages, there are still some problems in practical applications, such as label collision and recognition of unknown labels. These issues not only affect the performance of the system but may also cause interference with actual teaching and management. This study proposes a grouping-based bit arbitration query tree algorithm and anti-collision technology to solve label collisions and reduce label recognition time in the technology. A new unknown label recognition algorithm is also proposed to improve the recognition efficiency and accuracy of identifying new unknown labels. Related experiments have shown that the recognition accuracy of the algorithm designed this time is 95.86%. Compared with other algorithms, the number of idle time slots is the smallest. When the number of queries is 1000, the algorithm has 1842 queries, and the communication complexity is the best. When the number of unknown tags is 10,000, the actual accuracy rate is 95.642%. Compared with traditional recognition algorithms, the new unknown label recognition algorithm has a smaller frame length in the same label proportion and good recognition performance. On a theoretical level, the research content on RFID technology helps to improve and develop the basic theories of the Internet of Things and intelligent recognition technology and provides solutions and application technologies for equipment management and IoT applications in training rooms. On a practical level, the research results can provide specific guidance for the management of training rooms, help solve equipment management and safety maintenance problems in practical applications, and improve the management efficiency of training rooms.

The Bit Query for Labels in a Binary Tree-Based Anti-Collision Recognition Algorithm

With its benefits including recognition distance, penetration ability, and multi-object recognition, radio frequency identification technology is a non-contact automatic identification method that is currently being used extensively in a variety of industries, including document anti-counterfeiting, automation, transportation, control management, and product services. An efficient anti-collision mechanism, such as anti-collision algorithms or anti-collision protocols, must be established in order to coordinate communication between the tag and the reader in the event that an RFID system experiences signal interference in the wireless channel, conflict, or collision, which will result in tag recognition or data collection failure. In response to tag conflicts in radio frequency identification (RFID) systems, a novel hybrid blocking query tree algorithm is suggested that leverages blocking prediction and child node hedging techniques to overcome the issues of lengthy time intervals and high communication complexity. The technique uses quadruple and bifurcated query trees as the foundation for its conflict avoidance strategy. The approach minimizes the conflict time and prevents the construction of idle subunits by forcing the reader to create new query prefixes via prediction, which is accomplished by employing locking commands to extract and forecast information about the conflicting bits. According to simulation data, this strategy performs better in terms of lowering the overall number of time slots and communication complexity as well as enhancing identification and labelling abilities than the current adaptive multi-tree search (RLAMS) and improved hybrid query tree (IHQT) techniques. It greatly increases the effectiveness of label identification while lowering the overall amount of time slots and communication complexity.

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.

Construction of Enterprise Management Business Model Based on Internet of Things RFID Technology

This paper proposes a new tag anticollision algorithm. On the basis of the common query tree algorithm, this algorithm increases the number of query bits, so that the algorithm has a faster tag identification amount in the state of full time slots. Collision bit and total response bit are used to estimate the number of tags, and combined with the highest collision bit to determine whether it is continuous, the number of query crosses is adaptively adjusted, and a variable bit dynamic query tree tag anticollision algorithm is designed. In conjunction with the settlement environment, improvements have also been made in the status of the identified tags. The new algorithm has improved progress in reducing idle time slots and reducing search depth. Under the premise of ensuring stability, the recognition efficiency of the algorithm is improved. From the perspective of different dimensions of corporate network and marketing dynamic capabilities, based on the strength of network relationships and product development processes, it can promote value creation model innovation in business model innovation. That is, when the network partners communicate very frequently, they can provide new ideas and resources for enterprise product development and creation and then can better integrate innovation through product innovation, quality improvement, product development cycle shortening, and development advance management. Typed products and resources are put into the operation process of the industrial chain of product output to better create new products for customers and lay the foundation for realizing the innovation of corporate value creation models. Based on the network density and customer relationship process, it can promote the value proposition model innovation in the business model innovation. Enterprise business model innovation should not only pay attention to the collaborative innovation between different elements within the enterprise but also pay attention to the overall coordination mechanism of the company’s external interest network, pay attention to the different value propositions of stakeholders through the enterprise network, and cultivate the enterprise’s rapid response to market changes. Network centrality has the greatest positive impact on the supply chain process. The company develops new products, manages customer relationships across departments, and implements supply chain management across departments.

Adapted RFID anti-collision algorithm and its application in sharing economy

In recent years, the sharing economy has developed vigorously, and the internet of things (IoT) technology is an important technology to realise the sharing economy. As an automatic identification technology, radio frequency identification (RFID) technology is the key technology to build the internet of things and an essential part of the sharing economy. In order to solve the collision problem of tags identification, an improved grouping adaptive query tree algorithm (IGAQT) is proposed in this paper. Compared to the most of existing anti-collision algorithms, simulation results show that our proposed algorithm can achieve better performance in terms of time complexity and communication overload. And the algorithm is applied to the actual case of sharing economy.

Deterministic Dual-stack Query Tree RFID tag anti-collision algorithm

Tag collision problems are a major issue affecting the performance of RFID systems. The probabilistic tag anti-collision algorithm has tag starvation and cannot identify some tags. This paper proposes a deterministic dual-stack query tree algorithm (DDQT). It successfully implements the anti-collision algorithm of tags by generating new query codes and tag identification functions. At the same time, the DDQT algorithm greatly saves memory space by adding a prefix code stack and a suffix code stack. The DDQT algorithm is simple, and there is no limit on the length of the electronic tag to be queried. Compared with the previous query-tree algorithms, the DDQT algorithm has obvious improvements in query comparison times, empty query times, and occupied memory space. It can effectively remove idle nodes, shorten recognition time and save memory resources, thus improving the speed and accuracy of label recognition to some extent.

Channel-Quality Aware RFID Tag Identification Algorithm to Accommodate the Varying Channel Quality of IoT Environment

Radio Frequency Identification (RFID) technique is broadly adopted as the automated identification system for the Internet of Things (IoT). Many RFID anti-collision algorithms were proposed to accelerate the tag identification process. However, they misjudged some unreadable slots which were due to collision instead of the bad channel condition, causing low bandwidth usage. This study proposes the Channel-quality Aware Query Tree algorithm (CAQT) to improve the identification performance in an error-prone channel environment. CAQT has three novel features: (1) it estimates the channel quality continuously and statistically in the rapidly changing channel quality environment; (2) it asks the tag for retransmission or to split the collide tags based on the channel quality; (3) the number of the groups which it splits tags is based on the estimated number of tags collide in current slot. The simulation results show that CAQT uses less than 31% slots compared with the conventional algorithms. The simulation results also demonstrate that CAQT provides enhanced performance when the channel quality is varying especially in outdoor environment, for example, ticket checking for railway or subway system.

Research on Anti-Collision Algorithm of RFID Tags in Logistics System

In order to solve the problem of RFID tags collision in the current logistics system. Based on the study of existing anti-collision algorithms, a grouped dynamic frame slot with query tree (GDQT) algorithm was designed for a large number of labeling scenarios in logistics management. The GDQT algorithm first estimates the number of tags that have not been identified after each round of identification by the tag estimation algorithm, if less than or equal to 354, the tags were first identified using the dynamic frame slot ALOHA (DFSA) algorithm., and then using the query tree algorithm (QT) for the remaining tags identification. If the number of unrecognized tags was greater than 354, the tags should be first grouped, and then DFSA and QT would be used for tags identification. The simulation results showed that GDQT algorithm can improve system throughput rate and keep throughput rate at around 0.82, which is 300%, 120%, 50% higher than the DFSA algorithm, GDFSA algorithm and AHT algorithm respectively. Therefore, The GDQT algorithm has a good application prospect in the logistics system.

Study on optimization of anti-collision algorithm for mixed query tree

This paper studies the hybrid query tree algorithm, which uses the combined information of the largest and smallest collision bits to classify the markers. The labels are placed in four matrices to reduce collisions. The function analysis shows that the algorithm is better than QT and HQT by reducing the number of queries and system communication frequency. Thereby greatly improving the efficiency of label recognition.

Memoryless Query Tree Algorithm for Identifying Tags in Passive RFID Systems

Memoryless Query Tree Algorithm for Identifying Tags in Passive RFID Systems

A Two-way Hybrid Query Tree Anti-collision Algorithm

Based on the Hybrid Query tree algorithm, this new algorithm compares the sums of collision distances: in forward direction, utilizing the combined information of the highest and the second highest bit of collision, categorizes the tags and decides gaps of delay to reduce collision; In reverse, utilizing collision template to form identification tree by using leaf nodes of electronic tags. The findings from the simulated experiments show that this proposed algorithm is superior to QT and HQT by decreasing the number of query and the traffic volume of system communication so that the efficiency of tag identification is greatly enhanced.

Design of a Quaternary Query Tree ALOHA Protocol Based on Optimal Tag Estimation Method

Radio Frequency Identification (RFID) technology is one of the most promising technologies in the IoT (The Internet of Things) era. Many RFID systems have been used in supermarkets or warehouses. There are two challenges for RFID anti-collision algorithms. The first challenge is accurately estimating the number of tags; the other is improving the efficiency of RFID systems. This paper proposes an optimal tag estimation method in which tags respond to the reader in assigned time slots instead of responding randomly. In order to improve the performance of the RFID system, a 4-ary query tree Additive Link On-line HAwaii (ALOHA) protocol is presented that combines the merits of query tree algorithm and frame slotted ALOHA, and avoids their weaknesses. Simulation results show that the proposed algorithm has a higher tag identification efficiency compared to other dynamic frame slotted ALOHA algorithms, and it can overcome the tag starvation phenomenon, because it traces each tag until all of them are identified successfully.

An Enhanced Collision Tracking Tree Algorithm in Radio Frequency Identification System

In order to solve multi-tag collision problem in radio frequency identification system, many anti-collision algorithms have been proposed, such as query tree algorithm, bi-slotted collision tracking tree algorithm (BSCTTA). In this paper, an enhanced collision tracking tree algorithm is proposed to improve the performance of BSCTTA. The proposed algorithm generates prefix depending on the first collided bit, and then eliminates the idle timeslots and reduces the collided timeslots. Moreover, the proposed algorithm can identify two tags in a timeslot if there is only one collided bit in the response data, and can truncate unvalued data when two collided bits are detected. The simulation results show that the proposed algorithm reduces the communication bits and query cycles than other algorithms, therefore enhances the identification efficiency and identification speed of radio frequency identification system.

A Novel Anti-Collision Algorithm of Tags in RFID System

Anti-collision algorithm of label is a key technique to enhance identifying efficiency in the RFID system. This paper make a new conception of couple of single-bit collision that based on the elementary query tree algorithm and two improved algorithm analyzed in detail. Meliorating the both back query tree algorithm and dynamic back query tree algorithm by single-bit anti-collision algorithm could achieve the function that discern double labels at the same time by inquiry once. Simulation results show that the single-bit anti-collision could reduce times and time of total inquiries, particularly, dominant improvement of deterministic algorithm by this algorithm when the amount of labels above and beyond half capacity permitted by collision bits.

Modified M-ary QT Algorithm to Improve the Performance of the Anti-collision Protocol for RFID Tag Identification

The Radio Frequency Identification (RFID) system is a newemerging technology used to identify a tag attached to an object. To make RFID systems practical, the cost of RFIDtags is very important. Further, an interrogator should be able to identify thenumber of tags in the reading range in a short time. The most important technical issue in radio frequency identification (RFID) is to correctly and quickly recognize the number of tag IDs in the reader’s communication range. Unlike the probabilistic RFID tag identification schemes, a query tree(QT)-based protocol guarantees the identification of all the tags, where the distribution of tag IDs is assumed to be uniform. In this paper, we proposed an extended M-ary QT protocol, which effectively reduces unnecessary query-response cycles by using a non-sequential m-bit recognition method. The simulation results show that the proposed scheme significantly outperforms M-ary QT schemes in terms of identification time, efficiency and communications overhead.

An Improved Query Tree Anti-Collision Algorithm Using Collision Location

In order to reduce the identification delay and the energy consumption of the Query Tree Anti-collision Algorithm, the disadvantage of the current query tree anti-collision algorithms is analyzed and an improved query tree anti-collision algorithm is proposed, which is called collision Location based Hybrid Query Tree (LHQT) algorithm. In the algorithm, Manchester code is used and collision location is detected when a collision occurs. Then collision location is used to update quickly and accurately the query prefix in Query Tree (QT) algorithm and Hybrid Query Tree (HQT) Algorithm. Theoretical analysis and simulation show that the proposed algorithm can efficiently decrease the identification cycles and transmitted bits, which reduce the identification delay and the energy consumption.

Query Tree Algorithm for RFID Tag with Binary-Coded Decimal EPC

A tag-collision problem in Radio Frequency Identification (RFID) system is the event that a reader cannot identify a tag if many tags respond to a reader at the same time. Although binary Electronic Product Code (EPC) is the most natural for a computer, most people are accustomed to the decimal system. In RFID applications, we need to convert binary EPC to decimal numbers. Since converting binary-coded decimal (BCD) data into the decimal numbers is much less complex than converting binary data into decimal numbers. This motivates us to represent EPC by BCD. However, using BCD-based EPC delivers two problems: (i) Is the existing query tree algorithm suitable for identifying BCD-based EPC? (ii) How do we design a new query tree algorithm to enhance the tag-identification efficiency? In this work, we solved the problems.

Enhanced Anti-Collision Protocol for Identification Systems: Binary Slotted Query Tree Algorithm

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.

An Effective 16-bit Random Number Aided Query Tree Algorithm for RFID Tag Anti-Collision

A tag-collision problem (or missed reads) in RFID system is the event that a reader cannot identify the tag if many tags respond to a reader at the same time. Recently, Choi et al. proposed a 16-bit random number query tree algorithm (RN16QTA) for RFID tag anti-collision by using a RN16 as the tags temporary ID. RN16QTA successfully reduce the time consumption for tag identification than the present identification implemented in EPC Class 1 Gen. 2. However, simulation results and the theoretical estimation imply that the length of RN16 is actually not enough in real environments to successfully identify tags. In this letter, we propose an effective RN16QTA (ERN16QTA) to really solve the tag collision in tags identification. Moreover, our new algorithm saves the responded bits.

RFID시스템에서 슬롯의 혼잡도를 이용한 DFS-ALOHA 알고리즘

For the implementation of a RFID system, an anti-collision algorithm is required to identify multiple tags within the range of a RFID Reader. There are two methods of anti-collision algorithms for the identification of multiple tags, conclusive algorithms based on tree and stochastic algorithms based on slotted ALOHA. In this paper, we propose a Dynamic Framed Slotted ALOHA-Slot Congestion(DFSA-SC) Algorithm. The proposed algorithm improves the efficiency of collision resolution. The performance of the proposed DFSA-SC algorithm is showed by simulation. The identification time of the proposed algorithm is shorter than that of the existing DFSA algorithm. Furthermore, when the bit duplication of the tagID is higher, the proposed algorithm is more efficient than Query Tree algorithm.