Bi-slotted Binary Tree Algorithm with Stack for Radio Frequency Identification Tag Anti-Collision

A radio frequency identification （RFID） reader will fail to identify tags if a collision occurs. This paper proposes a bi-slotted binary tree algorithm （BSBTA） with stack for RFID tag anti-collision to improve the performance of binary tree algorithm （BTA）. In BSBTA, the reader detects collisions by...

Full description

Saved in:
Bibliographic Details
Published inShanghai jiao tong da xue xue bao Vol. 18; no. 2; pp. 173 - 179
Main Author 田芸 陈恭亮 李建华
Format Journal Article
LanguageEnglish
Published Heidelberg Shanghai Jiaotong University Press 01.04.2013
Subjects
Algorithms
Architecture
Collision avoidance
Computer Science
Electrical Engineering
Engineering
Life Sciences
Materials Science
Query processing
Radio frequency identification
Readers
Stacks
Tags
Trees
anti-collision
binary tree
TN 92
tag identification
radio frequency identification (RFID)
Online AccessGet full text

Cover

More Information
Summary:A radio frequency identification （RFID） reader will fail to identify tags if a collision occurs. This paper proposes a bi-slotted binary tree algorithm （BSBTA） with stack for RFID tag anti-collision to improve the performance of binary tree algorithm （BTA）. In BSBTA, the reader detects collisions by Manchester code and stores colliding prefixes in a stack. The query is composed of a two-bit prefix and an index value. Following every reader query, there are two timeslots for tags whose pointers and identities （IDs） match the query to respond, one for the tag whose next bit is 0 and the other for the tag with 1 as its next bit. Performance analysis and evaluation are also given. The time complexity and the communication complexity of BTA and BSBTA are derived. The simulation results compare the performance of BSBTA with several related anti-collision algorithms. It is shown that BSBTA outperforms BTA in terms of the average number of responded bits and timeslots for one tag identification.
Bibliography:TIAN Yuna, CHEN Gong-liang, LI Jian-hua （1. School of Information Security Engineering; 2. Department of Electronic Engineering Shanghai Jiaotong University, Shanghai 200240, China）
31-1943/U
radio frequency identification （RFID）, anti-collision, binary tree, tag identification
A radio frequency identification （RFID） reader will fail to identify tags if a collision occurs. This paper proposes a bi-slotted binary tree algorithm （BSBTA） with stack for RFID tag anti-collision to improve the performance of binary tree algorithm （BTA）. In BSBTA, the reader detects collisions by Manchester code and stores colliding prefixes in a stack. The query is composed of a two-bit prefix and an index value. Following every reader query, there are two timeslots for tags whose pointers and identities （IDs） match the query to respond, one for the tag whose next bit is 0 and the other for the tag with 1 as its next bit. Performance analysis and evaluation are also given. The time complexity and the communication complexity of BTA and BSBTA are derived. The simulation results compare the performance of BSBTA with several related anti-collision algorithms. It is shown that BSBTA outperforms BTA in terms of the average number of responded bits and timeslots for one tag identification.
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1007-1172
1995-8188
DOI:10.1007/s12204-013-1380-7