An Efficient Anti-Collision Protocol for RFID Tag Identification

Jia, Xiaolin; Feng, Quanyuan; Ma, Chengzhen

doi:10.1109/lcomm.2010.091710.100793

Cited by 119 publications

(68 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Each tag can transmit the information only at one slot in each frame. Dynamic frame slotted ALOHA (DFSA) [14][15][16][17][18][19][20], follows the similar concept as FSA but here the size of the frame is dynamic, i.e., frame can have different number of slots. The frame sizes are determined dynamically with respect to the information about remaining unidentified tags, number of collided slots and so on.…”

Section: Collision Resolution Algorithmsmentioning

confidence: 99%

A Reduced Complexity of Vahedi's Tag Estimation Method for DFSA

Wijayasekara¹,

Annur²,

Sasithong³

et al. 2017

View full text Add to dashboard Cite

Abstract. In order to calculate the number of tags in a radio frequency identification (RFID) system, several tag estimation methods have been investigated in literature and most of the available estimation methods need the overall knowledge of idle, success and collision slots of the previous frame to carry out the tag estimation process. In this article, we present three techniques to reduce the complexity of Vahedi's tag estimation for tag King Mongkut's University of Technology North Bangkokcollision resolution in RFID systems using dynamic frame slotted ALOHA. Our modified and useful approach considers the information about only the number of empty, successful or colliding slots in the previous frame for the tag estimation. Three decision rules were obtained by maximizing the likelihood of success, idle and collision which helps in the reduction of complexity substantially. However, the accuracy of estimation decreases for success-only and idle-only methods while the collision-only method gives a consistent and lower estimate error when the frame sizes and the number of tags increase.

show abstract

Section: Collision Resolution Algorithmsmentioning

confidence: 99%

A Reduced Complexity of Vahedi's Tag Estimation Method for DFSA

Wijayasekara¹,

Annur²,

Sasithong³

et al. 2017

View full text Add to dashboard Cite

show abstract

“…In the stack scheme, pre-order traversal is performed using a stack instead of a queue [3][4][5]. In this scheme, the reader pushes s||1 into a stack and broadcasts a new query s||0 when a collision for query s occurs.…”

Section: Related Workmentioning

confidence: 99%

“…1 can be converted into the compressed query tree of Fig. 2, which is also called a collision tree or compressed binary trie [5][6][7]. This conversion can simply be done by removing all the internal nodes with only one child, not counting empty leaf nodes represented by dashed rectangles (i.e., nodes C and D of Fig.…”

Section: Related Workmentioning

confidence: 99%

“…This represents a collision among tag IDs. The authors of [5], [6], and [8] proposed efficient protocols using this compressed query tree and showed the efficiency of these protocols via experiments. Their works assume the Manchester code, which can detect the position of the collision from the responses of the tags [9].…”

Section: Related Workmentioning

confidence: 99%

“…In the stack scheme, pre-order traversal is performed using a stack instead of a queue [3][4][5]. By simply using a stack, the worst-case space complexity is reduced to O(n 2 ) since the maximum number of queries in the stack is O(n) equal to the height of the query tree and the size of each query is O(n).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Memory Efficient Anti-Collision Protocol to Identify Memoryless RFID Tags

2014

J Inf Process Syst

View full text Add to dashboard Cite

This paper presents a memory efficient tree based anti-collision protocol to identify memoryless RFID (Radio Frequency Identification) tags that may be attached to products. The proposed deterministic scheme utilizes two bit arrays instead of stack or queue and requires only ϴ(n) space, which is better than the earlier schemes that use at least O(n 2 ) space, where n is the length of a tag ID in a bit. Also, the size n of each bit array is independent of the number of tags to identify. Our simulation results show that our bit array scheme consumes much less memory space than the earlier schemes utilizing queue or stack.

show abstract

A new anti‐collision algorithm for RFID tag

Zhang

Pan

et al. 2013

Int J Communication

View full text Add to dashboard Cite

SUMMARY We present a new radio frequency identification tag anti‐collision algorithm in this paper. The main idea of this algorithm is that we should find the collided bit at first, and every tag contains a register RC, which has length the same as the tag's ID length to store the conflict bit, then all the subsequent processing are based on the conflict bit. In this new algorithm, tag uses a binary pulse string to transfer data to the reader, compared with the traditional query tree‐based algorithms, which is based on the tag's ID; this new algorithm is more efficient and requires fewer read cycles for tag's identification. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

An Efficient Anti-Collision Protocol for RFID Tag Identification

Cited by 119 publications

References 7 publications

A Reduced Complexity of Vahedi's Tag Estimation Method for DFSA

A Reduced Complexity of Vahedi's Tag Estimation Method for DFSA

A Memory Efficient Anti-Collision Protocol to Identify Memoryless RFID Tags

A new anti‐collision algorithm for RFID tag

Contact Info

Product

Resources

About