Anti‐collision algorithm based on slotted random regressive‐style binary search tree in RFID technology

Ai, Yibo; Bai, Tianrui; Xu, Yue; Zhang, Weidong

doi:10.1049/cmu2.12247

Cited by 13 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This algorithm processed RFID tags through a regression binary search tree. In the same experimental conditions, the algorithm had higher efficiency and less time spent on recognition [10]. X. Yuan et al designed an enhanced fast Q algorithm to improve the recognition efficiency of radio frequency identification systems.…”

Section: Related Workmentioning

confidence: 99%

Wireless Power Supply Sensing Tags Based on Anti-Collision Algorithm for Sensing Systems

2024

IEEE Access

View full text Add to dashboard Cite

In wireless sensor networks, sensing tags are battery powered, which also limits the battery life. Therefore, it is particularly important to study self powered sensing tags. At present, passive wireless identification systems can achieve self powered communication through tags.However, wireless power supply sensing systems have problems such as low efficiency and short communication distance. To reduce the power consumption of sensing tags and improve the efficiency of sensing systems, a passive wireless low-power hydrogen concentration sensing system is designed. To further reduce the power consumption of sensing tags, a passive wireless magnetic field intensity sensing system is developed.In addition, to solve the low efficiency of multiple sensing labels in wireless power supply sensing systems, an efficient anticollision algorithm based on dynamic binary query trees is designed. According to the research results, in the cold start indoor environment, the energy collection rate of the sensing tag designed in the research was 0.081mJ/s, and the energy collection efficiency was 25.7%.In single/dual sensor mode, the maximum values of sensing error were 2.1% and 5.2%, respectively. The maximum recognition time of the anticollision algorithm based on dynamic multi base query tree was 2.78s, and the minimum value was 1.31s.The research results can provide methodological and technical support for the improvement of wireless power supply sensing systems, expanding the application range of wireless power supply sensing systems.

show abstract

Section: Related Workmentioning

confidence: 99%

Wireless Power Supply Sensing Tags Based on Anti-Collision Algorithm for Sensing Systems

2024

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Using binary search trees and regressive algorithms may require more computational resources. This may increase the processing load on the RFID reader, affecting overall performance and responsiveness 35 …”

Section: Related Workmentioning

confidence: 99%

A constructive Steiner graph matching for Radio frequency identification device tag detection in wireless and internet of things environment

Sathishkumar,

Rajan,

Geetha

2024

Int J Communication

View full text Add to dashboard Cite

SummaryRadio frequency identification device (RFID) has emerged as one of the most potential building blocks for future IoT‐enabled technologies. Various applications like logistic monitoring use the RFID system to deal with the tagged objects. RFID‐based tracking approach is extremely solicited for appropriate logistic distribution because of the frequent tagged‐objects rearrangements. Nevertheless, with an RFID system, one of the most significant issues is resolving collisions between tags as they transfer data to the reader at the same time. This work investigates the core issue of locating all lost tags in RFID systems. The most significant factor in missing tag recognition is to reduce the time required for execution. A problem needs to be formulated to differentiate the tagged objects' motion state, that is, static or dynamic, to handle this issue. It tracks the moving objects with various existing localization approaches. Finally, a tag detection known as constructive Steiner graph matching (CSGM) detection is proposed to achieve time efficiency by utilizing RFID collision signals. Specifically, the physical‐layer features are considered for differentiating the positions. Experimental outcomes demonstrate that the anticipated model can attain better prediction accuracy by reducing inventory time compared to other approaches. Simulation findings show that the suggested approach performs exceptionally well in giving a significant performance boost in an RFID system. It minimizes the complexity of tracking the objects. The simulation outcomes illustrate that the algorithm's identification speed is substantially enhanced and ensuring high system efficiency. The simulation results of the proposed algorithm have been improved in terms of system efficiency (9.5%), success rate (6.3%), and identification speed (4%) compared to the conventional algorithm. The suggested CSGM technique's average waiting time is decreased by more than 45.372%, and its detection speed is increased by at least 38.219% compared to other existing algorithms.

show abstract

“…When multiple tags have a long common prefix, the reader needs to receive multiple conflicting signals in order to break up the relevant tags into smaller groups. To this end, researchers have successively proposed a number of improvements [27][28][29][30][31][32][33]. Among them, the literature [27] proposes a dynamic multi-ary query tree collision protocol for RFID systems which can completely eliminate empty slots and greatly reduce collision slots.…”

Section: Research Status At Home and Abroadmentioning

confidence: 99%

A Review of Tags Anti-Collision Identification Methods Used in RFID Technology

Wang,

Luo,

Guo

et al. 2023

Electronics

View full text Add to dashboard Cite

With radio frequency identification (RFID) becoming a popular wireless technology, more and more relevant applications are emerging. Therefore, anti-collision algorithms, which determine the time to tag identification and the accuracy of identification, have become very important in RFID systems. This paper presents the algorithms of ALOHA for randomness, the binary tree algorithm for determinism, and a hybrid anti-collision algorithm that combines these two algorithms. To compensate for the low throughput of traditional algorithms, RFID anti-collision algorithms based on blind source separation (BSS) are described, as the tag signals of RFID systems conform to the basic assumptions of the independent component analysis (ICA) algorithm. In the determined case, the ICA algorithm-based RFID anti-collision method is described. In the under-determined case, a combination of tag grouping with a blind separation algorithm and constrained non-negative matrix factorization (NMF) is used to separate the multi-tag mixing problem. Since the estimation of tag or frame length is the main step to solve the RFID anti-collision problem, this paper introduces an anti-collision algorithm based on machine learning to estimate the number of tags.

show abstract

Anti‐collision algorithm based on slotted random regressive‐style binary search tree in RFID technology

Cited by 13 publications

References 10 publications

Wireless Power Supply Sensing Tags Based on Anti-Collision Algorithm for Sensing Systems

Wireless Power Supply Sensing Tags Based on Anti-Collision Algorithm for Sensing Systems

A constructive Steiner graph matching for Radio frequency identification device tag detection in wireless and internet of things environment

A Review of Tags Anti-Collision Identification Methods Used in RFID Technology

Contact Info

Product

Resources

About