Tree-based backoff protocol for fast RFID tag identification

doi:10.1016/S1005-8885(13)60025-4

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

Tree-based backoff protocol for fast RFID tag identification

郑嘉利¹,QIN Tuan-fa¹,倪光南²

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).

摘要/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.

关键词:

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

Abstract:

Key words:

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

参考文献

1. Eom J B, Yim S B, Lee T J. An efficient reader anticollision algorithm in dense RFID networks with mobile RFID readers. IEEE Transctions on Industrial Electronics, 2009, 56(7): 2326-2336

2. Laporta T F, Maselli G, Petrioli C. Anticollision protocols for single-reader RFID systems: temporal analysis and optimization. IEEE Transactions on Mobile Computing, 2011, 10(2): 267-279

3. Bletsas A, Siachalou S, Sahalos J N. Anti-collision backscatter sensor networks. IEEE Transctions on Wireless Communications, 2009, 8(10): 5018-5029

4. Park J, Lee T J. Error resilient estimation and adaptive binary selection for fast and reliable identification of RFID tags in error-prone channel. IEEE Transactions on Mobile Computing, 2012, 11(6): 959-969

5. Konstantinou N. Expowave: an RFID anti-collision algorithm for dense and lively environments. IEEE Transactions on Communications, 2012, 60(2): 352-356

6. Maguire Y, Pappu R. An optimal Q-algorithm for the ISO 18000-6C RFID protocol. IEEE Transctions on Automation Science and Engineering, 2009, 6(1): 16-24

7. Wang Y Q, Jiang G P, Wang J. Framed slotted ALOHA with grouping tactic and binary selection for anti-collision in RFID systems. The Journal of China Universities of Posts and Telecommunications, 2009, 16 (4): 47-52

8. Yang C N, He J Y. An effective 16-bit random number aided query tree algorithm for RFID tag anti-collision. IEEE Communications Letters, 2011, 15(5): 539-541

9. Klair D K, Chin K W, Raad R. A survey and tutorial of RFID anti-collision protocols. IEEE Communications Surveys & Tutorials, 2010, 12(3): 400-421

10. Plessky V P. Review on SAW RFID tags. IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control, 2009, 57(3): 14-23

Tree-based backoff protocol for fast RFID tag identification

Tree-based backoff protocol for fast RFID tag identification

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 0

编辑推荐

Metrics

本文评价