Tree-based backoff protocol for fast RFID tag identification  

作　　者：ZHENG Jia-li QIN Tuan-fa NI Guang-nan 

机构地区：[1]School of Computer and Electronic Information, Guangxi University [2]Institute of Computing Technology, Chinese Academy of Science

出　　处：《The Journal of China Universities of Posts and Telecommunications》2013年第2期37-41,共5页中国邮电高校学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(61261023);the Guangxi Natural Science Foundation(2012GXNSFBA053160,2011GXNSFA018169,2011GXNSFD018024);the Guangxi Education Department Science Foundation(201010LX016);the Guangxi Science Research and Technology Development Program(12118017-9A)

摘　　要：This paper proposes a tree-based backoff （TBB） protocol that reduces the number of iterations implemented in the procedure of tag collision arbitration in radio frequency identification （RFID） systems. This is achieved by employing the following mechanisms： one is send the request command iteratively to all tags in the interrogation zone until a single tag is identified. The other is backward to the parent node instead of root node to obtain the request parameters and send the request command again until all tags are identified. Compared with the traditional tree-based protocol, on average, simulated results show that the TBB protocol reduces the number of the iterations by 72.3% and the identification delay by 58.6% and achieves the goal of fast tag identification.This paper proposes a tree-based backoff （TBB） protocol that reduces the number of iterations implemented in the procedure of tag collision arbitration in radio frequency identification （RFID） systems. This is achieved by employing the following mechanisms： one is send the request command iteratively to all tags in the interrogation zone until a single tag is identified. The other is backward to the parent node instead of root node to obtain the request parameters and send the request command again until all tags are identified. Compared with the traditional tree-based protocol, on average, simulated results show that the TBB protocol reduces the number of the iterations by 72.3% and the identification delay by 58.6% and achieves the goal of fast tag identification.

关 键 词：RFID tag collision arbitration tree-based anti-collision protocol 

分 类 号：TP391.44[自动化与计算机技术—计算机应用技术]