中国邮电高校学报(英文)

• Wireless • 上一篇    下一篇

Tree-based backoff protocol for fast RFID tag identification

郑嘉利1,QIN Tuan-fa1,倪光南2   

  1. 1. 广西大学
    2. 中国科学院
  • 收稿日期:2012-07-22 修回日期:2012-12-08 出版日期:2013-04-30 发布日期:2013-04-26
  • 通讯作者: 郑嘉利 E-mail:lemontree312@live.cn
  • 基金资助:

    This work was 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), and the Guangxi Science Research and Technology Development Program (12118017-9A).

Tree-based backoff protocol for fast RFID tag identification

  • Received:2012-07-22 Revised:2012-12-08 Online:2013-04-30 Published:2013-04-26
  • Contact: Jia-Li ZHENG E-mail:lemontree312@live.cn
  • Supported by:

    This work was 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), and 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.

关键词:

RFID, tag collision arbitration, tree-based anti-collision protocol

Abstract:

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.

Key words:

RFID, tag collision arbitration, tree-based anti-collision protocol