Efficient tag reading protocol for large-scale RFID systems with pre-reading

Tsai, Shuen-Chih; Hu, Y. M.; Chai, Chen-Hsun; Li, Jung-Shian

doi:10.1016/j.comcom.2016.04.019

Cited by 13 publications

(9 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first issue requires that the emphasis be placed on reducing the number of collisions while the second one on scanning a group of known tags and identifying missing tags in the current round [ 21 , 22 ]. When the number of tags is equal to the number of slots in the initial frame, BTSA achieves the highest efficiency value of 0.43 [ 23 ], which is greater than the pure binary tree protocol [ 24 ] and the dynamic frame slotted ALOHA (Dynamic FSA) [ 12 ] with the same efficiency as the tree slotted ALOHA protocol (TSA) [ 18 , 25 ]. Different protocols have applied BTSA, such as Modified Q [ 26 ], estimation based FSA and binary selection [ 27 ] and adoptive binary splitting (ABS) [ 28 ].…”

Section: Related Workmentioning

confidence: 99%

Improving Efficiency of Passive RFID Tag Anti-Collision Protocol Using Dynamic Frame Adjustment and Optimal Splitting

Memon

Yasir

et al. 2018

Sensors

View full text Add to dashboard Cite

Radio frequency identification is a wireless communication technology, which enables data gathering and identifies recognition from any tagged object. The number of collisions produced during wireless communication would lead to a variety of problems including unwanted number of iterations and reader-induced idle slots, computational complexity in terms of estimation as well as recognition of the number of tags. In this work, dynamic frame adjustment and optimal splitting are employed together in the proposed algorithm. In the dynamic frame adjustment method, the length of frames is based on the quantity of tags to yield optimal efficiency. The optimal splitting method is conceived with smaller duration of idle slots using an optimal value for splitting level Mopt, where (M > 2), to vary slot sizes to get the minimal identification time for the idle slots. The application of the proposed algorithm offers the advantages of not going for the cumbersome estimation of the quantity of tags incurred and the size (number) of tags has no effect on its performance efficiency. Our experiment results show that using the proposed algorithm, the efficiency curve remains constant as the number of tags varies from 50 to 450, resulting in an overall theoretical gain in the efficiency of 0.032 compared to system efficiency of 0.441 and thus outperforming both dynamic binary tree slotted ALOHA (DBTSA) and binary splitting protocols.

show abstract

Section: Related Workmentioning

confidence: 99%

Improving Efficiency of Passive RFID Tag Anti-Collision Protocol Using Dynamic Frame Adjustment and Optimal Splitting

Memon

Yasir

et al. 2018

Sensors

View full text Add to dashboard Cite

show abstract

“…Many papers have generated large amounts of valuable research about the tree-based algorithm [12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29]. The key technology of this algorithm is bit identification and bit tracking.…”

Section: Introductionmentioning

confidence: 99%

Time Slot Detection‐Based M‐ary Tree Anticollision Identification Protocol for RFID Tags in the Internet of Things

Yang

et al. 2021

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Recently, a number of articles have proposed query tree algorithms based on bit tracking to solve the multitag collision problem in radio frequency identification systems. However, these algorithms still have problems such as idle slots and redundant prefixes. In this paper, a time slot detection-based M -ary tree (Time Slot Detection based M -ary tree, TSDM) tag anticollision algorithm has been proposed. When a collision occurs, the reader sends a predetection command to detect the distribution of the m -bit ID in the 2m subslots; then, the time slot after predetection is processed according to the format of the frame-like. The idle time slots have been eliminate through the detection. Using a frame-like mode, only the frame start command carries parameters, and the other time slot start commands do not carry any parameters, thereby reducing the communication of each interaction. Firstly, the research status of the anticollision algorithm is summarized, and then the TSDM algorithm is explained in detail. Finally, through theoretical analysis and simulation, it is proved that the time cost of the TSDM algorithm proposed in this paper is reduced by 12.57%, the energy cost is reduced by 12.65%, and the key performance outperforms the other anticollision algorithms.

show abstract

“…The anti-collision algorithm for identifying multiple tags in the RFID system is largely classified into a probabilistic and a deterministic method [2], [3], [4]. The probabilistic method uses FSA (Frame Slotted ALOHA) algorithm based on ALOHA method, which is adopted as standard in EPCglobal Class-1 Gen-2 and ISO/IEC 18000-7 [5], [6].…”

Section: Introductionmentioning

confidence: 99%

Brief Paper: Simplified Tag Identification Algorithm by Modifying Tag Collection Command in Active RFID System

Lim¹

2020

J Multimed Inf Syst

View full text Add to dashboard Cite

In this paper, we propose a simplified tag collection algorithm to improve the performance of ISO / IEC 18000-7, the standard of active RFID systems. In the proposed algorithm, the collection command is modified to include the result of the listening period response from the previous round. The tag, which has received the collection command, checks whether the slot to which it has responded is collided, transmits additional data to its data slot without a point-to-point read command and sleep command, and transitions to the sleep mode. The collection round in the standard consists of a series of collection commands, collection responses, read commands, read responses, and sleep commands. On the other hand, in the proposed tag collection algorithm, one collection round consists only of a collection command and a collection response. As a result of performance analysis, it can be seen that the proposed technique shows superior performance compared to the standard.

show abstract

Efficient tag reading protocol for large-scale RFID systems with pre-reading

Cited by 13 publications

References 25 publications

Improving Efficiency of Passive RFID Tag Anti-Collision Protocol Using Dynamic Frame Adjustment and Optimal Splitting

Improving Efficiency of Passive RFID Tag Anti-Collision Protocol Using Dynamic Frame Adjustment and Optimal Splitting

Time Slot Detection‐Based M‐ary Tree Anticollision Identification Protocol for RFID Tags in the Internet of Things

Brief Paper: Simplified Tag Identification Algorithm by Modifying Tag Collection Command in Active RFID System

Contact Info

Product

Resources

About