An anti-collision algorithm for RFID-based robots based on dynamic grouping binary trees

Zhang, Yin; Yang, Fan; Wang, Qian; He, Qianlin; Li, JiaCheng; Yue, Yang

doi:10.1016/j.compeleceng.2017.03.003

Cited by 13 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nautical chart tags are characterized by high density and 100% overlap.The key of rapid identification technology of nautical charts based on RFID is to adopt multi-tag anti-collision algorithm, develop a decoder that can adapt to dense reading, and realize an accurate reading of dense nautical chart tags [10] .The anti-collision algorithm is called DDS-BT (Dynamic Disperse Shrink-Binary Tree). Each time the tag is powered up, the internal time slot counter is reset to 0.…”

Section: Anti-collision Algorithmmentioning

confidence: 99%

Research on rapid identification technology of nautical charts based on radio frequency identification

2024

Third International Conference on Electronic Information Engineering, Big Data, and Computer Technology (EIBDCT 2024)

View full text Add to dashboard Cite

This paper takes a pioneering step by introducing Radio Frequency Identification (RFID) technology into the management of nautical charts, aiming to alleviate the challenges of labor-intensive processes, heavy workloads, and error-prone tasks. This technology involves equipping traditional nautical chart cabinets with RFID systems. These systems leverage binary tree anti-collision algorithms to accurately scan densely labeled chart tags, swiftly identifying nautical chart information. Experimental findings reveal that the main factor affecting the probability of successful detection of nautical charts is the transmit power of the reader rather than the tag sensitivity, when the RF transmit power is set to 27dBm, the success probability of nautical chart detection is optimal. And with the number of paper nautical charts stored in each drawer limited to 100 sheets or fewer, the inventory time for each drawer remains below 1.2 seconds, achieving a detection success rate exceeding 99.6%. The utilization of this technology satisfies the demand for rapid identification of paper nautical charts. It can remarkably contribute to the informatization construction of nautical chart management units and serve as a valuable model for managing data stored in dense configurations.

show abstract

Section: Anti-collision Algorithmmentioning

confidence: 99%

Research on rapid identification technology of nautical charts based on radio frequency identification

2024

Third International Conference on Electronic Information Engineering, Big Data, and Computer Technology (EIBDCT 2024)

View full text Add to dashboard Cite

show abstract

“…BS uses the collided bits in tag data [2] [3]. BS sends unique serial numbers to all tags at a fixed time in sync with the reader.…”

Section: Binary Search (Bs)mentioning

confidence: 99%

Hybrid Dynamic-Binary ALOHA Anti-Collision Protocol in RFID Systems

Kim¹

2018

IJET

View full text Add to dashboard Cite

The main techniques for identifying objects in an Internet of things environment are based on radio frequency identification, in which a specific object is identified by the reader through the tag mounted on the object. When there are multiple tags in the reader's interrogation zone, they respond simultaneously to the reader's request, thus causing a collision between the signals sent simultaneously to the reader from those tags. Such collisions reduce the data accuracy and prolong the identification time, thus making it difficult to provide a rapid service. This paper explores a hybrid anti-collision protocol, namely, the hybrid dynamic-binary ALOHA anti-collision protocol, which is designed to prevent tag collision and to enable more stable information transmission by improving the existing tag anti-collision protocols. The proposed protocol has achieved performance enhancement by shortening the tag identification process when tag collision occurs by combining the ALOHA and binary search protocols. In contrast to the existing protocols, whereby the reader's request is repeated after detecting a collision, the proposed protocol shortens the tag identification time by requesting only the collision bits. This contributes to a substantial reduction in the object identification time in an IoT environment.

show abstract

“…The deterministic algorithms ensure that all tags in the identified range are identified, but often do not perform well in communication efficiency. Recently, several algorithms such as tag grouping [16,17], bit tracking [18,19], and multi-bit identification have been proposed to improve the performance of RFID identification. Jung has proposed an Optimized Binary Search with Multiple Collision Bits Resolution Anti-Collision Algorithm (OBS-MCBR) [20].…”

mentioning

confidence: 99%

An Anti-Collision Algorithm for RFID Based on an Array and Encoding Scheme

Liu

2018

Information

View full text Add to dashboard Cite

In order to solve the problem of tag collision in Radio Frequency Identification (RFID) system, the paper proposes a Multi-Bit Identification Collision Tree (MICT) algorithm based on a collision tree. The algorithm uses an array scheme to mark the collision bits in the identification process, and determines the collision information according to the first few bits of the tag, which can effectively reduce the number of recognitions and the amount of communication data. The testing results show that the proposed algorithm reduces the time complexity by about 38% and the communication complexity by about 27% compared to existing collision-tree-based algorithms. Through theoretical analysis and experimental evaluation, the MICT algorithm has obvious advantages in terms of time and communication complexity compared to the other typical algorithms. The algorithm can be applied to the field of RFID-related systems to significantly improve the system efficiency. IntroductionRFID technology is a non-contact intelligent identification technology. Compared to traditional automatic identification technology, it has the advantages of small volume, low cost, large storage, high security, and reusability. As a result, RFID is rapidly replacing outdated barcode systems and various smartcard systems. RFID systems have great application value in the fields of industrial production, logistics, cargo and health management, safety inspection, and intelligent transportation [1][2][3][4]. However, in the process of RFID identification of multiple tags simultaneously, the collision between tags is a key issue affecting the efficiency of RFID identification.Several classical algorithms have been presented, such as the ALOHA algorithm [5,6], the Query Tree (QT) [7-10] algorithm, the Collision Tree (CT) algorithm [11], etc. These anti-collision algorithms can be divided into two categories: probabilistic methods based on ALOHA, and deterministic methods based on tree structure [12][13][14][15]. The probabilistic identification algorithms are simple to design and the identification time is short, but there will be a "tag hunger" problem. The deterministic algorithms ensure that all tags in the identified range are identified, but often do not perform well in communication efficiency. Recently, several algorithms such as tag grouping [16,17], bit tracking [18,19], and multi-bit identification have been proposed to improve the performance of RFID identification. Jung has proposed an Optimized Binary Search with Multiple Collision Bits Resolution Anti-Collision Algorithm (OBS-MCBR) [20]. In this algorithm, the collision bits are extracted and coded, and the collision location information is restored according to the collision situation. The performance of the algorithm is 30% higher than that of the CT algorithm. Wang has put forward an anti-collision algorithm based on multi-bit identification (MBI) [21]. The algorithm makes full use of the collision information of a certain length, and uses a distinguishable grouping scheme to group the spec...

show abstract

An anti-collision algorithm for RFID-based robots based on dynamic grouping binary trees

Cited by 13 publications

References 23 publications

Research on rapid identification technology of nautical charts based on radio frequency identification

Research on rapid identification technology of nautical charts based on radio frequency identification

Hybrid Dynamic-Binary ALOHA Anti-Collision Protocol in RFID Systems

An Anti-Collision Algorithm for RFID Based on an Array and Encoding Scheme

Contact Info

Product

Resources

About