Suffix-based double reader tag movement RFID anti-collision method

Lv, Haochen; Li, Xiaowu; Jia, Lianyin; Li, Runxin; Ding, Jiang; You, Jane

doi:10.1186/s13677-021-00228-8

Cited by 6 publications

(4 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many researchers presented the corresponding work to cope with the R2Rc issue. e authors in [14] proposed a probability-based query tree (PBQT) protocol. In PBQT protocol, the conflict identification and useless identification can be avoided via the shared information between the readers.…”

Section: Related Workmentioning

confidence: 99%

An Improved Approach for Reader Anti-Collision in Industrial Internet of Things

Qian

2022

Security and Communication Networks

View full text Add to dashboard Cite

Radio-frequency identification (RFID) technology has been used in numerous applications, e.g., supply chain management and inventory control. This paper focuses on the practically important problem of reader-to-reader collision in large-scale RFID systems. There are many technical challenges during the existing work such as high computational complexity and low identification efficiency. To tackle the above challenges, this paper proposes a novel reader anti-collision protocol optimized by minimal reverse weight (NRA-MRW), which includes two phases. Extensive simulation results show that our proposed NRA-MRW can improve the identification efficiency and system throughput over the existing protocols by 25.2% and 12.3%, respectively.

show abstract

Section: Related Workmentioning

confidence: 99%

An Improved Approach for Reader Anti-Collision in Industrial Internet of Things

Qian

2022

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…This is another reason RFID is seen as inevitable to achieving the dreams of IoT, which is to enable just anything to have connectivity. RFID unique ID (EPC) is 96-bits and is accessible in the cloud via EPCIS (EPC information service) [42]. Therefore, RFID tagged things are uniquely identifiable and when interfaced with say 5G network can achieve IoT's dream.…”

Section: Binary To Decimal Conversion Of Datamentioning

confidence: 99%

“…Therefore, RFID tagged things are uniquely identifiable and when interfaced with say 5G network can achieve IoT's dream. As can be seen in Table 1, EPC is long [42] and because of space limitations, this paper utilizes only 16-bits out of the 96-bits for analysis and evaluation.…”

Section: Binary To Decimal Conversion Of Datamentioning

confidence: 99%

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

et al. 2023

View full text Add to dashboard Cite

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.INDEX TERMS Dynamic frame slotted aloha, Internet of Things, k-means clustering, RFID anti-collision algorithm, tag grouping, frame size table.

show abstract

“…When the number of slots is much larger than the number of labels, there will be a lot of empty slots, resulting in waste. Based on this principle, it is necessary to find a suitable number of time slots for system operation to improve the efficiency of the system [12].…”

Section: Anti‐collision Algorithm and Improvement Analysismentioning

confidence: 99%

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

Bai

et al. 2021

IET Communications

View full text Add to dashboard Cite

In recent years, the rapid development of the Internet of Things (IoT) technology has provided a strong technical support for the technological transformation of the logistics industry. The informatization development of logistics industry increasingly relies on the Internet of Things technology represented by Radio Frequency Identification (RFID) technology. These technologies lead the whole business process to optimize the business process in the direction of accurate, efficient and real-time. In order to solve the problem that the reader cannot identify the label information correctly due to the phenomenon of data collision in the application of RFID technology, this paper proposes an anti-collision algorithm based on Slotted Random Regressive-style Binary Search Tree (SR-RBST). Based on Slotted ALOHA (SA) the method proposed in this paper uses the Regressive-style Binary Search Tree (RBST) to process the RFID labels in the collision time slot. With the same size of tags, the SR-RBST algorithm needs less total time slot and has higher efficiency and shorter identification time, while with the increase of the number of tags, the SR-RBST anti-collision algorithm has more obvious advantages. The SR-RBST algorithm effectively improves the time slot utilization efficiency of the system.This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

show abstract

Suffix-based double reader tag movement RFID anti-collision method

Cited by 6 publications

References 31 publications

An Improved Approach for Reader Anti-Collision in Industrial Internet of Things

An Improved Approach for Reader Anti-Collision in Industrial Internet of Things

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

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

Contact Info

Product

Resources

About