A semi-blocking algorithm on adaptive query splitting for RFID tag identification

Lai, Yuan‐Cheng; Lin, Chih-Chung; Lee, Chih‐Hao

doi:10.1186/1687-1499-2013-231

Cited by 7 publications

(8 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we analyze the performance of SABA by comparing it with AQS [11], SBA [12] and MUIP [15]. QT is not considered, because the performance of QT is even much poorer than AQS.…”

Section: Simulations and Discussionmentioning

confidence: 99%

“…The principle of the tree-based algorithms is that the reader continuous divides the tags into two subsets until a subset only contains one tag. Tree-based algorithms can be further classified into binary tree (BT) based [4][5][6][7][8] and query tree (QT) based [9][10][11][12]. The QT based algorithms are much simpler than the BT based algorithms, and we mainly focus on the QT based algorithms in this paper.…”

Section: Introductionmentioning

confidence: 99%

“…For another instance, in an exhibition, the organizers want to get the real-time number of visitors in each showroom. For these applications, some algorithms such as the adaptive query splitting algorithm (AQS) [11] and the novel semi-blocking AQS (SBA) [12] were proposed. In these methods, all staying tags retransmit their IDs to the reader to be identified.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Slot Allocated Blocking Anti-Collision Algorithm for RFID Tag Identification

2015

KSII TIIS

View full text Add to dashboard Cite

In many Radio Frequency Identification (RFID) applications, the reader recognizes the tags within its scope repeatedly. For these applications, some algorithms such as the adaptive query splitting algorithm (AQS) and the novel semi-blocking AQS (SBA) were proposed. In these algorithms, a staying tag retransmits its ID to the reader to be identified, even though the ID of the tag is stored in the reader's memory. When the length of tag ID is long, the reader consumes a long time to identify the staying tags. To overcome this deficiency, we propose a slot allocated blocking anti-collision algorithm (SABA). In SABA, the reader assigns a unique slot to each tag in its range by using a slot allocation mechanism. Based on the allocated slot, each staying tag only replies a short data to the reader in the identification process. As a result, the amount of data transmitted by the staying tags is reduced greatly and the identification rate of the reader is improved effectively. The identification rate and the data amount transmitted by tags of SABA are analyzed theoretically and verified by various simulations. The simulation and analysis results show that the performance of SABA is superior to the existing algorithms significantly.

show abstract

Section: Simulations and Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Slot Allocated Blocking Anti-Collision Algorithm for RFID Tag Identification

2015

KSII TIIS

View full text Add to dashboard Cite

show abstract

“…In these protocols, RFID readers accomplish tag identification processes repeatedly, and RFID tags are classified into three groups based on the tag mobility (i.e, object tracking and monitoring): staying tags, arriving tags, and leaving tags. There are two types of adaptive splitting protocols: adaptive binary splitting [21,22] and adaptive query splitting [23,24]. In adaptive binary splitting, tag identification process is started from only readable cycles of the last frame and random numbers are used to split tag sets.…”

Section: Adaptive Tree-based Protocolsmentioning

confidence: 99%

Performance Analysis of Tree-Based Tag Anti-Collision Protocols for RFID Systems

Yüksel¹,

Fidan²

2019

Electrica

View full text Add to dashboard Cite

In today's fast-changing competitive environment, companies and organizations need to develop their services, applications, and business processes continuously in order to benefit more from time and resources. Radio Frequency Identification (RFID), as one of the technological innovations, is an autoid technology that enables many new application domains in diverse scientific fields and provides important opportunities to build efficient industrial systems. It is capable of identifying, locating, tracking and monitoring objects, and offers companies and organizations important advantages to develop efficient and successful business applications. In RFID systems, tag identification is a critical process. However, tag collisions occur when multiple tags transmit their IDs to a reader simultaneously, and thus affect the stability of the RFID system. Therefore, a powerful tag anti-collision mechanism is required to accelerate the tag identification process while minimizing the collision effects. In this paper, we presented a performance analysis of some of the tree-based tag anti-collision protocols (binary tree, query tree, adaptive binary tree, and adaptive query tree) to evaluate the tag identification process for the RFID system in an IoT environment. In our experiments, we observed that adaptive tree-based tag anti-collision protocols have better performance than the binary tree protcol and the query tree protocol.

show abstract

“…Hae-il Choi and Sunwoong Choi applications such as object locating, monitoring, and tracking. Many protocols [1,2,3,4,5] have been proposed for the problem. The basic idea is to keep the information acquired from the last process of tag identification.…”

mentioning

confidence: 99%

Fast transition for couple-resolution blocking protocol in RFID systems

Choi¹,

Choi²

2016

ces

View full text Add to dashboard Cite

RFID applications such as monitoring an object for a long time need to identify tags repeatedly within the scope of the reader. Re-identification process can be improved using the tag information obtained in the previous cycle. CRB protocol utilizes the blocking technique that distinguishes staying tags and arriving tags. Staying tags are re-identified by utilizing the previous tag information in the first phase. In this paper, we propose fast transition algorithm to improve the CRB protocol. If the staying tag ratio is lower than a certain threshold, reader immediately proceeds to the second phase where the existing query tree protocol is used. We show the fast transition improves the identification efficiency of CRB protocol through computer simulation.

show abstract

A semi-blocking algorithm on adaptive query splitting for RFID tag identification

Cited by 7 publications

References 23 publications

A Slot Allocated Blocking Anti-Collision Algorithm for RFID Tag Identification

A Slot Allocated Blocking Anti-Collision Algorithm for RFID Tag Identification

Performance Analysis of Tree-Based Tag Anti-Collision Protocols for RFID Systems

Fast transition for couple-resolution blocking protocol in RFID systems

Contact Info

Product

Resources

About